syllabus.md

• GATE Syllabus
  • Section 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
      • Matrices
      • Determinants
      • System of linear equations
      • Eigenvalues and eigenvectors
      • LU decomposition
    • Calculus
      • Limits
      • Continuity and differentiability
      • Maxima and minima
      • Mean value theorem
      • Integration
    • Probability and Statistics
      • Random variables
      • Uniform
      • Normal
      • Exponential
      • Poisson and binomial distributions
      • Mean
      • Median
      • Mode and standard deviation
      • Conditional probability
      • Bayes theorem
    • Computer Science and Information Technology
  • Section 2: Digital Logic
    • Boolean algebra
    • Combinational and sequential circuits
    • Minimization
    • Number representations
    • Computer arithmetic (fixed and floating point).
  • Section 3: Computer Organization and Architecture
    • Machine instructions and addressing modes
    • ALU
    • Data‐path
    • Control unit
    • Instruction pipelining
    • Pipeline hazards
    • Memory hierarchy
      • Cache
      • Main memory
      • Secondary storage
    • I/O interface (interrupt and DMA mode)
  • Section 4: Programming and Data Structures
    • Programming in C
    • Recursion
    • Arrays
    • Stacks
    • Queues
    • Linked lists
    • Trees
    • Binary search trees
    • Binary heaps
    • Graphs
  • Section 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
  • Section 6: Theory of Computation
    • Regular expressions
    • Finite automata
    • Context-free grammars
    • Push-down automata
    • Regular and contex-free languages
    • Pumping lemma
    • Turing machines
    • Undecidability.
  • Section 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
  • Section 8: Operating System
    • System calls
    • Processes
    • Threads
    • Inter‐process communication
    • Concurrency
    • Synchronization
    • Deadlock
    • CPU and I/O scheduling
    • Memory management
    • Virtual memory
    • File systems
  • Section 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
  • Section 10: Computer Networks
    • Concept of layering
      • OSI
      • TCP/IP Protocol Stacks
    • Basics of packet
    • Circuit
    • Virtual circuit-switching
    • Data link layer
      • Framing
      • Error detection
      • Medium Access Control
      • Ethernet bridging
    • Routing protocols
      • Shortest path
      • Flooding
      • Distance vector
      • 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