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

GATE Solved Paper 2017-19 - GATE 2017 Shift 2 Online Exam Quiz

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

1. There are 3 red socks, 4 green socks and 3 blue socks.You choose 2 socks. The probability that they are of the same colour is.

Options

A : 1/5

B : 7/30

C : 1/4

D : 4/15

2. Choose the option with words that are not synonyms.

Options

A : aversion, dislike

B : luminous, radiant

C : plunder, loot

D : yielding, resistant

3. There are five buildings called V, W, X, Y and Z in a row (not necessarily in that order). V is to the west of W. Z is to the East of X and the West of V. W is to the West of Y. Which is the building in the middle?

Options

A : V

B : W

C : X

D : Y

4. A test has twenty questions worth 100 marks in total. There are two types of questions, multiple choice questions are worth 3 marks each and essay questions are worth 11 marks each. How many multiple choice questions does the exam have?

Options

A : 12

B : 15

C : 18

D : 19

5. Saturn is ____ to be seen on a clear night with the naked eye.

Options

A : enough bright

B : bright enough

C : as enough bright

D : bright as enough

46. Consider the recurrence function

Options

A : θ(log logn)

B : θ(logn)

C : θ(√n)

D : θ(n)

47. If a random variable X has a Poisson distribution with mean 5, then the expectation E[(X + 2) 2 ] equals _____

Options

A : 54

B : 45

C : 55

D : 58

48. Consider the following C function

Options

A : θ(n√n)

B : θ(n 2 )

C : θ(n log n)

D : θ(n 2 log n)

49. The pre-order transversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post-order traversal of this tree is:

Options

A : 2,6,7,8,9,10,12,15,16,17,19,20

B : 2,7,6,10,9,8,15,17,20,19,16,12

C : 7,2,6,8,9,10,20,17,19,15,16,12

D : 7,6,2,10,9,8,15,16,17,20,19,12

50. Consider the C program fragment below which is meant to divide x by y using repeated subtractions. The variables x, y, q and r are all unsigned int. (while (r >= y) { r = r – y; q = q +1; }) Which of the following conditions on the variables x, y, q and r before the execution of the fragment will ensure that the loop terminates in a state satisfying the condition x == (y * q + r)?

Options

A : (q = = r) && (r = =0)

B : (x > 0) && (r = =x) && (y > 0)

C : (q = = 0) && (r = = x) && (y > 0)

D : (q = = 0) && (y > 0)

51. A message is made up entirely of characters from the set X= {P, Q, R, S, T}. The table of probabilities for each of the characters is shown below:

Options

A : 225

B : 226

C : 227

D : 228

52. The next state table of a 2-bit saturating up-counter is given below.

Options

A : T 1 = Q 1 Q 0 ,   T 0 = Q 1 Q 0 ,

B : T 1 = Q Q 0 ,   T 0 = Q 1 + Q 0 ,

C : T 1 = Q 1 + Q 0 ,  T 0 = Q 1 + Q 0 ,

D : T 1 = Q 1 Q 0 ,   T 0 = Q 1 + Q 0 ,

53. Consider the set of processes with arrival time (in milliseconds). CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time.

Options

A : 29

B : 28

C : 30

D : 27

54. For any discrete random variable X, with probability mass function

Options

A : Nβ(1 - β)

B : Nβ

C : N(1 - β)

D : Not expressible in terms of N and β alone

55. If the ordinary generating function of a sequence

Options

A : 15

B : 16

C : 16

D : 18

56. Consider the following snippet of a C program. Assume that swap (&x, &y) exchanges the contents of x and y.

Options

A : 3

B : 4

C : 5

D : 6

57. Consider the following C program.

Options

A : 0

B : 1

C : 2

D : 3

58. Consider the following database table named top_scorer.

Options

A : 6

B : 8

C : 7

D : 9

59. Given f(w, x, y, z) = Σ m (0,1,2,3,7,8,10) + Σ d (5,6,11,15), where d represents the don’t-care condition in Karnaugh maps. Which of the following is a minimum product-of-sums(POS) form of f(w,x,y,z)?

Options

A : f = ( w + z )( x + z )

B : f = ( w + z ) ( x + z )

C : f = ( w + z ) ( x + z )

D : f = ( w + z ) ( x + z )

60. In a B+ tree, if the search key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then maximum order of the B+ tree is _____.

Options

A : 52

B : 53

C : 54

D : 54

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.02013897895813