Test by Bikram | Mock GATE | Test 1 | Question: 32

Question

Fill in the blanks in the procedure:

void
Prod (Element Type X, Priority Queue H)
{
int i;
if (IsFull(H))
{
Error ("Priority queue is full");
return;
}
for (i=++H -> size; H -> Elements [i/2]>X; i/=2)
_________________
}

Find the statement which has to be placed below the for loop for inserting a key.

• A. $H$$\rightarrow$ Elements $[i]=H$ $\rightarrow$ Elements [i/2];       $H$ $\rightarrow$Elements $[i] = X$;
• B. $H$$\rightarrow$ Elements $[i/2]=H$$\rightarrow$ Elements $[i/2]$;
• C. $H$$\rightarrow$ Elements $[i^2 ]=X;$
• D. $H$$\rightarrow$ Elements $[i]=X;$

Comments

Okay, so in C, postfix "++" has higher precedence than "-->", but prefix "++" has lower precedence than "-->" (Source).

So, the condition in the for loop

for (i=++H --> size;

will be evaluated as

for (i= ++(H-->size);

and not throw a compiler error as I thought it would.

---

The for loop does not have curly braces so only 1^st statement is executed inside for loop and second statement is executed after entire for loop. Such a subtle detail… Nice question!

---

@Harsh181996

your comment made it clear :)

thank you 

Answer 1

This is a pseudo-code to insert a Node in a Priority queue.

The above code for insertion of node in min heap .

Option A is correct .