CS/IT Gate Yearwise 


CS and IT Gate 2016 Set-1 Questions with Answer

Ques 1 Gate 2016 Set-1

In a process, the number of cycles to failure decreases exponentially with an increase in load. At a load of 80 units, it takes 100 cycles for failure. When the load is halved, it takes 10000 cycles for failure. The load for which the failure will happen in 5000 cycles is ________.

A

40.00

B

46.02

C

60.01

D

92.02


(Aptitude) is the correct answer.

Ques 2 Gate 2016 Set-1

Consider the following statements relating to the level of poker play of four players P, Q, R, and S.

I P always beats Q
II. R always beats S
III. S loses to P only sometimes
IV. R always loses to Q

Which of the following can be logically inferred from the above statements?

(i) P is likely to beat all the three other players
(ii) S is the absolute worst player in the set

A

(i) only

B

(ii) only

C

(i) and (ii)

D

neither (i) nor (ii)


(Reasoning) is the correct answer.

Ques 3 Gate 2016 Set-1

Indian currency notes show the denomination indicated in at least seventeen languages. If this is not an indication of the nation’s diversity, nothing else is. Which of the following can be logically inferred from the above sentences?

A

India is a country of exactly seventeen languages.

B

Linguistic pluralism is the only indicator of a nation’s diversity.

C

Indian currency notes have sufficient space for all the Indian languages.

D

Linguistic pluralism is strong evidence of India’s diversity.


(English Grammar) is the correct answer.

Ques 4 Gate 2016 Set-1

A cube is built using 64 cubic blocks of side one unit. After it is built, one cubic block is removed from every corner of the cube. The resulting surface area of the body (in square units) after the removal is __________.

A

56

B

64

C

72

D

96


(Aptitude) is the correct answer.

Ques 5 Gate 2016 Set-1

If ‘relftaga’ means carefree, ‘otaga’ means careful and ‘fertaga’ means careless, which of the following could mean ‘aftercare’?

A

zentaga

B

tagafer

C

tagazen

D

relffer


(English Grammar) is the correct answer.

Ques 6 Gate 2016 Set-1

Archimedes said, “Give me a lever long enough and a fulcrum on which to place it, and I will move the world.” The sentence above is an example of a ___________ statement.

A

figurative

B

collateral

C

literal

D

figurine


(English Grammar) is the correct answer.

Ques 7 Gate 2016 Set-1

A rewording of something written or spoken is a ______________.

A

paraphrase

B

paradox

C

paradigm

D

paraffin


(English Grammar) is the correct answer.

Ques 8 Gate 2016 Set-1

Out of the following four sentences, select the most suitable sentence with respect to grammar and usage.

A

I will not leave the place until the minister does not meet me.

B

I will not leave the place until the minister doesn’t meet me.

C

I will not leave the place until the minister meet me.

D

I will not leave the place until the minister meets me.


(English Grammar) is the correct answer.

Ques 9 Gate 2016 Set-1

Let X be a recursive language and Y be a recursively enumerable but not recursive language. Let W and Z be two languages such that Y reduces to W, and Z reduces to X (reduction means the standard many-one reduction). Which one of the following statements is TRUE?

A

W can be recursively enumerable and Z is recursive.

B

W an be recursive and Z is recursively enumerable.

C

W is not recursively enumerable and Z is recursive.

D

W is not recursively enumerable and Z is not recursive


(Recursive Language) is the correct answer.

Ques 10 Gate 2016 Set-1

Consider the following context-free grammars:

G1: S → aS|B, B → b|bB
G2: S → aA|bB, A → aA|B|ε, B → bB|ε

Which one of the following pairs of languages is generated by G1 and G2, respectively?

A

{ambn |m > 0 or n > 0} and {ambn |m > 0 and n > 0}

B

{ambn |m > 0 and n > 0} and {ambn |m > 0 or n ≥ 0}

C

{ambn |m ≥ 0 or n > 0} and {ambn |m > 0 and n > 0}

D

{ambn |m ≥ 0 and n > 0} and {a mbn |m > 0 or n > 0}


(CGF) is the correct answer.

Ques 11 Gate 2016 Set-1

Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive 0s and two consecutive 1s?

A

(0+1)*0011(0+1)* + (0+1)*1100(0+1)*

B

(0+1)* (00(0+1) *11+11(0+1)*00)(0+1)*

C

(0+1)*00(0+1) *+ (0+1) *11(0+1) *

D

00(0+1) *11+11(0+1)*00


(Regular Language) is the correct answer.

Ques 12 Gate 2016 Set-1

Which of the following decision problems are undecidable?

I. Given NFAs N1 and N2, is L(N1)∩L(N2) = Φ?
II. Given a CFG G = (N,Σ,P,S) and a string x ∈ Σ*, does x ∈ L(G)?
III. Given CFGs G1 and G2, is L(G1) = L(G2)?
IV. Given a TM M, is L(M) = Φ?

A

I and IV only

B

II and III only

C

III and IV only

D

II and IV only


(decidablility) is the correct answer.

Ques 13 Gate 2016 Set-1

Which of the following languages is generated by the given grammar?

S → aS|bS| ε

A

{anbm | m,n >= 0}

B

{w∈{a,b}* | w has equal number of a's and b's}

C

{an | n>=0} U {anbn | n>=0}

D

{a,b}*


(Grammar) is the correct answer.

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: