GATE CSE Syllabus 2023
GATE or General Aptitude Test in Engineering is an entrance exam conducted each year for getting admission into the most prestigious institutes across the country including IISc Banglore, IITs, NITs, IIITs, and many others. The GATE authority (IIT Kanpur for this year) has released the official notification regarding the GATE exam 2023. Candidates who are willingly interested in pursuing their higher studies from one of the most esteemed institutes in the country and want to dig deep into their core sectors can give the GATE examination in 2023.

This year there is no change in the syllabus of the GATE CSE examination, the syllabus is completely the same as in 2021 and 2022. In the year 2020, IIT Bombay made a few changes to the GATE CSE syllabus for the GATE CSE 2021, and since then the same syllabus is being followed.
This year for the GATE 2023 examination IIT Kanpur is the organizing authority and no changes have been made to the GATE CSE syllabus 2023. The paper will be divided into two sections:
- Section A: General Aptitude- This section comprises a share of 15 marks and discusses general aptitude and reasoning.
- Section B: Computer Science and Information Technology- This section has a share of 85 marks and discusses the core disciplined subject.
Marking Scheme: There are a total of 65 questions in the paper, out of them 10 questions are from Section A, i.e. from General Aptitude and the other 55 questions are from Section B or of core disciplined. Questions are of three types:
- MCQ (Multiple Choice Questions): 1 and 2 mark questions along with 0.33 and 0.66 negative marking for wrong answers respectively.
- MSQ (Multiple Select Questions): 1 and 2 mark questions with no negative marking for the wrong answers and no partial marking.
- NAT (Numerical Answer Type): 1 and 2 mark questions with no negative marking.
The General Aptitude section has 10 questions out of which 5 questions are of 1 mark and the other 5 are of two marks making a total of 15 marks. All these questions can be a combination of MCQ, MSQ, and NAT.
GATE CSE Syllabus 2023
The topic-wise official syllabus released by IIT Kanpur for GATE CSE 2023 is as follows:
General Aptitude (GA) – For 15 marks
- Verbal Aptitude – Basic English Grammar: Tenses, Articles, Adjectives, Prepositions, Conjunctions, Verb-noun Agreement, and Other Parts of Speech Basic Vocabulary: Words, Idioms, and Phrases in Context Reading and Comprehension Narrative Sequencing
- Quantitative Aptitude – Data interpretation: Data Graphs (Bar Graphs, Pie Charts, and Other Graphs Representing Data), 2- and 3-dimensional Plots, Maps, and Tables Numerical Computation and Estimation: Ratios, Percentages, Powers, Exponents, Exponents Formula, and Logarithms, Logarithm Formula, Permutations and Combinations, and Series Mensuration and Geometry, Elementary Statistics and Probability
- Analytical Aptitude – Logic: Deduction and Induction, Analogy, Numerical Relations, and Reasoning
- Spatial Aptitude – Transformation of shapes: Translation, Rotation, Scaling, Mirroring, Assembling, and Grouping Paper Folding, Cutting, and Patterns in 2 and 3 Dimensions
Computer Science and Information Technology (CS/IT) – for 85 marks
1. Engineering Mathematics
Discrete Mathematics
- Propositional and First-Order Logic
- Sets, Relations, Functions, Partial Orders, and Lattices
- Monoids, Groups
- Graphs: Connectivity, Matching, Coloring
- Combinatorics: Counting, Recurrence Relations, Generating Functions
Linear Algebra
Calculus
Probability and Statistics
2. Digital Logic
- Boolean Algebra
- Combinational and Sequential Circuits
- Minimization
- Number Representations and Computer Arithmetic (Fixed and Floating Point)
3. Computer Organization and 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 and Data Structures
- Programming in C
- Recursion
- Arrays, Stacks, Queues
- Linked Lists, Trees, Binary Search Trees, Binary Heaps
- Graphs
5. Algorithms
- Searching, Sorting, Hashing.
- Asymptotic Worst Case Time and Space Complexity
- Algorithm Design Techniques: Greedy, Dynamic Programming, and 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 Optimization
- Data Flow Analyses: Constant Propagation, Liveness Analysis, Common Subexpression Elimination
8. Operating System
- 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 (e.g., B and B+ Trees)
- Transactions and Concurrency Control
10. Computer Networks
- Concept of Layering: OSI and TCP/IP Protocol Stacks
- Basics of the Packet, Circuit, and Virtual Circuit Switching
- Data Link Layer: Framing, Error Detection, Medium Access Control, Ethernet Bridging
- Routing Protocols: Shortest Path, Flooding, Distance Vector, and Link State Routing
- Fragmentation and IP Addressing, IPv4, CIDR Notation
- Basics of IP Support Protocols (ARP, DHCP, ICMP), Network Address Translation (NAT)
- Transport Layer: Flow Control and Congestion Control, UDP, TCP, Sockets
- Application Layer Protocols: DNS, SMTP, HTTP, FTP, Email
Please Login to comment...