GATE CS 2015 Set 1 — Question 34
Consider a machine with a byte addressable main memory of \(2^{20}\) bytes, block size of 16 bytes and a direct mapped cache having \(2^{12}\) cache lines. Let the…
Year-wise GATE papers
GATE 2015
25 questions and papers
GATE CS 2015 Set 1 — Question 52
Consider a network connecting two systems located 8000 km apart. The bandwidth of the network is \(500 \times 10^{6}\) bits per second. The propagation speed of the media is \(4 \times 10^{6}\) meters per second. It is needed to design a…
GATE CS 2015 Set 1 — Question 14
Match the following:List-IList-II(P) Lexical analysis(i) Leftmost derivation(Q) Top down parsing(ii) Type checking(R) Semantic analysis(iii) Regular expressions(S) Runtime environments(iv) Activation records
GATE CS 2015 Set 2 – Question 14
An unordered list contains \(n\) distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is
GATE CS 2015 Set 1 – Question 34
Consider the following array of elements:<89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100>The minimum number of interchanges needed to convert it into a…
Answers and explanations unlock on sign-in
Every question here is free to read. A free account adds the verified key, the worked solution and your progress.