📚

GATE CS - Previous Year Questions

Previous-year GATE CS prompts for practice — options only until official keys are verified

142 questions15 pages~213 min

Practice with previous-year prompts and options. Official answer keys are not shown here yet — mark your choice, then verify against the IIT key PDF.

Use this track for exam reading speed and elimination practice until verified keys are linked.

Progress: 0 / 1420%

Page 15 of 15 • Questions 141-142 of 142

Practice mode: questions and options only. Official IIT answer keys are not linked here yet — mark your choice, then cross-check the official key yourself.

Q141medium

[GATE CS 2024 Set-2 Q41] Let 𝑀 be the 5-state NFA with 𝜖-transitions shown in the diagram below. Which one of the following regular expressions represents the language accepted by 𝑀 ?

A)⁡(00)∗⁡+ ⁡1(11)∗

B)⁡0∗ + (1 + 0(00)∗)(11)∗⁡

C)⁡(00)∗ + (1 + (00)∗)(11)∗⁡

D)⁡0+ + 1(11)∗ + 0(11)∗⁡ Page 28 of 40 Organizing Institute: IISc, Bengaluru Computer Science and Information Technology Set 2 (CS2) Consider an array X that contains n positive integers. A subarray of X is defined to

Q142medium

[GATE CS 2024 Set-2 Q42] Consider an array X that contains n positive integers. A subarray of X is defined to be a sequence of array locations with consecutive indices. The C code snippet given below has been written to compute the length of the longest subarray of X that contains at most two distinct integers. The code has two missing expressions labelled (P) and (Q). int first=0, second=0, len1=0, len2=0, maxlen=0; for (int i=0; i < n; i++) { if (X[i] == first) { len2++; len1++; } else if (X[i] == second) { len2++; len1 = (P); second = first; } else { len2 = (Q); len1 = 1; second = first; } if (len2 > maxlen) { maxlen = len2; } first = X[i]; } Which of the following options correctly fills (P) and (Q)?

A)(P): len1 + 1, (Q): len1 + 1

B)(P): len1, (Q): len2 + 1

C)(P): len1 + 1, (Q): len2

D)(P): len2, (Q): len1 + 1

1...14 15