GATE CS question library

The number of elements in the power set $P(S)$ of the set $S=\{\{\emptyset\}, 1, \{2, 3\}\}$ is:

Let $R$ be a symmetric and transitive relation on a set $A$. Then

A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is

For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of

Which scheduling policy is most suitable for a time shared operating system?

A linker is given object modules for a set of programs that were compiled separately. What information need not be included in an object module?

What is the distance of the following code $000000$, $010101$, $000111$, $011001$, $111111$?

What are $x$ and $y$ in the following macro definition? macro Add x, y Load y Mul x Store y end macro

Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is:

Which of the following page replacement algorithms suffers from Belady’s anamoly?

In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If $L$ and $D$ denote the sets of letters and digits respectively, which of the following expressions defines an identifier?

In a paged segmented scheme of memory management, the segment table itself must have a page table because

The principle of locality justifies the use of:

In the following Pascal program segment, what is the value of X after the execution of the program segment? X := -10; Y := 20; If X > Y then if X < 0 then X := abs(X) else X := 2*X;

In a vectored interrupt:

Merge sort uses:

Which of the following statements is true?

The probability that a number selected at random between $100$ and $999$ (both inclusive) will not contain the digit $7$ is:

State whether the following statements are True or False with reasons for your answer A symbol declared as ‘external’ in an assembly language program is assigned an address outside the program by the assembler itself.

Consider the following recursive function: function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end; The above function is run on a computer with a stack of $64$ bytes. Assuming that only return address and parameter are passed on the stack, and that an integer value and an address takes $2$ bytes each, …