GATE 2015 · Set-1
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is:
Related Programming & Data Structures PYQs
Consider the following New-order strategy for traversing a binary tree: • Visit the root; • Visit the right subtree using New-orde…
Consider the following array of elements. 〈89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100〉. The minimum number of interchanges nee…
What is the output of the following C code? Assume that the address of x is 2000 (in decimal) and an integer requires four bytes o…
Consider the following C program segment. ```c #include <stdio.h> int main() { char s1[7] = "1234", *p; p = s1 + 2; *p…
Consider the following C program. ```c #include <stdio.h> int main() { static int a[] = {10, 20, 30, 40, 50}; static int *…
A Young tableau is a 2D array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked wi…
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.