CS and IT Gate 2017 Set-1 Questions with Answer

Ques 1 Gate 2017 Set-1


Research in the workplace reveals that people work for many reasons _________.

A

money beside

B

beside money

C

money besides

D

besides money


(d) is the correct answer.

Ques 2 Gate 2017 Set-1


Find the smallest number y such that y*162 is a perfect cube.

A

24

B

27

C

32

D

36


(d) is the correct answer.

Ques 3 Gate 2017 Set-1


Arun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured red, pink, blue and white respectively. Arun dislikes the colour red and Shweta dislikes the colour white. Gulab and Neel like all the colours. In how many different ways can they choose the shirts so that no one has a shirt with a colour he or she dislikes?

A

21

B

18

C

16

D

14


(d) is the correct answer.

Ques 4 Gate 2017 Set-1


The expression [ (x + y) - |x - y| ] / 2 is equal to___

A

1

B

the minimum of x and y

C

the maximum of x and y

D

none of the above


(Mathematics) is the correct answer.

Ques 5 Gate 2017 Set-1


"The hold of the nationalist imagination on our colonial past is such that
anything inadequately or improperly natinalist is just not history"


Which of the following statements best reflects the author's opinion?

A

Nationalists are highly imaginative.

B

Nationalists are highly imaginative.

C

Our colonial past never happened.

D

Our colonial past never happened.


(English Grammar) is the correct answer.

Ques 6 Gate 2017 Set-1


Six people are seated around a circular table. There are at least two men and two women. There are at least three right-handed persons. Every woman has a left-handed person to her immediate right. None of the women are right-handed. The number of women at the table is

A

2

B

3

C

4

D

Can not be determined


(a) is the correct answer.

Ques 7 Gate 2017 Set-1


After Rajendra Chola returned from his voyage to Indonesia, he ______ to visit the temple in Tanjavur.

A

was wishing

B

is wishing

C

wished

D

had wished


(c) is the correct answer.

Ques 8 Gate 2017 Set-1


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

A

0.3k

B

0.6k

C

0.7k

D

0.9k


(c) is the correct answer.

Ques 9 Gate 2017 Set-1


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 ?

A

Rahul and Murali

B

Srinivas and Arul

C

Srinivas and Murali

D

Srinivas and Rahul


(d) is the correct answer.

Ques 10 Gate 2017 Set-1


Consider the following grammar:

stmt -> if expr then else expr; stmt | ε
expr -> term relop term | term
term -> id | number
id -> a | b | c
number -> [0-9]


where relop is a relational operate (e.g < >, ….), ε refers to the empty statement, and if ,then, else are terminals. Consider a program P following the above grammar containing ten if terminals. The number of control flows paths in P is ____________. For example, the program

if e1 then
    e2
else
    e3

has 2 control flow paths, e1 -> e2 and e1 -> e3


(a) is the correct answer.

Ques 11 Gate 2017 Set-1


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 automaton (DFA) accepting L is ______.


(4) is the correct answer.

Ques 12 Gate 2017 Set-1


Let A and B be infinite alphabets and let # be a symbol outside both A and B. Let f be a total functional from A* to B* .We say f is computable if there exists a Turning machine M which given an input x in A*, always halts with f(x) on its tape. Let Lf denotes the language {x#f(x)|x∈A*}. Which of the following statements is true?

A

f if computable if and only if Lf is recursive.

B

f if computable if and only if Lf is recursive enumerable.

C

if f is computable then Lf is recursive, but not conversely.

D

if f is computable then Lf is recursively enumerable, but not conversely.


(a) is the correct answer.

Ques 13 Gate 2017 Set-1


Consider the following languages over the alphabet ∑= {a,b,c}.
Let L1 ={anbncm | m, n >= 0 } and
L2 = {ambncn| m, n >= 0}.

Which of the following are context-free languages ?
I. L1 ∪ L2
II. L1 ∩ L2

A

I only

B

II only

C

I and II

D

Neither I nor II


(a) is the correct answer.

Unique Visitor Count

Total Unique Visitors

Loading......