GATE CS question library

The correct matching for the following pairs is: …

I/O redirection

When an interrupt occurs, an operating system

Locality of reference implies that the page reference being made by a process

In the lattice defined by the Hasse diagram given in following figure, how many complements does the element ‘$e$’ have?

Given $\Sigma=\{a,b\}$, which one of the following sets is not countable?

Which of the following propositions is a tautology?

Let $\left(Z, *\right)$ be an algebraic structure where $Z$ is the set of integers and the operation $*$ is defined by $n*m = \max(n,m)$. Which of the following statements is true for $\left(Z, *\right)$?

An N-bit carry lookahead adder, where $N$ is a multiple of $4$, employs ICs $74181$ ($4$ bit ALU) and $74182$ ( $4$ bit carry lookahead generator). The minimum addition time using the best architecture for this adder is

The correct matching for the following pairs is: $$\begin{array}{ll} \text{(A) DMA I/O} & \text{(1) High speed RAM} \\ \text{(B) Cache} & \text{(2) Disk} \\ \text{(C) Interrupt I/O} & \text{(3) Printer} \\ \text{(D) Condition Code Register} & \text{(4) ALU} \\ \end{array}$$

Purpose of a start bit in $\text{RS-232}$ serial communication protocol is:

Let $*$ be defined as $x * y = \bar{x} + y$. Let $z = x * y$. Value of $z * x$ is

Heap allocation is required for languages.

The conditional expansion facility of macro processor is provided to

A language $L$ allows declaration of arrays whose sizes are not known during compilation. It is required to make efficient use of memory. Which one of the following is true?

Which of the following is essential for converting an infix expression to the postfix form efficiently?

In the following grammar $X ::= X \oplus Y \mid Y$ $Y::= Z * Y \mid Z$ $Z::= id$ Which of the following is true?

The correct matching for the following pairs is …

The determinant of the matrix $\begin{bmatrix} 6 & -8 & 1 & 1 \\ 0 & 2 & 4 & 6 \\ 0 & 0 & 4 & 8 \\ 0 & 0 & 0 & -1 \end{bmatrix}$

The concatenation of two lists is to be performed on $O(1)$ time. Which of the following implementations of a list should be used?