GATE CS question library

Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be completely satisfied. Three processes $P1$, $P2$, $P3$ request the resources as follows if …

Consider a $4$-way set associative cache (initially empty) with total $16$ cache blocks. The main memory consists of $256$ blocks and the request for memory blocks are in the following order: $0, 255, 1, 4, 3, 8, 133, 159, 216, 129, 63, 8, 48, 32, 73, 92, 155.$ Which one of the following memory block will NOT be in cache if LRU replacement policy is …

Consider a $4$ stage pipeline processor. The number of cycles needed by the four instructions $I1, I2, I3, I4$ in stages $S1, S2, S3, S4$ is shown below: …

Given the following state table of an FSM with two states $A$ and $B$,one input and one output. …

Consider a HTML table definition given below: <table border =1> <tr> <td rowspan=2> ab </td> <td colspan=2> cd </td> </tr> <tr> <td> ef </td> <td rowspan=2> gh </td> </tr> <tr> <td colspan=2> ik </td> </tr> </table> The number of rows in each column …

The coupling between different modules of a software is categorized as follows: Content coupling Common coupling Control coupling Stamp coupling Data coupling Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (most desirable) as follows:

Consider the program below: #include <stdio.h> int fun(int n, int *f_p) { int t, f; if (n <= 1) { *f_p = 1; return 1; } t = fun(n-1, f_p); f = t + *f_p; *f_p = t; return f; } int main() { int x = 15; printf("%d/n", fun(5, &x)); return 0; } The value printed is:

Match all items in Group 1 with the correct options from those given in Group 2. …

Which one of the following is FALSE?

Which one of the following languages over the alphabet $\{0,1\}$ is described by the regular expression: $(0+1)^*0(0+1)^*0(0+1)^*$?

Let $\pi_A$ be a problem that belongs to the class NP. Then which one of the following is TRUE?

Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm? P: Always finds a negative weighted cycle, if one exists. Q: Finds whether any negative weighted cycle is reachable from the source.

$$S \to aSa \mid bSb\mid a\mid b$$ The language generated by the above grammar over the alphabet $\{a,b\}$ is the set of:

What is the number of swaps required to sort $n$ elements using selection sort, in the worst case?

The essential content(s) in each entry of a page table is / are

In which one of the following page replacement policies, Belady's anomaly may occur?

A CPU generally handles an interrupt by executing an interrupt service routine:

How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $256K$ bytes?

What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates?

$(1217)_8$ is equivalent to