1 The front of a queue containing the items a b c is on the left. After two dequeue operations, the queue contains a a b c 2 The front of a queue containing the items a b c is on the left. After the...

1 The front of a queue containing the items a b c is on the left. After two dequeue operations, the queue contains

a a

b c

2 The front of a queue containing the items a b c is on the left. After the peration enqueue(d), the queue contains

a a b c d

b d a b c

3  Memory for objects such as nodes in a linked structure is allocated on

a the object heap

b the call stack

4 The running time of the two queue mutator operations is

a linear

b constant

5 The linked implementation of a queue uses

a nodes with a link to the next node

b nodes with links to the next and previous nodes

c nodes with a link to the next node and an external pointer to the first node and an external pointer to the last node