Register
Filter

Recent activity by SiddharthMahapatra

4 answers
5
GATE CSE 1995 | Question: 1.8
Which of the following page replacement algorithms suffers from Belady’s anamoly? Optimal replacement LRU FIFO Both (A) and (C)
Which of the following page replacement algorithms suffers from Belady’s anamoly?Optimal replacementLRUFIFOBoth (A) and (C)
2 answers
6
GATE CSE 2002 | Question: 1.13
Which of the following is not a form of memory instruction cache instruction register instruction opcode translation look-a-side buffer
Which of the following is not a form of memoryinstruction cacheinstruction registerinstruction opcodetranslation look-a-side buffer
2 answers
7
GATE CSE 1999 | Question: 1.9
Listed below are some operating system abstractions (in the left column) and the hardware components (in the right column) ... 4 (A) - 3 (B) - 2 (C) - 4 (D) - 1 (A) - 4 (B) - 1 (C) - 2 (D) - 3
Listed below are some operating system abstractions (in the left column) and the hardware components (in the right column)$$\small \begin{array}{cl|cl}\hline \text{(A)}& ...
3 answers
8
GATE CSE 1997 | Question: 2.4
The correct matching for the following pairs is: ... $A-2\quad B-1\quad C-3\quad D-4$ $A-4\quad B-3\quad C-2\quad D-1$ $A-2\quad B-3\quad C-4\quad D-1$
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) I...
2 answers
9
GATE CSE 2010 | Question: 9
The Boolean expression of the output $f$ of the multiplexer shown below is $\overline {P \oplus Q \oplus R}$ $P \oplus Q \oplus R$ $P+Q+R$ $\overline{P+Q+R}$
The Boolean expression of the output $f$ of the multiplexer shown below is$\overline {P \oplus Q \oplus R}$$P \oplus Q \oplus R$$P+Q+R$$\overline{P+Q+R}$
2 answers
10
GATE CSE 2011 | Question: 13
Which one of the following circuits is NOT equivalent to a $2$-input $XNOR$ (exclusive $NOR$) gate?
Which one of the following circuits is NOT equivalent to a $2$-input $XNOR$ (exclusive $NOR$) gate?
5 answers
12
GATE CSE 2009 | Question: 9, ISRO2016-52
In which one of the following page replacement policies, Belady's anomaly may occur? FIFO Optimal LRU MRU
In which one of the following page replacement policies, Belady's anomaly may occur?FIFOOptimalLRUMRU
3 answers
14
GATE CSE 1998 | Question: 1.30
When the result of a computation depends on the speed of the processes involved, there is said to be cycle stealing race condition a time lock a deadlock
When the result of a computation depends on the speed of the processes involved, there is said to becycle stealingrace conditiona time locka deadlock
3 answers
15
GATE CSE 1997 | Question: 1.5
The correct matching for the following pairs is ... $\text{A-3 B-4 C-1 D-2}$ $\text{A-3 B-4 C-2 D-1}$ $\text{A-4 B-1 C-2 D-3}$
The correct matching for the following pairs is$$\begin{array}{ll|ll}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} & \...
1 answer
17
GATE CSE 2007 | Question: 42
Consider the following C function: int f(int n) { static int r = 0; if (n <= 0) return 1; if (n > 3) { r = n; return f(n-2) + 2; } return f(n-1) + r; } What is the value of $f(5)$? $5$ $7$ $9$ $18$
Consider the following C function:int f(int n) { static int r = 0; if (n <= 0) return 1; if (n 3) { r = n; return f(n-2) + 2; } return f(n-1) + r; }What is the value of ...
5 answers
18
GATE CSE 2004 | Question: 90
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2. ... $P-3\quad Q-4 \quad R-1\quad S-2$ $P-3\quad Q-4\quad R-2\quad S-1$
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2.$$\begin{array}{|ll|ll|}\hline \rlap{\textbf{Group 1}} & & \rlap{...
1 answer
20
GATE CSE 1990 | Question: 2-vi
Match the pairs in the following questions: (a) Small talk (p) Logic programming (b) LISP (q) Data flow programming (c) Prolog (r) Functional programming (d) VAL (s) Object-oriented programming ...
Match the pairs in the following questions:(a) Small talk(p) Logic programming(b) LISP(q) Data flow programming(c) Prolog(r) Functional programming(d) VAL(s) Object-orien...