Data Structure - Queue

Minimum number of queues required for priority queue implementation?

• 5

• 4

• 3

• 2

What data structure is used for breadth first traversal of a graph?

• queue

• stack

• list

• none of the above

A queue data-structure can be used for −

• expression parsing

• recursion

• resource allocation

• all of the above

If locality is a concern, you can use _______ to traverse the graph.

• Breadth First Search

• Depth First Search

• Either BFS or DFS

• None of the above!

Aposterior analysis are more accurate than apriori analysis because −

• it contains the real dat

• it assumes all other factors to be dynamic

• it assumes all other factors to be constant.

• it is a result of reverse-engineering.

Prefix notation is also known as

• Reverse Polish Notation

• Reverse Notation

• Polish Reverse Notation

• Polish Notation

If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?

• Ο(n), Ο(n)

• Ο(n), Ο(1)

• Ο(1), Ο(n)

• Ο(1), Ο(1)

Queue data structure works on

• LIFO

• FIFO

• FILO

• none of the above

……………. Is a pile in which items are added at one end and removed from the other.

• stack

• queue

• list

• array

Which data structure allows deleting data elements from and inserting at rear?

• stack

• queue

• list

• array