GATE CSE

Graduate Aptitude Test in Engineering - Computer Science

IN

GATE CSE tests understanding of undergraduate computer science and engineering subjects. Used for M.Tech admissions and PSU recruitment.

3h 0m

Duration

5

Sections

0-100

Score Range

1

Countries

Exam Sections

General Aptitude

Verbal ability, numerical ability, and reasoning.

10

Questions

20m

Duration

Engineering Mathematics

Discrete math, linear algebra, probability, and calculus.

13

Questions

30m

Duration

Core CS

Data structures, algorithms, OS, DBMS, networks, and more.

25

Questions

65m

Duration

Programming & DS

C programming, recursion, linked lists, trees, graphs.

10

Questions

35m

Duration

Theory of Computation

Automata, regular languages, context-free grammars, Turing machines.

7

Questions

30m

Duration

Topics Covered

Data StructuresAlgorithmsOperating SystemsDBMSComputer NetworksCompiler DesignTheory of ComputationDigital LogicDiscrete MathematicsLinear AlgebraProbabilityC Programming

Sample Question

What is the time complexity of binary search on a sorted array of n elements?

AO(n)
BO(log n)
CO(n log n)
DO(1)
Why you got it wrong

O(n) is linear search. Binary search halves the search space each step, giving O(log n).

Ready to prepare for GATE CSE?

Practice with AI-powered wrong answer analysis and predict your score.

Start Practicing Now