GATE CS 2021 Syllabus
Every year, GATE Syllabus remains almost similar to the previous same, merely there is a rare chance that GATE Syllabus gets changed.
Students who would be writing the GATE exam must refer the GATE CS and IT syllabus defined by IIT Bombay to start with GATE Preparation as the questions are formulated as per the official GATE syllabus.
Understanding GATE syllabus prior starting GATE preparation will help the candidates effectively plan the preparation strategy and score better marks. GATE CS and IT exam paper consist of questions from aptitude and the core subjects (CS and IT).
Check the detailed information about topics from GATE CSE Paper here,
GENERAL APTITUDE
Verbal Ability:
1. Grammar
2. Vocabulary
3. Coding-Decoding & Series
4. Directions
5. Blood Relations
6. Arrangements
7. Syllogism
8. Inference & Assumptions
9. Clocks and Puzzles
Numerical Ability:
1. Fundamentals
2. Equations
3. Percentage
4. Averages
5. Ratio & Propotions
6. Mixture and Alligations
7. Data Interpretation & Data Suffiency
8. Time
9. Speed & Distance
10. Time & Work
11. Set Theory & Venn Diagrams
12. Progression
13. Functions & Graphs
14. Logarthims
15. Permutations and Combinations
16. Probability
17. Geometry & Mensuration
ENGINEERING MATHEMATICS
Discrete Mathematics:
1. Propositional and first order logic
2. Sets
3. Relations
4. Functions
5. Partial orders and lattices
6. Groups
7. Graphs: connectivity
8. Matching
9. Coloring
10. Combinatorics: counting
11. Recurrence relations
12. Generating functions
Linear Algebra:
1. Matrices
2. Determinants
3. System of linear equations
4. Eigenvalues and eigenvectors
5. LU decomposition
Calculus:
1. Limits
2. Continuity and differentiability
3. Maxima and minima
4. Mean value theorem
5. Integration
Probability:
1. Random variables
2. Uniform
3. Normal
4. Exponential
5. Poisson and binomial distributions
6. Mean
7. Median
8. Mode and standard deviation
9. Conditional probability and Bayes theorem
COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
Digital Logic:
1. Boolean algebra
2. Combinational and sequential circuits
3. Minimization
4. Number representations and computer arithmetic (fixed and floating point)
Computer Organization and Architecture:
1. Machine instructions and addressing modes
2. ALU
3. data?path and control unit
4. Instruction pipelining
5. Memory hierarchy
6. Cache
7. Main memory and secondary storage
8. I/O interface (interrupt and DMA mode)
Programming and Data Structures:
1. Programming in C
2. Recursion
3. Arrays
4. Stacks
5. Queues
6. Linked lists
7. Trees
8. Binary search trees
9. Binary heaps
10. Graphs
Algorithms:
1. Searching
2. Sorting
3. Hashing
4. Asymptotic worst case time and space complexity
5. Algorithm design techniques
6. Greedy
7. Dynamic programming and pide?and?conquer
8. Graph search
9. Minimum spanning trees
10. Shortest paths
Theory of Computation:
1. Regular expressions and finite automata
2. Context-free grammars and push-down automata
3. Regular and contex-free languages
4. Pumping lemma
5. Turing machines and undecidability
Compiler Design:
1. Lexical analysis
2. Parsing
3. Syntax-directed translation
4. Runtime environments
5. Intermediate code generation
Operating System:
1. Processes
2. Threads
3. Inter?process communication
4. Concurrency and synchronization
5. Deadlock
6. CPU scheduling
7. Memory management and virtual memory
8. File systems
Databases:
1. ER?model
2. Relational model
3. Relational algebra
4. Tuple calculus
5. SQL
6. Integrity constraints
7. Normal forms
8. File organization
9. Indexing (e.g., B and B+ trees)
10. Transactions and concurrency control
Computer Networks:
1. Concept of layering
2. LAN technologies (Ethernet)
3. Flow and error control techniques
4. Switching
5. IPv4/IPv6
6. Routers and routing algorithms (distance vector, link state)
7. TCP/UDP and sockets
8. congestion control
9. Application layer protocols (DNS, SMTP, POP, FTP, HTTP)
10. Basics of Wi-Fi
11. Network security: authentication
12. Basics of public key and private key cryptography
13. Digital signatures and certificates
14. Firewalls