GATE 2023: Subject Revision Quiz-1

What is the best case to find the smallest element in binary search tree implemented using single linked list with n × log n elements?

In a 'for loop' if the condition is missing, then infinite looping can be avoided by a_

consider the following linked list

On implement following code fragment, what will be the output

struct node{

int data;

struct node *link;

};

struct node* p,*head;

p=head->link->link;

printf(“%d”,p->link->data);

Identify the valid declaration of a Boolean?

Which of the following data structure  used by recursion?

Which of the following special symbol allowed in a variable name?

The minimum number of interchanges required to convert this heap into a min-heap.

What is the maximum height of an AVL tree with 53 nodes?

Consider the set of elements 75 28 18 27 9 39 50. We form a binary tree by placing them level wise and left to right. The difference between the total number of nodes and the number of nodes satisfying the max heap property is _____.

Consider the Tower of Hanoi problem in which we have 3 towers and 'n' discs in the leftmost tower. The size of all the discs are different and bigger disc cannot be put onto smaller disc. Our task is to move those 'n' discs from left tower to right tower using middle tower as intermediate. Consider the following recursive program to do so :

TOH(n,L,M,R)

{

if(n==0)

return

else

{

TOH(n-1,L,R,M);

Move(L->R);

TOH(n-1,M,L,R);

}

}

Find the number of moves required to move 5 discs from left to right tower _______.

Which of the following is true?