MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Venn Diagram

Which of the ...

Question

Which of the following data structure is efficient to implement priority queue with basic operation such as insertion, deletion and searching ?

A

Sorted array

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

Linked list

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

Heap

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

Unsorted array

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A Sorted array
Priority queue:
1. Via linked list : Insertion = O(n) , Deletion =O(1), Search = O(n)
2. Via Sorted array : Insertion = O(n) , Deletion = O(1) , Search =O(logn)
3. Via Unsorted array : Insertion =O(1) , Deletion = O(n), Search =O(n)
4. Via Heap list : Insertion =O(logn), Deletion = O(logn), Search = O(n)

Suggest Corrections

thumbs-up

0

Similar questions

Q. Suppose a circular queue of capacity (n - 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array indeed variables respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

Q. A queue is implemented using an array such that n ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)?

Q. Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are:

(i) is Empty (Q) : returns true if the queue is Empty, false otherwise.
(ii) delete (Q) : delete the elements at the front of the queue and returns its value.
(iii) insert (Q, i) : insert the integer i at the rear of the queue.

Consider the following functions:

void f (queue Q)
{
int i;
if (! is Empty (Q))
{
i = delete (Q);
f(Q);
insert (Q, i);
}
}

What operation is performed by the above function f?

Q. A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node
and the rear node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time?
I . Next pointer of front node points to the rear node.
II . Next pointer of rear node points to the front node.

Q. A priority queue is implemented as a max-heap initially, it has five elements. The level-order traversal of the heap is as follows:
20, 18, 15, 13, 12
Two new elements '10' and '17' are inserted in the heap in that order, The level-order traversal of the heap after the insertion of the element is

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Venn Diagrams

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Standard XII Mathematics

Join BYJU'S Learning Program

CrossIcon