Let n be an odd number greater than 100. Consider a binary minheap with n elements stored in an array P whose index starts from 1.…
Consider a hash table P[0, 1, ..., 10] that is initially empty. The hash table is maintained using open addressing with linear pro…
The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible h…
Consider the following program in C: ```c #include <stdio.h> void func(int i, int j) { if(i < j) { int i = 0; while (i <…
Consider the following code snippet in C language that computes the number of nodes in a non-empty singly linked list pointed to b…
Consider the recursive functions represented by the following code segment: ```c int bar(int n){ if (n == 1) return 0; else return…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.