PlacementPrep

Gate Cse Papers 2026

23 min read
Government Exams
Advertisement Placement

GATE CSE 2026: Complete Exam Guide with Practice Papers

Ultimate preparation resource for Graduate Aptitude Test in Engineering - Computer Science & Engineering

📋 Exam Overview

AttributeDetails
Exam NameGATE 2026 - Computer Science & Engineering (CS)
Conducting BodyIIT (Indian Institute of Technology) - Organizing Institute
Exam LevelAll India Level
Exam ModeComputer Based Test (CBT)
FrequencyOnce a year
Official Websitegate2026.iitb.ac.in (tentative)
Exam Duration3 hours (180 minutes)
Total Marks100 marks

Eligibility Criteria

Educational Qualification (Any one):

  • Bachelor's degree in Engineering/Technology (4 years after 10+2)
  • Master's degree in any relevant science subject
  • Currently in final year of qualifying degree
  • Candidates with degrees from professional societies recognized by UPSC/AICTE

Age Limit:

  • No age limit for GATE

Nationality:

  • Indian citizens
  • Foreign nationals can also apply (subject to conditions)

GATE Score Validity

  • GATE score is valid for 3 years from the date of announcement of results

📝 Exam Pattern

Marking Scheme

SectionQuestionsMarks per QuestionTotal Marks
General Aptitude (GA)101 or 215
Engineering Mathematics10-121 or 213-15
Core Subject (CSE)43-451 or 272
Total65-100

Types of Questions

  1. Multiple Choice Questions (MCQ): 1 or 2 marks each, negative marking applicable
  2. Multiple Select Questions (MSQ): 1 or 2 marks each, NO negative marking
  3. Numerical Answer Type (NAT): 1 or 2 marks each, NO negative marking

Negative Marking

Question TypeMarksWrong Answer Penalty
1-mark MCQ1-1/3 mark
2-mark MCQ2-2/3 mark
MSQ1 or 2No negative marking
NAT1 or 2No negative marking

Section-wise Weightage

SubjectApproximate Weightage
Engineering Mathematics13-15%
Digital Logic5-8%
Computer Organization & Architecture8-10%
Programming & Data Structures12-15%
Algorithms10-12%
Theory of Computation8-10%
Compiler Design5-8%
Operating Systems10-12%
Databases8-10%
Computer Networks8-10%
General Aptitude15%

📚 Complete Syllabus

1. Engineering Mathematics

Discrete Mathematics:

  • Propositional and first-order logic
  • Sets, relations, functions, partial orders, and lattices
  • Groups
  • Graphs: connectivity, matching, coloring

Linear Algebra:

  • Matrices
  • Determinants
  • System of linear equations
  • Eigenvalues and eigenvectors
  • LU decomposition

Calculus:

  • Limits, continuity, and differentiability
  • Maxima and minima
  • Mean value theorem
  • Integration

Probability & Statistics:

  • Random variables
  • Uniform, normal, exponential, Poisson, and binomial distributions
  • Mean, median, mode, and standard deviation
  • Conditional probability and Bayes' theorem

2. Digital Logic

  • Boolean algebra
  • Combinational and sequential circuits
  • Minimization of Boolean functions
  • Number representations and computer arithmetic (fixed and floating point)

3. Computer Organization & Architecture

  • Machine instructions and addressing modes
  • ALU, data-path, and control unit
  • Instruction pipelining, pipeline hazards
  • Memory hierarchy: cache, main memory, and secondary storage
  • I/O interface (Interrupt and DMA mode)

4. Programming & Data Structures

Programming in C:

  • Recursion
  • Parameter passing (call by value, call by reference)
  • Scope, binding, and parameter passing

Data Structures:

  • Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs
  • Hashing

5. Algorithms

  • Searching, sorting, hashing
  • Asymptotic worst-case time and space complexity
  • Algorithm design techniques: greedy, dynamic programming, divide-and-conquer
  • Graph traversals, minimum spanning trees, shortest paths

