CS/IT Gate Yearwise 


CS and IT Gate 2015 Set-2 Questions with Answer

Ques 53 Gate 2015 Set-2

A Software Requirements Specification (SRS) document should avoid discussing which one of the following?

A

User interface issues

B

Non-functional requirements

C

Design specification

D

Interfaces with third party software


(SRS) is the correct answer.

Ques 54 GATE 2015 SET-2

Which one of the following assertions concerning code inspection and code walkthrough is true?

A

Code inspection is carried out once the code has been unit tested.

B

Code inspection and code walkthrough are synonyms.

C

Adherence to coding standards is checked during code inspection.

D

Code walkthrough is usually carried out by an independent test team.


(c) is the correct answer.

Ques 55 GATE 2015 SET-2

Consider the following statements.
I. The complement of every Turing decidable language is Turing decidable.
II. There exists some language which is in NP but is not Turing decidable.
III. If L is a language in NP, L is Turing decidable.
Which of the above statements is/are true?

A

Only II

B

Only III

C

Only I and II

D

Only I and III


(d) is the correct answer.

Ques 56 GATE 2015 SET-2

The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)*(10) is _______.


(3) is the correct answer.

Ques 57 GATE 2015 SET-2

Which of the following languages is/are regular?
L1 = {wxwR | w, x ∈ {a, b}* and |w|, |x| > 0}, wR is the reverse of string w.
L2 = {anbm | m ≠ n and m, n ≥ 0}
L3 = {apbqcr | p, q, r ≥ 0}

A

L1 and L3 only

B

L2 only

C

L2 and L3 only

D

L3 only


(d) is the correct answer.

Ques 58 GATE 2015 SET-2

Consider the alphabet Σ = {0, 1}, the null/empty string λ and the sets of strings X0, X1, and X2 generated by the corresponding non-terminals of a regular grammar. X0, X1, and X2 are related as follows.
X0 = 1X1
X1 = 0X1 + 1X2
X2 = 0X1 + {λ}
Which one of the following choices precisely represents the strings in X0?

A

10(0* + (10)*)1

B

10(0* + (10)*)*1

C

1(0 + 10)*1

D

10(0 + 10)*1 + 110(0 + 10)*1


(b) is the correct answer.

Ques 59 GATE 2015 SET-2

Which one of the following well-formed formulae is a tautology?

A

∀x∃y R(x, y) ↔ ∃y∀x R(x, y)

B

(∀x[∃y R(x, y) → S(x, y)]) → ∀x∃y S(x, y)

C

[∀x∃y(P(x, y) → R(x, y))] ↔ [∀x∃y(¬P(x, y) ∨ R(x, y))]

D

∀x∀y P(x, y) → ∀x∀y P(y, x)


(c) is the correct answer.

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: