1
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
A $$CPU$$ has a cache with block size $$64$$ bytes. The main memory has $$k$$ banks, each bank being $$c$$ bytes wide. Consecutive $$c$$-byte chunks are mapped on consecutive banks with wrap-around. All the $$k$$ banks can be accessed in parallel, but two accesses to the same bank must be serialized. A cache block access may involve multiple iterations of parallel bank accesses depending on the amount of data obtained by accessing all the $$k$$ banks in parallel. Each iteration requires decoding the bank numbers to be accessed in parallel and this takes $$k/2$$ $$ns.$$ The latency of one bank access is $$80$$ $$ns.$$ If $$c=2$$ and $$k=24,$$ then latency of retrieving a cache block starting at address zero from main memory is
A
$$92$$ $$ns$$
B
$$104$$ $$ns$$
C
$$172$$ $$ns$$
D
$$184$$ $$ns$$
2
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Given two three bit number $${a_2}{a_1}{a_0}$$ and $${b_2}{b_1}{b_0}$$ and $$c,$$ the carry in the function that represents the carry generate function when these two numbers are added is
A
$$\eqalign{ & {a_2}{b_2} + {a_2}{a_1}{b_1} + {a_2}{a_1}{a_0}{b_0} + {a_2}{a_0}{b_1}{b_2}{b_1} \cr & + {a_1}{a_0}{b_2}{b_0} + {a_0}{b_2}{b_1}{b_0} \cr} $$
B
$$\eqalign{ & {a_2}{b_2} + {a_2}{b_1}{b_0} + {a_2}{a_1}{b_1}{b_0} + {a_1}{a_0}{b_2}{b_1} + {a_1}{a_0}{b_2} \cr & + {a_1}{a_0}{b_2}{b_0} + {a_2}{b_0}{b_1}{b_0} \cr} $$
C
$${a_2} + {b_2} + \left( {{a_2} \oplus {b_2}} \right)\left( {{a_1} + {b_1} + \left( {{a_1} \oplus {b_1}} \right)\left( {{a_0} + {b_0}} \right)} \right)$$
D
$$\eqalign{ & {a_2}{b_2} + \overline {{a_2}} {a_1}{b_1} + \overline {{a_2}{a_1}} {a_0}{b_0} + \cr & {a_2}{a_0}\overline {{b_1}} {b_0} + {a_1}\overline {{b_2}} {b_1} + \overline {{a_1}} {a_0}\overline {{b_2}} {b_0} + {a_0}\overline {{b_2}{b_1}} {b_0} \cr} $$
3
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Let T be a depth first search tree in an undirected graph G. Vertices u and v are leaves of this tree T. The degrees of both u and v in G are at least 2. which one of the following statements is true?
A
There must exist a vertex w adjacent to both u and v in G
B
There must exist a vertex w whose removal disconnects u and v in G
C
There must exist a cycle in G containing u and v
D
There must exist a cycle in G containing u and all its neighbours in G.
4
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Consider the depth-first-search of an undirected graph with 3 vertices P, Q, and R. Let discovery time d(u) represent the time instant when the vertex u is first visited, and finish time f(u) represent the time instant when the vertex u is last visited. Given that
d(P) = 5 units      f(P) = 12 units
d(Q) = 6 units      f(Q) = 10 units
d(R) = 14 unit      f(R) = 18 units
Which one of the following statements is TRUE about the graph
A
There is only one connected component
B
There are two connected components, and P and R are connected
C
There are two connected components, and Q and R are connected
D
There are two connected components, and P and Q are connected
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12