6. Theory of Computation

  • Regular expressions and finite automata
  • Context-free grammars and push-down automata
  • Regular and context-free languages
  • Pumping lemma
  • Turing machines and undecidability

7. Compiler Design

  • Lexical analysis, parsing, syntax-directed translation
  • Runtime environments
  • Intermediate code generation
  • Local optimisation
  • Data flow analyses: constant propagation, liveness analysis, common subexpression elimination

8. Operating Systems

  • System calls, processes, threads
  • Inter-process communication, concurrency, and synchronization
  • Deadlock
  • CPU and I/O scheduling
  • Memory management and virtual memory
  • File systems

9. Databases

  • ER-model
  • Relational model: relational algebra, tuple calculus, SQL
  • Integrity constraints, normal forms
  • File organization, indexing (B and B+ trees)
  • Transactions and concurrency control

10. Computer Networks

  • Concept of layering: OSI and TCP/IP Protocol Stacks
  • Basics of Wi-Fi and Cellular Networks (2G, 3G, 4G)
  • Basics of application layer protocols (DNS, SMTP, POP, FTP, HTTP)
  • Basic concepts of switches, routers, and gateways
  • Basics of public key and private key cryptography
  • Digital signatures and certificates
  • Firewalls

🧮 Engineering Mathematics: 15 Practice Questions with Solutions

Question 1

Find the determinant of the matrix A = [[2, 3], [1, 4]]

Solution: det(A) = (2 × 4) - (3 × 1) = 8 - 3 = 5

Question 2

If A = {1, 2, 3} and B = {2, 3, 4}, find A ∪ B and A ∩ B.

Solution: A ∪ B = {1, 2, 3, 4} A ∩ B = {2, 3}

Question 3

Find the limit: lim(x→0) (sin x)/x

Solution: Using L'Hôpital's rule or standard limit: lim(x→0) (sin x)/x = 1

Question 4

If f(x) = x³ - 3x² + 2, find f'(x) and the critical points.

Solution: f'(x) = 3x² - 6x For critical points: 3x² - 6x = 0 3x(x - 2) = 0 x = 0 or x = 2 Critical points: x = 0, 2

Question 5

A fair die is rolled. What is the probability of getting an even number?

Solution: Sample space = {1, 2, 3, 4, 5, 6} Favorable outcomes = {2, 4, 6} Probability = 3/6 = 1/2

Question 6

Find the eigenvalues of the matrix [[4, 2], [1, 3]].

Solution: Characteristic equation: |A - λI| = 0 |4-λ, 2| |1, 3-λ| = 0 (4-λ)(3-λ) - 2 = 0 12 - 7λ + λ² - 2 = 0 λ² - 7λ + 10 = 0 (λ - 5)(λ - 2) = 0 Eigenvalues: λ = 5, 2

Question 7

How many edges does a complete graph with n vertices have?

Solution: In a complete graph, every vertex is connected to every other vertex. Number of edges = n(n-1)/2

Question 8

Solve the recurrence relation: T(n) = 2T(n/2) + n

Solution: Using Master Theorem: a=2, b=2, f(n)=n n^(log₂2) = n¹ = n f(n) = Θ(n^(log_b a)) Therefore, T(n) = Θ(n log n)

Question 9

Find the number of binary strings of length 5 with no two consecutive 0s.

Solution: Let a(n) = strings ending with 1, b(n) = strings ending with 0 Recurrence: a(n) = a(n-1) + b(n-1), b(n) = a(n-1) F(5) = a(5) + b(5) = 13

Question 10

If X is a random variable with mean μ and variance σ², find E[(X-μ)²].

Solution: E[(X-μ)²] = Var(X) = σ²

Question 11

Find the rank of the matrix [[1, 2, 3], [2, 4, 6], [1, 1, 1]].

