Question Detail

What are the minimum number of queues needed to implement the priority queue?

One
Two
Three
Four

Answer: Option B

Explanation:

One queue is used for the actual storing of data, and the other one is used for storing the priorities.

Similar Questions :

1. Information about an array used in a program will be stored in

symbol table
activation record
dope vector
system table

Answer: Option C

2. The complexity of linear search algorithm is

O(n)
O(log n)
O(n2)
O(n log n)

Answer: Option A

3. Which sorting method is slowest

Quick sort
Heap sort
Shell sort
Bubble sort

Answer: Option D

4. Which data structure is needed to convert infix notations to postfix notations

linear list
tree
stack
queue

Answer: Option C

5. ++i is equivalent to

i = i + 2
i = i + 1
i = i + i
i = i - 1

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1