GATE CS question library

Which of the following is the most powerful parsing method?

If $n$ is a power of $2$, then the minimum number of multiplications needed to compute $a^n$ is

The number of articulation points of the following graph is

If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$ then the order of these elements after second pass of the algorithm is:

Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is

A sorting technique is called stable if

System calls are usually invoked by using

Which of the following disk scheduling strategies is likely to give the best throughput?

Listed below are some operating system abstractions (in the left column) and the hardware components (in the right column) …

Which of the following functions implements the Karnaugh map shown below?

Which of the following expressions is not equivalent to $\bar{x}$?

Context-free languages are closed under:

Consider the regular expression $(0 + 1) (0+1) \dots N$ times. The minimum state finite automaton that recognizes the language represented by this regular expression contains

The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is

The number of binary relations on a set with $n$ elements is:

Suppose that the expectation of a random variable $X$ is $5$. Which of the following statements is true?

The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is:

Let $L_1$ be the set of all languages accepted by a PDA by final state and $L_2$ the set of all languages accepted by empty stack. Which of the following is true?

In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following situation was encountered: …

Two friends agree to meet at a park with the following conditions. Each will reach the park between 4:00 pm and 5:00 pm and will see if the other has already arrived. If not, they will wait for 10 minutes or the end of the hour whichever is earlier and leave. What is the probability that the two will not meet?