Solution: R2 → R2 - 2R1: [[1, 2, 3], [0, 0, 0], [1, 1, 1]] R3 → R3 - R1: [[1, 2, 3], [0, 0, 0], [0, -1, -2]] Number of non-zero rows = 2 Rank = 2

Question 12

Calculate the integral: ∫(2x + 3)dx from 0 to 2

Solution: = [x² + 3x] from 0 to 2 = (4 + 6) - (0 + 0) = 10

Question 13

In how many ways can 5 people be seated around a circular table?

Solution: Number of circular permutations = (n-1)! = (5-1)! = 4! = 24

Question 14

Find the probability of drawing a king or a queen from a standard deck of 52 cards.

Solution: P(King) = 4/52 P(Queen) = 4/52 P(King or Queen) = 4/52 + 4/52 = 8/52 = 2/13

Question 15

If A and B are independent events with P(A) = 0.4 and P(B) = 0.5, find P(A ∩ B).

Solution: For independent events: P(A ∩ B) = P(A) × P(B) = 0.4 × 0.5 = 0.2

🧩 Data Structures & Algorithms: 10 Practice Questions with Solutions

Question 1

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

Solution: Binary search divides the search space in half at each step. Time complexity: O(log n)

Question 2

What is the worst-case time complexity of quicksort?

Solution: Worst case occurs when the pivot is always the smallest or largest element. Time complexity: O(n²)

Question 3

How many nodes are there in a complete binary tree of height h?

Solution: A complete binary tree of height h has 2^(h+1) - 1 nodes (maximum). Minimum nodes = 2^h

Question 4

What is the output of the following code?

void fun(int n) {
    if (n == 0) return;
    printf("%d ", n);
    fun(n-1);
}
fun(3);

Solution: Output: 3 2 1 (Prints n before recursive call)

Question 5

What is the minimum number of edges in a connected graph with n vertices?

Solution: A connected graph must have at least n-1 edges (tree structure).

Question 6

What is the time complexity of finding an element in a hash table with good hash function?

Solution: Average case: O(1) Worst case: O(n) (all elements collide)

Question 7

How many comparisons are needed to find both maximum and minimum in an array of n elements?

Solution: Optimal algorithm requires ⌈3n/2⌉ - 2 comparisons.

Question 8

What is the height of an AVL tree with n nodes?

Solution: Height of AVL tree is always O(log n). More precisely, height ≤ 1.44 log₂(n+2) - 0.328

Question 9

What is the space complexity of DFS on a graph with n vertices and m edges?

Solution: Space complexity: O(n) for recursion stack + O(n) for visited array = O(n)

Question 10

What is the output of the following postfix expression: 2 3 4 + * 5 -

Solution: Step by step:

  • Push 2, 3, 4
  • 4 + 3 = 7, stack: 2, 7
  • 7 * 2 = 14, stack: 14
  • Push 5, stack: 14, 5
  • 14 - 5 = 9

🖥️ Operating Systems & Computer Networks: 10 Questions

Question 1

What is the page size in most operating systems?

Question 2

What is the maximum number of processes that can be in the ready queue at any time?

Question 3

What is the port number for HTTP?

Question 4

What is the difference between TCP and UDP?

  • TCP: Connection-oriented, reliable, ordered delivery, flow control, congestion control
  • UDP: Connectionless, unreliable, no ordering, no flow/congestion control, faster

Question 5

What is thrashing in operating systems?

Question 6

What is the purpose of DNS?

Question 7

What is a deadlock?

Four necessary conditions:

  1. Mutual Exclusion
  2. Hold and Wait
  3. No Preemption
  4. Circular Wait

Question 8

What is the OSI model and how many layers does it have?

  1. Physical Layer
  2. Data Link Layer
  3. Network Layer
  4. Transport Layer
  5. Session Layer
  6. Presentation Layer
  7. Application Layer

Question 9

What is the difference between a process and a thread?

  • Process: Independent execution unit with its own memory space, resources, and PCB
  • Thread: Lightweight execution unit within a process, shares memory space with other threads in the same process

Question 10

