DSC QUIZ 4

In _______ data structure elements can be added in circular fashion

• Simple Queue
• Circular Queue
• Stack
• Deque

While displaying circular queue elements, which method is suitable to increment front value? Max: Maximum size of the queue

• front=(front+1)/ Max
• front=(front+1) % Max
• front=front% Max
• front+=1

In circular queue, insertion can be done by _________

• (rear % 1) + MAXSIZE
• rear %( 1 + MAXSIZE)
• (rear +1) %MAXSIZE
• rear + ( 1 % MAXSIZE)

Front and rear end is logically connected in ________ queue

• Simple Queue
• Circular Queue
• Stack
• Deque

In priority queue elements will be inserted and deleted based on __________

• Ascending order
• Descending order
• Priority of element
• FIFO

A data structure where elements can be added or removed at both the ends called __________

• Tree
• Stack
• Queue
• Deque

A queue is called __________ when insertion as well as deletion of elements can take place at both the ends

• Tree
• Stack
• Queue
• Deque

A _______________ is queue in which insertion of an element takes place at one end only but deletion occurs at both ends.

• Output restricted Deque
• Input restricted Deque
• Dequeue
• Enqueue

A _______________ is queue in which deletion of an element takes place at one end only but insertion occurs at both ends.

• Output restricted Deque
• Input restricted Deque
• Dequeue
• Enqueue

The data is “ordered” only in the ___________

• Simple Queue
• Circular Queue
• Stack
• Deque