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

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

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

1. Research in the workplace reveals that people work for many reason _____.

Options

A : money beside

B : beside money

C : money besides

D : besides money

2. After Rajendra chola returned from his voyage to Indonesia, he ____ to visit the temple in Thanjavur.

Options

A : was wishing

B : is wishing

C : wished

D : had wished

3. Rahul Murali, Srinivas and Arul are seated around a square table. Rahul is sitting to the left of Murali. Srinivas is sitting to the right of Arul. Which of the following pairs are seated opposite each other?

Options

A : Rahul and Murali

B : Srinivas and Arul

C : Srinivas and Murali

D : Srinivas and Rahul

4. Find the number in the following such that it is a perfect cube of some number.

Options

A : 24

B : 27

C : 32

D : 36

5. The probability that a k-digit number does NOT contain the digits 0,5, or 9 is-

Options

A : 0.5 k

B : 0.6 k

C : 0.7 k

D : 0.9 k

46. Consider the following two functions. void fun1 (int n) { if (n == 0 ) return; printf (“%d” , n); fun2 (n - 2); printf (“%d” , n); } void fun2 (int n) { if (n = = 0) return ; printf (“%d” , n); fun1(++n) ; printf (“%d” , n); } The output printed when fun1(5) is called is

Options

A : 53423122233445

B : 53423120112233

C : 53423122132435

D : 53423120213243

47. Let A be real valued square symmetric matrix of rank 2 with

Options

A : Both (I) and (II)

B : (I) only

C : (II) only

D : Neither (I) nor (II)

48. Consider the context-free grammars over the alphabet {a,b,c} given below. S and T are non-terminals G 1 : S → aSb|T,T → cT|∈ G 2 : S → bSa|T,T → cT|∈ The language L(G 1 )∩L(G 2 ) is

Options

A : Finite

B : Not finite but regular

C : Context-free but not regular

D : Recursive but not context-free

49. Let X be a Gaussian random variable mean 0 and variance σ 2 . Let Y = max(X, 0) where max (a, b) is the maximum of a and b. The median of Y is _____.

Options

A : 0

B : 1

C : 2

D : 3

50. Consider the Karnaugh map given below, where x represents “don’t care” and blank represents 0.

Options

A : 0

B : 1

C : 2

D : 3

51. Consider the language L given by the regular expression (a+b)*b(a+b) over the alphabet {a, b}. The smallest number of states needed in a deterministic finite-state automation (DFA) accepting L is ______.

Options

A : 4

B : 3

C : 5

D : 6

52. Consider a two-level cache hierarchy with L1 and L2 caches. An application incurs 1.4 memory accesses per instruction on average. For this application, the miss rate of L1 cache 0.1, the L2 cache experiences, on average, 7 misses per 1000 instructions. The miss rate of L2 expressed correct to two decimal places is _____.

Options

A : 0.05

B : 0.25

C : 0.50

D : 0.02

53. Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below:

Options

A : 1

B : 2

C : 3

D : 4

54. Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below.

Options

A : 2.6

B : 2.3

C : 3.2

D : 3.6

55. Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.

Options

A : 10

B : 9

C : 18

D : 20

56. The number of integers between 1 and 500 (both inclusive) that are divisible by 3 or 5 or 7 is ______.

Options

A : 271

B : 337

C : 267

D : 270

57. Consider a RISC machine where each instruction is exactly 4 bytes long. Conditional and unconditional branch instructions use PC- relative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is always with respect to the address of the next instruction in the program sequence. Consider the following instruction sequence.

Options

A : -15

B : -16

C : -18

D : -12

58. In a RSA cryptosystem a participant A uses two prime numbers p = 13 and q = 17 to generate her public and private keys. If the public key of A is 35. Then the private key of A is ______.

Options

A : 13

B : 16

C : 11

D : 17

59. Let A be an array of 31 numbers consisting of sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i that A[i] is 1 by probing the minimum numbers of locations in A. The worst case number of probes performed by an optimal algorithm is _____.

Options

A : 2

B : 3

C : 4

D : 5

60. Instructions execution in a processor is divided into 5 stages. Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Execute (EX), and Write Back (WB), These stages take 5,4,20, 10 and 3 nanoseconds (ns) respectively. A pipelined implementation of the processor requires buffering between each pair of consecutive stages with a delay of 2ns. Two pipelined implementations of the processor are contemplated. (i) a naïve pipeline implementation (NP) with 5 stages and (ii) an efficient pipeline (EP) where the OF stage id divided into stages OF1 and OF2 with execution times of 12 ns and 8 ns respectively. The speedup (correct to two decimals places) achieved by EP over NP in executing 20 independent instructions with no hazards is _____.

Options

A : 1.508

B : 1.580

C : 1.608

D : 1.680

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