1
GATE CSE 1999
MCQ (Single Correct Answer)
+2
-0.6
If T1 = O(1), give the correct matching for the following pairs:

List - I

(M) Tn = Tn - 1 + n
(N) Tn = Tn/2 + n
(O) Tn = Tn/2 + nlog n
(P) Tn = Tn - 1 + log n

List - II

(U) Tn= O(n)
(V) Tn = O(nlogn)
(W) Tn = O(n2)
(X) Tn = O(log2n)
A
M – W N – V O – U P – X
B
M – W N – U O – X P – V
C
M – V N – W O – X P – U
D
M – W N – U O – V P – X
2
GATE CSE 1999
MCQ (Single Correct Answer)
+2
-0.6
The number of tokens in the Fortran statement DO 10 I = 1.25 is
A
3
B
4
C
5
D
None of the above
3
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
The main memory of a computer has $$2$$ $$cm$$ blocks while the cache has $$2$$ $$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:
A
($$k$$ mod $$m$$) of the cache
B
($$k$$ mod $$c$$) of the cache
C
($$k$$ mod $$2c$$) of the cache
D
($$k$$ mod $$2cm$$) of the cache
4
GATE CSE 1999
Subjective
+5
-0
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. GATE CSE 1999 Computer Organization - Pipelining Question 21 English

Find the number of clock cycles needed to perform the $$5$$ instructions

EXAM MAP