Home - Gate Computer Science - Previous Year Solved Papers - GATE Solved Paper 2017-19 - GATE 2019

GATE Solved Paper 2017-19 - GATE 2019 Online Exam Quiz

Important questions about GATE Solved Paper 2017-19 - GATE 2019. GATE Solved Paper 2017-19 - GATE 2019 MCQ questions with answers. GATE Solved Paper 2017-19 - GATE 2019 exam questions and answers for students and interviews.

1. The expenditure on the project _________ as follows: equipment Rs.20 lakhs, salaries Rs.12 lakhs, and contingency Rs.3 lakhs.

Options

A : break down

B : break

C : breaks down

D : breaks

2. The search engine’s business model ___________ around the fulcrum of trust.

Options

A : revolves

B : plays

C : sinks

D : bursts

3. Two cars start at the same time from the same location and go in the same direction. The speed of the first car is 50 km/h and the speed of the second car is 60 km/h. The number of hours it takes for the distance between the two cars to be 20 km is ____________.

Options

A : 1

B : 2

C : 3

D : 6

4. Ten friends planned to share equally the cost of buying a gift for their teacher. When two of them decided not to contribute, each of the other friends had to pay Rs 150 more. The cost of the gift was Rs. ___________.

Options

A : 666

B : 3000

C : 6000

D : 12000

5. A court is to a judge as ___________ is to a teacher.

Options

A : a student

B : a punishment

C : a syllabus

D : a school

46. Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let X 1 , X 2 , X 3 , X 4 , X 5 and X 6 be the placeholders for the non-terminals D, T, L or L 1 in the following table:

Options

A : X 1 = L, X 2 = T, X 3 = L 1 , X 4 = L

B : X 1 = L, X 2 = L, X 3 = L 1 , X 4 = T

C : X 1 = L, X 2 = L, X 3 = L 1 , X 4 = T

D : X 1 = T, X 2 = L, X 3 = T, X 4 = L 1

47. There are n unsorted arrays: A 1 , A 2 , ….,A n . Assume that n is odd. Each of A 1 , A 2 , …., A n 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 A 1 , A 2 , ….,A n is ________ .

Options

A : Ο(n)

B : Ο(n log n)

C : Ο(n 2 )

D : Ω(n 2 log n)

48. Let G be any connected, 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 of G, there is a unique minimum-weight edge crossing the cut. Which of the above two statements is/are TRUE?

Options

A : I only

B : II only

C : Both I and II

D : Neither I nor II

49. Consider the following snapshot of a system running n concurrent processes. Process i is holding X i 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 Y i additional instances of R while holding the X t instances it already has. Of the n processes, there are exactly two processes p and q such that Y p = Y q = 0. Which one of the following conditions guarantees that no other process apart from p and q can complete execution?

Options

A : X p + X q < Min {Y k ⏐ 1 ≤ k ≤ n, k ≠ p, k ≠ q}

B : X p + X q < Max {Y k ⏐ 1 ≤ k ≤ n, k ≠ p, k ≠ q}

C : Min (X p , X q ) ≥ Min {Y k ⏐ 1 ≤ k≤ n, k ≠ p, k ≠ q}

D : Min (X p , X q ) ≤ Max {Y k ⏐ 1 ≤ k ≤ n, k ≠ p, k ≠ q}

50. 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 Θ(𝑛) time IV. A binary search tree can be constructed from a max-heap in Θ(𝑛) time Which of the above statements are TRUE?

Options

A : I, II and III

B : I, II and IV

C : I, III and IV

D : II, III and IV

51. Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:

Options

A : 2

B : 3

C : 1

D : 4

52. The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 kB, and the disk block address is 32-bits long. The maximum possible file size is (rounded off to 1 decimal place) _________ GB.

Options

A : 4

B : 2

C : 1

D : 0.50

53. Consider the augmented grammar given below: S' → S S → 〈L〉 | id L → L,S | S Let I 0 = CLOSURE ({[S' → •S]}). The number of items in the set GOTO (I 0 , 〈 ) is: ________.

Options

A : 3

B : 5

C : 4

D : 2

54. Consider the following matrix:

Options

A : 13

B : 15

C : 12

D : 6

55. 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 __________× 10 6 bytes/sec.

Options

A : 160

B : 128

C : 256

D : 320

56. 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) ___________.

Options

A : 4.25

B : 4.50

C : 4.85

D : 5.71

57. Suppose Y is distributed uniformly in the open interval (1, 6). The probability that the polynomial 3x 2 + 6xy + 3Y + 6 has only real roots is (rounded off to 1 decimal place) ________.

Options

A : 0.8

B : 0.4

C : 0.2

D : 0.6

58. Let Σ be the set of all bijections from {1,…,5} to {1,…,5}, where 𝑖𝑑 denotes the identity function, i.e. id(j) =j,∀j. Let ∘ denote composition on functions. For a string 𝑥 = 𝑥 1 𝑥 2 ⋯ 𝑥 n ∈ Σsup>1, 𝑛 ≥ 0, let (𝑥) = 𝑥 1 ∘ 𝑥 2 ∘ ⋯ ∘ 𝑥 n . Consider the language 𝐿 = {𝑥 ∈ Σ∗| (𝑥) = 𝑖𝑑}. The minimum number of states in any DFA accepting L is _________.

Options

A : 120

B : 125

C : 210

D : 125

59. Consider that 15 machines need to be connected in a LAN using 8-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is__________.

Options

A : 3

B : 2

C : 4

D : 5

60. What is the minimum number of 2-input NOR gates required to implement a 4-variable function expressed in sum-of-minterms form as f = Σ (0, 2, 5, 7, 8, 10, 13, 15)? Assume that all the inputs and their complements are available.

Options

A : 3

B : 4

C : 5

D : 6

Gate Computer Science - Previous Year Solved Papers more Online Exam Quiz

Copyright © 2021
Exam-GK-MCQ-Questions.Com | Contact Us | Privacy Policy | Terms of Use | Sitemap | 0.021141052246094