GATE CS question library

A language with string manipulation facilities uses the following operations head(s): first character of a string tail(s): all but exclude the first character of a string concat(s1, s2): s1s2 For the string "$acbc$" what will be the output of concat(head(s), head(tail(tail(s))))

The address sequence generated by tracing a particular program executing in a pure demand based paging system with $100$ records per page with $1$ free main memory frame is recorded as follows. What is the number of page faults? $0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370$

The sequence __________ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ________ unit(s) of time. …

What values of $A, B, C$ and $D$ satisfy the following simultaneous Boolean equations? $\overline{A} + AB =0, AB=AC, AB+A\overline{C}+CD=\overline{C}D$

What is the value of $X$ printed by the following program? program COMPUTE (input, output); var X:integer; procedure FIND (X:real); begin X:=sqrt(X); end; begin X:=2 FIND(X); writeln(X); end.

Assume that $X$ and $Y$ are non-zero positive integers. What does the following Pascal program segment do? while X <> Y do if X > Y then X := X - Y else Y := Y - X; write(X);

The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many separate address and data lines are needed for a memory of $4K \times 16$?

The minimum number of edges in a connected cyclic graph on $n$ vertices is:

The rank of the following $(n+1) \times (n+1)$ matrix, where $a$ is a real number is …

In the interval $[0, \pi]$ the equation $x=\cos x$ has

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?