What is the subnet mask for a /24 network?

📖 Theory of Computation & Compiler Design: 5 Questions

Question 1

What is the language accepted by the regular expression (a+b)*abb?

Question 2

What is the difference between DFA and NFA?

  • DFA: Deterministic - exactly one transition for each input symbol from each state
  • NFA: Non-deterministic - can have multiple transitions or ε-transitions for an input

Both recognize the same class of languages (regular languages).

Question 3

What is the Halting Problem?

Question 4

What is the difference between LL(1) and LR(1) parsers?

  • LL(1): Left-to-right scan, Leftmost derivation, 1 symbol lookahead (top-down)
  • LR(1): Left-to-right scan, Rightmost derivation, 1 symbol lookahead (bottom-up) LR parsers are more powerful and can handle more grammars.

Question 5

What is lexical analysis?

📊 Previous Year Cutoff Marks (GATE CSE)

GATE 2023, 2024, 2025 Cutoffs

CategoryGATE 2023GATE 2024GATE 2025
General32.530.029.5
OBC (NCL)29.227.026.5
SC/ST/PwD21.620.019.6

Qualifying Marks Out of 100

CategoryMarks
General25-35
OBC22.5-31.5
SC/ST/PwD16.5-23.5

Top IITs/IISc GATE Cutoff for MTech/PhD

InstituteGeneral Category Cutoff (GATE Score)
IIT Bombay750-850
IIT Delhi750-850
IIT Madras750-850
IIT Kharagpur700-800
IIT Kanpur700-800
IIT Roorkee650-750
IIT Guwahati600-700
IISc Bangalore800-900

📅 3-Month Preparation Strategy

Month 1: Foundation & Core Concepts

Week 1-2:

  • Engineering Mathematics (Linear Algebra, Calculus, Probability)
  • Digital Logic
  • Computer Organization & Architecture

Week 3-4:

  • Programming & Data Structures
  • Algorithms (complete theory + basic problems)

Month 2: Core Subjects & Practice

Week 5-6:

  • Theory of Computation
  • Compiler Design
  • Operating Systems

Week 7-8:

  • Databases
  • Computer Networks
  • Previous year questions (subject-wise)

Month 3: Revision, Mock Tests & Final Preparation

Week 9-10:

  • Full-length mock tests (2-3 per week)
  • Formula revision
  • Weak areas improvement

Week 11-12:

  • Last 10 years GATE papers (timed)
  • General Aptitude practice
  • Final revision of all subjects

Daily Study Schedule (8-10 hours)

TimeActivity
2 hoursSubject theory + notes making
2 hoursProblem solving
1 hourPrevious year questions
1 hourGeneral Aptitude
2-3 hoursMock tests (alternate days)

Subject-wise Time Distribution

SubjectRecommended Time
Engineering Mathematics15-20 days
Data Structures & Algorithms20-25 days
Theory of Computation10-12 days
Operating Systems10-12 days
Computer Networks10-12 days
Databases8-10 days
Computer Organization8-10 days
Compiler Design6-8 days
Digital Logic5-7 days
General AptitudeThroughout + last 15 days

📚 Best Books and Online Resources

Engineering Mathematics:

  • "Higher Engineering Mathematics" by B.S. Grewal
  • "Discrete Mathematics and Its Applications" by Kenneth Rosen

Digital Logic:

  • "Digital Logic and Computer Design" by M. Morris Mano
  • "Digital Electronics" by S. Salivahanan

Computer Organization & Architecture:

  • "Computer Organization and Architecture" by Carl Hamacher
  • "Computer Architecture: A Quantitative Approach" by Hennessy & Patterson

Data Structures:

  • "Data Structures and Algorithms Made Easy" by Narasimha Karumanchi
  • "Introduction to Algorithms" (CLRS) by Cormen, Leiserson, Rivest, Stein

Algorithms:

  • "Introduction to Algorithms" (CLRS)
  • "Algorithm Design" by Kleinberg & Tardos

