CS and IT Gate 2017 Set-2 Questions with Answer

Ques 1 Gate 2017 Set-2

In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed?

I. Contiguous
II. Linked
III. Indexed

I and III only

II only

III only

II and III only

(Aptitude) is the correct answer.

Ques 2 Gate 2017 Set-2

Let p, q, r denote the statement "It is raining", "It is cold", and "It is pleasant", respectively. Then the statement "It is not raining and it is pleasant, and it is not pleasant only if it is raining and it is cold" is represented by:

(¬ p ∧ r) ∧ ((¬ r → (p ∧ q))

(¬ p ∧ r) ∧ ((p ∧ q) → ¬ r)

(¬ p ∧ r) ∨ ((p ∧ q) → ¬ r)

(¬ p ∧ r) ∨ ((r → (p ∧ q))

(Aptitude) is the correct answer.

Ques 3 Gate 2017 Set-2

"We lived in culture and denied any merit to literally works, Considering them important only when they were handmaidens to something seemingly more urgent - namely ideology. This was a country where all gestures even the most private , interpreted as political terms." The author^^s believes that ideology is not as important as literature is revealed by the word

culture

seemingly

urgent

political

(Aptitude) is the correct answer.

Ques 4 Gate 2017 Set-2

X is 30 digit number starting with 4 followed 7. Then number X³ will have

90 digits

91 digits

92 digits

93 digits

(A) is the correct answer.

The number of digits in a number. If a number N has d digits, then:
10^d-1 ≤ N < 10^d

For finding digits in X³, I can use logarithms. The number of digits in X³ is:
Number of digits = floor(log₁₀(X³)) + 1
Number of digits = floor(3 × log₁₀(X)) + 1

Since X is a 30-digit number starting with 47, I can estimate its range:
• Minimum value: X ≥ 47 × 10²⁸ (smallest 30-digit number starting with 47)
• Maximum value: X < 48 × 10²⁸ (before it becomes 48...)

The minimum case:
X = 47 × 10²⁸
log₁₀(X) = log₁₀(47) + 28
log₁₀(47) ≈ 1.672 (since log₁₀(47) is between log₁₀(10) = 1 and log₁₀(100) = 2)

So, log₁₀(X) ≈ 1.672 + 28 = 29.672

Therefore:
Number of digits in X³ = floor(3 × 29.672) + 1
= floor(89.016) + 1
= 89 + 1
= 90

Verifying with the maximum case:
X < 48 × 10²⁸
log₁₀(48) ≈ 1.681
log₁₀(X) < 1.681 + 28 = 29.681
Number of digits = floor(3 × 29.681) + 1 = floor(89.043) + 1 = 89 + 1 = 90

Both cases give me 90 digits.

Ques 5 Gate 2017 Set-2

There are three boxes, one contains apples, another contains oranges and last one contains both apples and oranges. All three are known to be incorrectly labelled. You are permitted to open just one box and then pull out and inspect only one fruit. Which box would you open to determine the contents of all three boxes?

The box labelled apples

The box labelled both apples and oranges

The box labelled oranges

can't be determined

(Aptitude) is the correct answer.

Ques 6 Gate 2017 Set-2

The numbers of the roots of e^x + 0.5x² -2 = 0 in the range [-5, 5] are

(Aptitude) is the correct answer.

Ques 7 Gate 2017 Set-2

Choose the option with words that are not synonyms.

aversion, dislike

luminous, radiant

plunder, loot

yielding, resistant

(Aptitude) is the correct answer.

Ques 8 Gate 2017 Set-2

There are 3 red socks, 5 green socks and 3 blue socks. You choose 2 socks. The probability that they are of the same color is

¹/₅

⁷/₃₀

¹/₄

¹⁶/₅₅

(Aptitude) is the correct answer.

Ques 9 Gate 2017 Set-2

Saturn is __________ to be seen on a clear night with the naked eye?

enough bright

bright enough

as enough bright

bright as enough

(Aptitude) is the correct answer.

Ques 10 Gate 2017 Set-2

There are 5 buildings called V, W, X, Y, Z in a row (not necessarily in order). V is to the West of W, Z is to the East of X and the West of V. W is to West of Y. Which building is in the middle?

(Aptitude) is the correct answer.

Ques 11 Gate 2017 Set-2

A test has questions worth 100 marks totals. There are two types of questions, multiple choice questions are worth 3 marks each and essay questions are worth 11 marks each. How many multiple choice questions does the exam have?

(Aptitude) is the correct answer.

Ques 12 Gate 2017 Set-2

The minimum possible number of states of a deterministic finite automaton that accepts a regular language L = {w₁aw₂ | w₁, w₂ ∈{a,b}* , |w₁| = 2, w₂>=3} is_______

(a) is the correct answer.

Ques 13 Gate 2017 Set-2

Identity the language generated by following grammar where S is the start variable.

S --> XY
X --> aX | a
Y --> aYb | ∈

{a^m bⁿ| m>=n, n>0 }

{a^m bⁿ| m>=n, n>=0 }

{a^m bⁿ | m>n, n>=0 }

{a^m bⁿ| m>n, n>0 }

(Grammar) is the correct answer.

1 2 3 4 5

Total Unique Visitors

Loading......

CS/IT Gate Yearwise

CS and IT Gate 2017 Set-2 Questions with Answer

Question Options

Sign in to ExamPrev