GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2023 · CS - Forenoon
Programming & Data StructuresTreeshardMCQ2 marks
Let A be a priority queue for maintaining a set of elements. Suppose A is implemented using a max-heap data structure. The operation Extract-Max(A) extracts and deletes the maximum element from A. The operation Insert(A,key) inserts a new element key in A. The properties of a max-heap are preserved at the end of each of these operations. When A contains n elements, which one of the following statements about the worst case running time of these two operations is TRUE?
Save your progress

Related Programming & Data Structures PYQs

GATE 2023 · CS - Forenoon

Which one of the following sequences when stored in an array at locations A[1],...,A[10] forms a max-heap?

GATE 2023 · CS - Forenoon

Let SLLdel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the …

GATE 2023 · CS - Forenoon

An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize…

GATE 2023 · CS - Forenoon

The integer value printed by the ANSI-C program given below is __________. ```c #include<stdio.h> int funcp(){ static int x = 1;…

GATE 2023 · CS - Forenoon

Consider a sequence a of elements a0=1, a1=5, a2=7, a3=8, a4=9, and a5=2. The following operations are performed on a stack S and …

GATE 2023 · CS - Forenoon

Consider the C function foo and the binary tree shown. ```c typedef struct node { int val; struct node *left, *right; } n…