Queue

Which the following is not true about queue?

• An ordered collection of items where the addition of new items happens at one end

• The simplest example of a queue is the typical line that we all participate in from time to time.

• As an element enters the queue it starts at the rear and makes its way toward the front, waiting until that time when it is the next element to be removed.

• An ordered collection of items where the addition of new items and the removal of existing items always takes place at the same end

Suppose you have the following series of queue operations.

q = Queue();

q.enqueue('hello');

q.enqueue('dog');

q.enqueue(3);

q.dequeue();

What items are left on the queue?

• 'hello', 'dog'

• 'dog', 3

• 'hello', 3

• 'hello', 'dog', 3

Suppose you have the following series of queue operations.

q = Queue();

q.enqueue('hello');

q.enqueue('dog');

q.dequeue();

q.enqueue('3');

q.dequeue();

What items are the output?

• hellodog

• hello

• doghello

• hellodog3

• 3

Suppose you have the following series of queue operations.

q = Queue();

q.enqueue(1);

q.enqueue(10);

q.enqueue(100);

q.dequeue();

q.dequeue();

What items are the output?

• 10010

• 101

• 110

• 10010

If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and then removed one at a time, in what order will they be removed?

• ABCD

• ABDC

• DCAB

• DCBA

One difference between a queue and a stack is:

• Queues require linked lists, but stacks do not.

• Stacks require linked lists, but queues do not.

• Queues use two ends of the structure; stacks use only one.

• Stacks use two ends of the structure, queues use only one.

Suppose we have a circular array implementation of the queue, with ten items in the queue stored at data[2] through data[11]. The current capacity is 42. Where does the insert method place the new entry in the array?

• data[1]

• data[2]

• data[11]

• data[12]

In the linked list implementation of the queue , where does the insert method place the new entry on the linked list?

• At the front

• At the rear

• After all other entries that are greater than the new entry.

• After all other entries that are smaller than the new entry.

In the linked list implementation of the queue , where does the delete method on the linked list?

• At the infront

• At the rear

• At the middle

• At the top

If data is a circular array of CAPACITY elements, and rear is an index into that array, what is the formula for the index after rear?

• ( rear % 1) + CAPACITY

• rear % (1 + CAPACITY)

• (rear + 1) % CAPACITY

• rear + (1 % CAPACITY)