UNIT-2 QUEUE

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABDC

In linked list implementation of a queue, where does a new element be inserted?

• At the FONT of link list

• At the centre position in the link list

• At the REAR of the link list

• None of the mentioned

In linked list implementation of a queue, the important condition for a queue to be empty is?

• FRONT is null

• REAR is null

• LINK is empty

• None of the mentioned

In a circular queue, how do you increment the rear end of the queue?

• rear++

• (rear+1) % Number of Item

• (rear % Number of Item)+1

• rear–

What is the term for inserting into a full queue known as?

• overflow

• underflow

• null pointer exception

• all of the mentioned

What is the reason for using a "circular queue" instead of a regular one?

• running time of enqueue() is improved

• reuse empty spaces

• you can traverse all the elements more efficiently

• none of the above

In Queue Insertion & Deletion take place at ________________.

• same end

• first end

• different end

• last end

The essential condition which is checked before insertion in a linked queue is?

• Underflow

• Overflow

• Front value

• Rear value

Queue can be implemented using a list?

• True

• False

One difference between a queue and a stack is:

• Queues require dynamic memory, but stacks do not

• Stacks require dynamic memory, 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.