CS and IT GATE 2015 Set-2 Questions with Answer

1 2 3 4 5

Ques 53 Software Engineering

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

User interface issues

Non-functional requirements

Design specification

Interfaces with third party software

Ques 54 Software Engineering

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

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

Code inspection and code walkthrough are synonyms.

Adherence to coding standards is checked during code inspection.

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

Ques 55 Theory of Computation

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?

Only II

Only III

Only I and II

Only I and III

Ques 56 Theory of Computation

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

Ques 57 Theory of Computation

Which of the following languages is/are regular?
L₁ = {wxw^R | w, x ∈ {a, b}* and |w|, |x| > 0}, w^R is the reverse of string w.
L₂ = {aⁿb^m | m ≠ n and m, n ≥ 0}
L₃ = {a^pb^qc^r | p, q, r ≥ 0}

L₁ and L₃ only

L₂ only

L₂ and L₃ only

L₃ only

Ques 58 Theory of Computation

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

10(0* + (10)*)1

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

1(0 + 10)*1

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

Ques 59 Theory of Computation

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

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

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

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

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

1 2 3 4 5

Total Unique Visitors

Loading......

CS/IT Gate Yearwise

CS and IT GATE 2015 Set-2 Questions with Answer