Home
Shop
Roadmaps
About
Projects
CertificationsI am
AIR 2499
GATE - 2024
Attended GATE CSE Examination 2024 & secured a total of 50.4/100 marks in first attempt.
know your plan
Roadmap For GATE
-
Correct Mindset
Every hour you spent preparing is an investment in your future success. Stay focused, stay motivated, and remember that every small step in right direction brings you closer to achieving your dreams.
-
Understand gate Pattern
Number of Gate Papers 30 Subjects Duration of Gate Exam 180 minutes (3 hours) Divisions in Gate Paper - Paper 1: General Aptitude (GA)
- Paper 2: Student Selected Subject
Total No. of Questions Total Marks: 65
- General Aptitude: 10 Q.
- Selected Subjects: 55 Q.
Types of Questions in the GATE Exam - MCQ (Multiple Choice Questions)
- MSQ (Multiple Select Questions)
- NAT (Numerical Answer Type)
Distribution of marks for CS Total Marks: 100 Mark
- General Aptitude = 15 marks
- Engineering Math = 13 marks
- Subject Questions = 72 marks
Marking System Questions Carry1 marksor2 marks. Negative Marking in the GATE 2025 - For 1-mark MCQs,1/3 markswill be deducted for an incorrect answer.
- For 2-mark MCQs,2/3 markswill be deducted for an incorrect answer.
- There isno negative markingfor wrong answers to MSQ or NAT Questions.
-
watch > learn > write
Watch a lecture, learn from it & write your notes to remember it. Read book for reference while making notes. By this way, you have studied 1 subject thrice in structured way.
-
PRACTICE
Keep practicing questions & solve problems reularly. Revise notes periodically once in a while.
ORDER OF STUDY
Subjects for GATE(CSE)
| # | SUBJECT | BOOK |
|---|---|---|
| 1 | Discrete Mathematics | Discrete Mathematics & it's Applicationsby Kenneth H Rosen |
| 2 | Digital Logic | Digital Logic & Computer Designby Morris M Mano |
| 3 | C Programming | The C Programming Languageby Dennis M. Ritchie |
| 4 | Data Structures | Data Structures & Algorithms Made Easyby Narasimha Karumanchi |
| 5 | Algorithms Design and Analysis | Introduction to Algorithmsby CLRS |
| 6 | Theory of Computation | Introduction to the Theory of Computationby Michael Sipser |
| 7 | Compiler Design | Compilersby Aho & Ullman |
| 8 | Operating System | Operating System Conceptsby Galvin Gagne |
| 9 | Computer Organization & Architecture | Computer Organizationby Carl Hamacher |
| 10 | Database Management System | Database System Conceptsby Henry F Korth |
| 11 | Computer Networks | Computer Networks A Top-Down Approachby Forouzan |
| 12 | Engineering Mathematics | Engineering Mathematics for GATEby Made Easy |
| 13 | Aptitude & Reasoning | Reasoning & Aptitude for GATEby Made Easy |
✓ Important Topics
-
Mathematical Logic
- Propositional &
- First Order Logic
-
Set Theory & Algebra
- Sets
- Relations
- Functions
- Partial Orders
- Lattices
- Groups
-
Combinatorics
- Counting
- Recurrence Relations
- Generating Functions
-
Graph Theory
- Connectivity
- Matching
- Graph Coloring
Discrete Mathematics by Prof. Ashish Choudhary IIIT Bangalore
Tips:-
- Get conceptual clarity from video lectures & make precise notes for Logics and Graph Theory.
- Solve all the PYQs to find the pattern of questions asked.
- Practice from the test series.
✓ Important Topics
- Boolean Algebra
-
Minimization
- K-Maps
- Logic Functions
-
Combinational Circuits
- Multiplexers
- Demultiplexers
- Encoder
- Decoder
-
Sequential Circuits
- Flip Flops
- Finding Modulus of Counters
-
Number Representation
- Fixed &
- Floating Point Numbers
- IEEE Format, Range & Precision
Digital Electronics for GATE CSE by Tutorials Point
Tips:-
- Read book properly especially the starting 5 chapters till Combinational circuits.
- Solve all the excercises from book.
- Give high priority to K-Maps as it will construct most of the questions.
✓ Important Topics
- Array
- List
- Linked List
- Strings
- Functions
- Pointers & Static Variables
- Stack
- Queue
- Recursion
C Programming basics by Vishvadeep Gothi Unacademy
Tips:-
- About 25% of the complete paper is from C Programming & DSA.
- Visit all PYQs and types of programs available on YouTube to know all variety of questions.
- Practicing C will help in placements as well so this subject holds more weightage than any.
✓ Important Topics
-
Data Structures
- Find no. of leaf nodes, non-leaf nodes, total no. of nodes in tree, height of tree, etc.
- Binary Trees
- BST
- Traversals (Preorder, Inorder, Postorder)
- Spanning Trees & MST
- AVL Trees & balancing them after insertion and deletion
- Properties of Heap
- Deletion & Insertion in Heap
-
Asymptotic Notations
- Worst Case - TC & SC of given program
-
Algorithms
- Searching, Sorting & Hashing
- Dynamic Programming
- Divide & Conquer
- Greedy
- Knapsack, MCM, LCSS, Job Sequence & Compressing mechanism.
- Basic theory of P-NP problems
Data Structures by Shubham Agarwal Geeksforgeeks
Algorithm & Analysis of Algorithm by Vishvadeep Gothi Unacademy
Tips:-
- About 25% of the complete paper is from C Programming & DSA.
- Visit all PYQs and types of programs available on YouTube to know all variety of questions.
- Practicing DSA will help in placements as well so this subject holds more weightage than any.
✓ Important Topics
-
Regular Expressions & Finite Automata
- Find no. of states in DFA
- NFA to DFA conversion
- Closure properties of FA
- Finding regular expressions
- Mealy Moore Machine
-
Context Free Grammar & Push Down Automata
- Simplification of CFG
- Identification of Languages, Regular Languages, CFL & Pumping Lemma
-
Turing Machines & Undecidability
- Decidability property
- Properties of Recursive & Recursive Enumerable Languages
- Expressive power of languages
- Basics of NP Completeness
Introduction to Theory of Computation by Neso Academy
Tips:-
- Read the book and make notes conceptually.
- Solve Excercises from bookAutomata Theory by Peter Linz.
- 80% of questions come from Regular Expressions & Finite Automata
✓ Important Topics
-
Lexical Analysis
- Errors in Compilers
- No. of Lexemes
-
Parser
- Top Down Parser(LL1)
- Bottom Up Parser(LR0, SLR, CLR1, LALR1)
- Find FIRST / FOLLOW
-
Syntax Directed Translation
- Types of SDT
-
Intermediate Code Generation
- Code Representation(3AC, DAG)
-
Code Optimization
- Control Flow Graph (Leader)
-
Runtime Environments
- Activation Records
- Access Link
- Control Link
- Liveness Analysis
Introduction to Compiler Design by Neso Academy
Tips:-
- Parsing and all its techniques (atleast one question from this topic LL(1), LR(1), SLR, LALR, CLR)
- Finding FIRST & FOLLOW
- Precedence and Associativity of operators
- Finding value from Expression Tree
- Practice questions on Ambiguous Grammar
✓ Important Topics
-
CPU & IO Scheduling
- Finding Turn Around Time & Waiting Time
-
Memory Management
- Numericals on Page table size, logical address, physical address, inverted page table, etc
- Virtual Memory
-
Synchronization
- Semaphores
- Deadlock
- Banker's Algorithm
-
Basics of
- System Calls
- Processes
- Threads
- Inter-process Communication
- Concurrency
Operating Systems by Vishvadeep Gothi Unacademy
Tips:-
- Practice numericals on various Scheduling policies to find turn around time and waiting time.
- Focus more on solving PYQs and test series. Use book more for reference that's it.
- Solve numericals on memory manangement
✓ Important Topics
-
CPU Control Design
- Machine Instructions
- Addressing Modes
- ALU & Data-Path
- Horizontal & Vertical programming
-
IO Interface
- Interrupt
- DMA
- Write-through & Write-back Protocols
-
Instruction Pipelining
- Speed Up of Pipeline vs Non Pipeline architectures
- Pipeline Hazards
-
Cache & Main memory
- Mapping Techniques
- Multilevel Cache
- Ccache Mmemory Organization
- Secondary Storage
- Floating Point Arithmetic
Computer Organization & Architecture for GATE CSE by Vishvadeep Gothi Unacademy
Tips:-
- Watch above YouTube video completely
- Focus more on the following topics : Memory Mapping, Pipelining, Cache Memory, Addressing Modes.
- Solve all the previous year questions. Solve questions from any test series thay you might have joined and you are good to go.
✓ Important Topics
- SQL Queries
-
Normalization
- Find Normal form & Candidate Keys
- Decomposition of Relation
- Integrity Constraints
-
Relational Model
- Relational algebra
- Tuple Calculus
- Joins
-
File Structures
- Indexing
- B & B+ Trees
- Transactions
- Finding View Serializability & Conflict Serializability
- Recoverable & Cascade Schedule
DBMS for GATE CSE by Vishvadeep Gothi Unacademy
Tips:-
- Solve so many questions, just learn quickly and solve problems
- In B, B + trees, GATE gives theory questions only
- Functional dependencies topic has so many questions asked in previous years and is one of the easiest topic. So, do not skip it.
✓ Important Topics
-
Layering concept
- OSI & TCP
- IP Headers Protocol Stacks
-
Data Link Layer
- Framing
- Flow Control
- Ethernet Bridging
- Error Detection
- Medium access Control
-
Routing protocols
- Shortest Path
- Flooding
- Distance Vector
- Link State Routing
-
Application layer protocols
- DNS, SMTP, HTTP, FTP, DHCP, ARP, POP, ICMP, RARP, Email
-
TRANSPORT LAYER
- Flow Control & Congestion Control
- UDP, TCP, Sockets
- basics of packet & circuit
Computer Networks by Ravindrababu Ravula
Tips:-
- CN syllabus is very vast so its very important to go through the syllabus and read only those things which are relevant to gate
- Focus more on concept than numericals and make notes precisely
- CN might seem tough but you can do it
✓ Important Topics
-
probability
- Random Variables
- Conditional probability
- Bayes Theorem
- Poisson & Binomial Distribution
- Mean, Median, Mode & Standard Deviation
-
Linear Algebra
- Matrices
- Determinants
- System of Linear Equations
- Eigen Values & Eigen Vectors
-
calculus
- Limit
- Continuity
- Differentiability
- Maxima & Minima
- Mean Value Theorem
- Integration
Engineering Mathematics for GATE CSE by Gate Academy
Tips:-
- Focus more on Probability, Determinants, Eigenvalues, Eigenvectors, Calculus & Logics.
✓ Important Topics
-
verbal aptitude
- Basic English Grammar
- Basic Vocabulary
-
Quantitative aptitude
- Data Interpretation
- Numerical Computation & Estimation
- Mensuration & Geometry
- Probability
-
analytical aptitude
- Logic: Deduction & Induction
- Analogy: Numerical Relations & Reasoning
-
spatial aptitude
- Transformation of Shapes
- Paper Folding
- Patterns in 2D & 3D
General Aptitude for GATE by Avinash Sir Unacademy
Tips:-
- Practice at the End to keep formulas remembered
- Practice PYQs & practice from Test Series
- Aptitude is not a subject. It helps in sharpening the brain.
