CS/IT Gate Yearwise
CS/IT Gate 2025 (Set 2)
CS/IT Gate 2024 (Set 1)
CS/IT Gate 2024 (Set 2)
CS/IT Gate 2023
CS/IT Gate 2022
CS/IT Gate 2021 (Set 1)
CS/IT Gate 2021 (Set 2)
CS/IT Gate 2020
CS/IT Gate 2019
CS/IT Gate 2018
CS/IT Gate 2017 (Set 1)
CS/IT Gate 2017 (Set 2)
CS/IT Gate 2016 (Set 1)
CS/IT Gate 2016 (Set 2)
CS/IT Gate 2015 (Set 1)
CS/IT Gate 2015 (Set 2)
CS/IT Gate 2015 (Set 3)
CS/IT Gate 2014 (Set 1)
CS/IT Gate 2014 (Set 2)
CS/IT Gate 2014 (Set 3)
CS and IT GATE 2021 SET-2 Questions with Answer
Ques 40 Programming and Data Structures
Consider the following ANSI C program:
int main() {
Integer x;
return 0;
}
Which one of the following phases in a seven-phase C compiler will throw an error?
Ques 41 Programming and Data Structures
Consider the following ANSI C program.

Ques 42 Programming and Data Structures
Consider the following ANSI C function:

15 to 15 is the correct answer.
Ques 43 Programming and Data Structures
Consider the following ANSI C code segment:

Ques 44 Programming and Data Structures
Consider the following ANSI C program.

60 to 60 is the correct answer.
Ques 45 Reasoning

Ques 46 Reasoning
Listening to music during exercise improves exercise performance and reduces discomfort. Scientists researched whether listening to music while studying can help students learn better and the results were inconclusive. Students who needed external stimulation for studying fared worse while students who did not need any external stimulation benefited from music.
Which one of the following statements is the CORRECT inference of the above passage?
Ques 47 Reasoning

Ques 48 Reasoning
Six students P, Q, R, S, T and U, with distinct heights, compare their heights and make the following observations.
Observation I: S is taller than R.
Observation II: Q is the shortest of all.
Observation III: U is taller than only one student.
Observation IV: T is taller than S but is not the tallest.
The number of students that are taller than R is the same as the number of students shorter than _______
Ques 49 Theory of Computation
Let L ⊆ {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states?
Ques 50 Theory of Computation
Let L1 be a regular language and L2 be a context-free language. Which of the following languages is/are context-free?
Ques 51 Theory of Computation
Choose the correct choice(s) regarding the following propositional logic assertion S:
S: ((P ∧ Q) → R) → ((P ∧ Q) → (Q → R))
Ques 52 Theory of Computation
Consider the following deterministic finite automaton (DFA).

256 to 256 is the correct answer.

Total Unique Visitors