Theory of Computation:

  • "Introduction to the Theory of Computation" by Michael Sipser
  • "Theory of Computation" by Ullman

Compiler Design:

  • "Compilers: Principles, Techniques, and Tools" (Dragon Book) by Aho, Ullman
  • "Compiler Design" by O.G. Kakde

Operating Systems:

  • "Operating System Concepts" (Galvin, Gagne, Silberschatz)
  • "Modern Operating Systems" by Andrew S. Tanenbaum

Databases:

  • "Database System Concepts" by Silberschatz, Korth, Sudarshan
  • "Fundamentals of Database Systems" by Elmasri & Navathe

Computer Networks:

  • "Computer Networks" by Andrew S. Tanenbaum
  • "Data Communications and Networking" by Behrouz Forouzan

General Aptitude:

  • "A Modern Approach to Verbal & Non-Verbal Reasoning" by R.S. Aggarwal
  • "Quantitative Aptitude" by R.S. Aggarwal

Online Resources

Websites:

  • GO Classes (GateOverflow)
  • GeeksforGeeks
  • NPTEL (IIT video lectures)
  • Made Easy/ACE Academy websites

YouTube Channels:

  • Gate Applied Course
  • Knowledge GATE
  • GO Classes
  • Unacademy GATE

Practice Platforms:

  • Gate Overflow
  • GeeksforGeeks
  • HackerRank (for coding practice)
  • LeetCode (for DSA)

Mock Tests:

  • Made Easy Test Series
  • ACE Academy Test Series
  • Gate Academy Test Series

❓ Frequently Asked Questions (FAQs)

Q1: Can final year students apply for GATE 2026?

Q2: How many times can I attempt GATE?

Q3: Is GATE score accepted by foreign universities?

  • Nanyang Technological University (NTU), Singapore
  • National University of Singapore (NUS)
  • Technical University of Munich, Germany
  • RWTH Aachen, Germany

Q4: What is the difference between GATE score and GATE rank?

  • GATE Score: Normalized score out of 1000, calculated based on your performance relative to top scorer
  • GATE Rank: Your position among all candidates who appeared
  • Score is more important as it remains valid for 3 years

Q5: Can I use a calculator during GATE exam?

🎯 Success Tips

  1. Start with Previous Papers: Understand the pattern and difficulty level first
  2. Focus on High-weightage Subjects: DSA, Algorithms, OS, Networks, DBMS
  3. Practice Numerical Problems: Don't just read theory, solve problems daily
  4. Use Virtual Calculator: Practice with the official GATE calculator
  5. Take Mock Tests Seriously: Simulate exam conditions
  6. Time Management: 65 questions in 180 minutes = less than 3 minutes per question
  7. Don't Ignore General Aptitude: Easy 15 marks, practice regularly
  8. Revision is Key: Keep short notes for quick revision
  9. Join Discussion Forums: GateOverflow is excellent for doubt clearing
  10. Stay Consistent: Regular study is better than marathon sessions

🔢 GATE Score Calculation

Formula (for multi-session papers):

Mₜ = M₉ + (Mₜᵢ - M₉ᵢ) / (M̄ₜ - M̄ᵢ) × (M₉ - Mᵢ)

Where:

  • Mₜ = Normalized marks of candidate
  • M₉ = Marks of top 0.1% or top 10 (whichever is larger) in general category
  • Mₜᵢ = Actual marks obtained in session

GATE Score Formula:

S = S₉ + (Sₜ - Sᵢ) / (Mₜ - Mᵢ) × (M - Mᵢ)

Where:

  • S = GATE Score (out of 1000)
  • M = Marks obtained by candidate
  • M₉ = Qualifying marks for general category
  • S₉ = GATE Score assigned to M₉ (usually 350)
  • Sₜ = GATE Score assigned to top scorer (usually 900-1000)

Last Updated: March 2026

Best of luck for GATE CSE 2026!

Advertisement Placement

Share this article: