QUEUE DATA STRUCTURE

A queue is a first in first out data structure?

• True

• False

A queue is a last in first out data structure?

• True

• False

a QUEUE in a computer acts just like people queuing for a bus - the first person in queue is going to be the first to get on the bus.

• True

• False

A Queue can only store 6 data items. The Queue is sent 4 data items: Bert, Cynthia, Cedric and Albert. Where does the "Front" pointer point?

• 0

• 1

• 2

• 3

A Queue can only store 6 data items. The Queue is sent 4 data items: Bert, Cynthia, Cedric and Albert. Where does the "Rear" pointer point?

• 0

• 1

• 2

• 3

A Queue can only store 6 data items. The Queue is sent 4 data items: Bert, Cynthia, Cedric and Albert. Where does the "Front" pointer point?

• Bert

• Cynthia

• Cedric

• Albert

A Queue can only store 6 data items. The Queue is sent 4 data items: Bert, Cynthia, Cedric and Albert. Where does the "Rear" pointer point?

• Bert

• Cynthia

• Cedric

• Albert

a special type of queue where elements are processed based on their order (natural or custom).

• Set

• Map

• Priority Queue

• Linked-List

an ordered list in which the first element added is the first element retrieved or removed (First-In, FirstOut).

• Heap

• Tree

• Stack

• 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