SECTION 1 — General Aptitude (15 marks):
  Verbal Ability: English grammar, vocabulary, sentence completion, comprehension
  Numerical Ability: numerical computation, estimation, reasoning, graphs

SECTION 2 — CS Core (85 marks):
  
  Engineering Mathematics (~13%):
    Discrete Maths: logic, sets, relations, functions, graph theory, combinatorics
    Linear Algebra: matrices, determinants, eigenvalues
    Calculus: limits, derivatives, integrals, maxima/minima
    Probability: Bayes theorem, distributions, random variables
  
  Digital Logic (~5%):
    Boolean algebra, K-maps, combinational circuits (MUX, decoder, adder)
    Sequential circuits (flip-flops, counters, registers)
    Number systems: binary, octal, hex conversions
  
  Computer Organisation (~5%):
    Machine instructions, ALU, control unit, pipelining
    Memory hierarchy: cache (mapping, replacement), virtual memory, TLB
  
  Programming & Data Structures (~15%):
    C: pointers, arrays, structs, recursion
    DS: arrays, linked lists, stacks, queues, trees, graphs, heaps
    Sorting: complexity, stability
  
  Algorithms (~15%):
    Asymptotic notation, searching, sorting
    Graph algorithms: BFS/DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Prim, Kruskal
    Dynamic programming, greedy algorithms
    Complexity classes: P, NP, NP-complete, NP-hard
  
  Theory of Computation (~10%):
    Automata: DFA, NFA, PDA, Turing Machine
    Regular expressions and languages
    Context-free grammars
    Decidability and undecidability
  
  Compiler Design (~8%):
    Lexical analysis, syntax analysis (parsing)
    LL(1), LR(0), SLR, LALR parsers
    Semantic analysis, intermediate code generation
  
  Operating Systems (~12%):
    Process management, scheduling algorithms
    Synchronisation: mutex, semaphore, deadlock
    Memory management: paging, segmentation, virtual memory
    File systems
  
  Databases (~9%):
    ER model, relational model, normalization (1NF-BCNF)
    SQL: joins, aggregates, nested queries, views
    Transactions: ACID, isolation levels, concurrency control
    Indexing: B+ tree, hashing
  
  Computer Networks (~8%):
    OSI and TCP/IP models, application/transport/network layers
    Flow control, error control, MAC protocols
    Routing algorithms, IP addressing, subnetting
    TCP, UDP, HTTP, DNS, DHCP

GATE CSE: 100 marks | 65 questions | 3 hours | -0.33/-0.67 negative marking (MCQ only)
WEIGHTAGE: Algorithms+DS(30%) + OS(12%) + Networks(8%) + Databases(9%) + TOC(10%)
PREVIOUS PAPERS: single most important resource — last 10 years minimum
NAT QUESTIONS: no negative marking — always attempt all NAT questions
MATHS: ~13% direct marks + used in algorithms/theory — do not skip
GATE SCORE → PSU: ONGC, NTPC, BHEL, BSNL recruit via GATE score directly