GATE CS Applied Course

GATE Previous Year Wise Questions

GATE Previous Subject Wise Questions

Question 1
A certain processor uses a fully associative cache of size 16 kB, The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
A
24 bits and 0 bits
B
28 bits and 4 bits
C
24 bits and 4 bits
D
28 bits and 0 bits
computer organization GATE 2019 Cache and main memory
Question 2
The chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has 16 address lines denoted by A15 to A0. What is the range of address (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal?

A
C800 to CFFF
B
CA00 to CAFF
C
C800 to C8FF
D
DA00 to DFFF
computer organization GATE 2019
Question 3
A
80
B
10
C
40
D
60
operating systems GATE 2019
Question 4
A
29
B
19
C
39
D
09
GATE 2019
Question 5
Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8k Band the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?
A
16 x 210
B
8 x 220
C
4 x 220
D
256 x 210
operating systems GATE 2019
Question 6
There are n unsorted arrays: A1, A2, ....,An. Assume that n is odd. Each of A1, A2, ...., An contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A1, A2, ....,An is ________ .
A
Ο(n log n)
B
Ο(n2)
C
Ο(n)
D
Ω(n2log n)
Algorithms GATE 2019
Question 7
Let G be any connection, weighted, undirected graph:
  • I. G has a unique minimum spanning tree if no two edges of G have the same weight.
  • II. G has a unique minimum spanning tree if, for every cut G, there is a unique minimum weight edge crossing the cut.
Which of the above two statements is/are TRUE?
A
Neither I nor II
B
I only
C
II only
D
Both I and II
Algorithms GATE 2019
Question 8
Consider the following snapshot of a system running n concurrent processes. Process i is holding Xi instances of a resource R, 1 ≤ i ≤ n. Assume that all instances of R arecurrently in use. Further, for all i, process i can place a request for at most Yi additional instances of R while holding the Xt instances it already has. Of the n processes, there are exactly two processes p and q such that Yp = Yq = 0. Which one of the following conditions guarantees that no other process apart from p and q can complete execution?
A
Xp + Xq < Min {Yk ? 1 ≤ k ≤ n, k ≠ p, k ≠ q}
B
Min (Xp, Xq) ≥ Min {Yk ? 1 ≤ k≤ n, k ≠ p, k ≠ q}
C
Min (Xp, Xq) ≤ Max {Yk ? 1 ≤ k ≤ n, k ≠ p, k ≠ q}
D
Xp + Xq < Max {Yk ? 1 ≤ k ≤ n, k ≠ p, k ≠ q}
operating systems GATE 2019
Question 9
Consider the following statements:
  • I. The smallest element in a max-heap is always at a leaf node.
  • II. The second largest element in a max-heap is always a child of the root node.
  • III. A max-heap can be constructed from a binary search tree in Θ(n) time.
  • IV. A binary search tree can be constructed from a max-heap in Θ(n) time.
Which of the above statements is/are TRUE?
A
II, III and IV
B
I, II and III
C
I, III and IV
D
I, II and IV
Algorithms GATE 2019
Question 10
A
2
B
3
C
1
D
4
operating systems GATE 2019
Question 11
The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointer The disk block size is 4 kB and the disk block addresses 32-bits long. The maximum possible file size is (rounded off to 1 decimal place) __________ GB. Note: This was Numerical Type question.
A
4.0
B
2.0
C
9.0
D
7.0
operating systems GATE 2019
Question 12
A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60 MHz clock. To service a cache-miss, the memory controller first takes 1 cycle to accept the starting address of the block, it then takes 3 cycles to fetch all the eight words of the block, and finally transmits the words of the requested block at the rate of 1 word per cycle. The maximum bandwidth for the memory system when the program running on the processor issues a series of read operations is _________ × 106 bytes/sec.
Note: This was Numerical Type question.
A
160
B
145
C
172
D
124
computer organization GATE 2019
Question 13
Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of T are chosen uniformly and independently at random. The expected value of the distance between a and b in T (i.e., the number of edges in the unique path between a and b) is (rounded off to 2 decimal places) ___________ .
A
5.71 to 5.73
B
4.85 to 4.86
C
2.71 to 2.73
D
4.24 to 4.26
Data Structures GATE 2019
Question 14
A
B
C
D
gate 2018
Question 15
A
B
C
D
Data Structures gate 2018
Question 16
A
B
C
D
computer organization gate 2018
Question 17
A
B
C
D
operating systems gate 2018
Question 18
A
B
C
D
operating systems gate 2018
Question 19
Submit
Data Structures gate 2018
Question 20
Submit
operating systems gate 2018
© 2020 - All rights are reserved- AAIC Technologies pvt ltd