GATE 2024 · CS1 - Forenoon
Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of k is
Related Programming & Data Structures PYQs
Consider the following C program: ```c #include <stdio.h> int main(){ int a = 6; int b = 0; while(a < 10) { a = a / 12 +…
Consider the following C program: ```c #include <stdio.h> void fX(); int main(){ fX(); return 0;} void fX(){ char a; if((a…
An array [82, 101, 90, 11, 111, 75, 33, 131, 44, 93] is heapified. Which one of the following options represents the first three e…
Consider the following C function definition. ```c int f(int x, int y) { for (int i=0; i<y; i++) { x=x+x+y; } return x; …
Consider the following C program. Assume parameters to a function are evaluated from right to left. ```c #include <stdio.h> int g(…
Consider the following C function definition. ```c int fX(char *a){ char *b = a; while(*b) b++; return b - a;} ``` Which…
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.