GATE 2012
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
Related Programming & Data Structures PYQs
Suppose a circular queue of capacity (n - 1) elements is implemented with an array of n elements. Assume that the insertion and de…
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below…
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 <…
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.