Year-wise GATE papers
GATE 2018
10 questions and papers
GATE CS 2018 — Question 36
Consider the following C program:#include <stdio.h> struct Ournode { char x, y, z; }; int main() { struct Ournode p = {'1', '0', 'a' + 2}; struct Ournode…
GATE CS 2018 – Question 20
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is \(M\) units if the corresponding…
GATE CS 2018 — General Aptitude Q1
“Going by the ________ that many hands make light work, the school ________ involved all the students in the task.”The words that best fill the blanks in the…
GATE CS 2018 — Question 40
Let \(\mathbb{N}\) be the set of natural numbers. Consider the following sets.P: Set of rational numbers (positive and negative)Q: Set of functions from \(\{0, 1\}\) to \(\mathbb{N}\)R: Set of functions from \(\mathbb{N}\) to \(\{0, 1\}\)S: Set of finite subsets of \(\mathbb{N}\)Which of the sets above are countable?
GATE CS 2018 — Question 39
Consider the minterm list form of a Boolean function \(F\) given below.\(F(P,Q,R,S) = \sum m(0,\,2,\,5,\,7,\,9,\,11) + d(3,\,8,\,10,\,12,\,14)\)Here, \(m\) denotes a minterm and \(d\) denotes a don't care term. The number of essential…
GATE CS 2018 — Question 33
The size of the physical address space of a processor is \(2^{P}\) bytes. The word length is \(2^{W}\) bytes. The capacity of cache memory is \(2^{N}\) bytes. The…
GATE CS 2018 — Question 47
Consider a long-lived TCP session with an end-to-end bandwidth of 1 Gbps (= \(10^{9}\) bits-per-second). The session starts with a sequence number of 1234. The minimum time (in…
GATE CS 2018 — Question 19
Consider the following intermediate program in three address code:p = a - b q = p * c p = u * v q = p + qWhich…
GATE CS 2018 – Question 14
Assume that multiplying a matrix \(G_1\) of dimension \(p \times q\) with another matrix \(G_2\) of dimension \(q \times r\) requires \(pqr\) scalar multiplications. Computing the product of \(n\) matrices \(G_1 G_2 G_3 \ldots G_n\) using dynamic programming, the time…
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.