Exam-GK-MCQ-Questions.Com

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.

Options

A : break down

B : break

C : breaks down

D : breaks

Options

A : revolves

B : plays

C : sinks

D : bursts

Options

A : 1

B : 2

C : 3

D : 6

Options

A : 666

B : 3000

C : 6000

D : 12000

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

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

Options

A : 2

B : 3

C : 1

D : 4

Options

A : 4

B : 2

C : 1

D : 0.50

Options

A : 3

B : 5

C : 4

D : 2

Options

A : 13

B : 15

C : 12

D : 6

Options

A : 160

B : 128

C : 256

D : 320

Options

A : 4.25

B : 4.50

C : 4.85

D : 5.71

Options

A : 0.8

B : 0.4

C : 0.2

D : 0.6

Options

A : 120

B : 125

C : 210

D : 125

Options

A : 3

B : 2

C : 4

D : 5

Options

A : 3

B : 4

C : 5

D : 6