GATE CS question library

Which of the following actions is/are typically not performed by the operating system when switching context from process $A$ to process $B$?

Which of the following is/are advantage(s) of virtual memory?

A multi-user, multi-processing operating system cannot be implemented on hardware that does not support

Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?

Consider the circuit shown below. In a certain steady state, the line $Y$ is at $'1'$. What are the possible values of $A, B$ and $C$ in this state?

Consider the schema $R=(S,T, U, V)$ and the dependencies $S \rightarrow T, T \rightarrow U, U \rightarrow V$ and $V \rightarrow S$. Let $R = (R1\text{ and } R2)$ be a decomposition such that $R1 \cap R2 \neq \phi$. The decomposition is

For the schedule given below, which of the following is correct: …

Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if-then-else forward go to arbitrary go to non-recursive procedure call recursive procedure/function call repeat loop, which constructs will you not include in a programming language such that it should be possible to program the terminates (i.e., …

If $L1$ is context free language and $L2$ is a regular language which of the following is/are false?

Let $L$ be a set with a relation $R$ which is transitive, anti-symmetric and reflexive and for any two elements $a, b \in L$, let the least upper bound $lub (a, b)$ and the greatest lower bound $glb (a, b)$ exist. Which of the following is/are true?

Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves?

Consider two events $E_1$ and $E_2$ such that probability of $E_1$, $P_r[E_1]=\frac{1}{2}$, probability of $E_2$, $P_r[E_{2}]=\frac{1}{3}$, and probability of $E_1$, and $E_2$, $P_r[E_1 \: and \: E_2] = \frac{1}{5}$. Which of the following statements is/are true?

Which of the following is correct?

Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B$. Which one of the following is a key for $R$?

The Newton-Raphson method is to be used to find the root of the equation $f(x)=0$ where $x_o$ is the initial approximation and $f’$ is the derivative of $f$. The method converges

The main memory of a computer has $2\;\text{cm}$ blocks while the cache has $2\;\text{c}$ blocks. If the cache uses the set associative mapping scheme with $2$ blocks per set, then block $k$ of the main memory maps to the set:

The maximum gate delay for any output to appear in an array multiplier for multiplying two $n$ bit numbers is

Booth's coding in $8$ bits for the decimal number $-57$ is:

The relational algebra expression equivalent to the following tuple calculus expression: $\left\{t \mid t \in r \land \left(t[A] = 10 \land t[B]=20\right)\right\}$ is

Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are