List of top Programming and Data Structure Questions asked in GATE CS, GATE NM

Consider the following C code segment:

int x = 126, y = 105;
do {
    if (x > y)
        x = x - y;
    else
        y = y - x;
} while (x != y);

printf("%d", x);

The output of the given C code segment is ____________. (Answer in integer)

Consider the following C program

The value printed by the given C program is __________ (Answer in integer).

Consider the following C program:

Which one of the following options is correct for the given data in the table?

An array \( A \) of length \( n \) with distinct elements is said to be bitonic if there is an index \( 1 \leq i \leq n \) such that \( A[1..i] \) is sorted in the non-decreasing order and \( A[i+1 .. n] \) is sorted in the non-increasing order. Which ONE of the following represents the best possible asymptotic bound for the worst-case number of comparisons by an algorithm that searches for an element in a bitonic array \( A \)?

Consider an unordered list of \(N\) distinct integers. What is the minimum number of element comparisons required to find an integer in the list that is NOT the largest in the list?

Consider a stack data structure into which we can PUSH and POP records. Assume that each record pushed in the stack has a positive integer key and that all keys are distinct. We wish to augment the stack data structure with an \( O(1) \) time MIN operation that returns a pointer to the record with the smallest key present in the stack: 1) Without deleting the corresponding record, and 2) Without increasing the complexities of the standard stack operations. Which one or more of the following approach(es) can achieve it?

Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into the I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch whenever a process requests an I/O, and also whenever the process returns from an I/O. The number of times the process will enter the ready queue during its lifetime (not counting the time the process enters the ready queue when it is run initially) is _________ (Answer in integer).

Consider the following C program:

The output of the above program is __________ . (Answer in integer)

Consider the following C code segment:

The output of the given C code segment is __________. (Answer in integer)

Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into the I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch whenever a process requests an I/O, and also whenever the process returns from an I/O. The number of times the process will enter the ready queue during its lifetime (not counting the time the process enters the ready queue when it is run initially) is _________ (Answer in integer).

Consider the following C program

The value printed by the given C program is _________ (Answer in integer).

Consider the following C function definition. \begin{verbatim} int fX(char *a){ char *b = a; while(*b) b++; return b - a; } \end{verbatim} Which of the following statements is/are TRUE?

Consider the following C program. Assume parameters to a function are evaluated from right to left.} \begin{verbatim} #include stdio.h int g(int p) { printf("%d", p); return p; } int h(int q) { printf("%d", q); return q; } void f(int x, int y) { g(x); h(y); } int main() { f(g(10), h(20)); } \end{verbatim} Which one of the following options is the CORRECT output of the above C program?

Which of the following sequences of output can be generated?