DSA

If the elements “P”, “Q”, “R” and “S” are placed in a queue and are deleted one at a time, in what order will they be removed?

• PQRS

• QPRS

• RPSQ

• SRQP

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

• At the start of link list

• At the end of the link list

• At the center position in the link list

• None

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

• Queue

• Circular queue

• Dequeue

• Priority queue

Which type of queue can be used as queue or stack

• Dequeue

• Simple queue

• Circular queue

• Priority queue

This data structure allows deletions at both ends of the list but insertion at only one end.

• Input-restricted deque

• Output-restricted deque

• Priority queues

• None of the above

A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

• Queue linked list

• Stack linked list

• Both of them

• None

In a priority queue, insertion and deletion takes place at ………………

• Front, rear end

• Only at rear

• Only at front

• at any position

What will be the front and rear of an initially empty queue after following the following operations on it? enqueue(10), enqueue(15), dequeue(), enqueue(5)

• 15, 5

• 1,3

• 10, 5

• 15, 10

In a circular queue of size 8, front is 7 and rear is 2 , Where will be next element get inserted (position)

In a simple queue using array of size 6, front is 3 and rear is 5, Where the next element will get inserted

• Can not

  insert

• Insert

  at 0

• Insert

  at 1