GATE CS question library

An instruction pipeline consists of $4$ stages – Fetch $(F)$, Decode field $(D)$, Execute $(E)$ and Result Write $(W)$. The $5$ instructions in a certain instruction sequence need these stages for the different number of clock cycles as shown by the table below …

Which of the following is/are correct?

Consider the following $C$ function definition int Trial (int a, int b, int c) { if ((a>=b) && (c<b)) return b; else if (a>=b) return Trial(a, c, b); else return Trial(b, a, c); } The functional Trial:

The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typically

A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor?

If $T_1 = O(1)$, give the correct matching for the following pairs: …

Raid configurations of the disks are used to provide

Arrange the following configuration for CPU in decreasing order of operating speeds: Hard wired control, Vertical microprogramming, Horizontal microprogramming.

Zero has two representations in

A grammar that is both left and right recursive for a non-terminal, is

The number of full and half-adders required to add $16$-bit numbers is

Consider the following program in a language that has dynamic scooping: var x: real; procedure show: begin print(x);end; procedure small; var x: real; begin x: = 0.125; show; end; begin x:=0.25 show; small end. Then the output of the program is:

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., …