A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.
a. Array
b. Linked List
c. Heap Data Structures like Binary Heap, Fibonacci Heap
d. None of the above
Answer:Heap Data Structures like Binary Heap, Fibonacci Heap
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

View All Questions on: Stacks and Queues