Graduate Aptitude Test in Engineering (GATE) Syllabus

Basic English grammar, tenses, articles…

• Basic English grammar
• tenses
• articles
• adjectives
• prepositions
• conjunctions
• verb-noun agreement
• other parts of speech
• Basic vocabulary
• words, idioms, and phrases in context
• Reading and comprehension
• Narrative sequencing
• Data interpretation
• data graphs (bar graphs, pie charts, and other graphs representing data)
• 2-and 3-dimensional plots
• maps
• tables
• Numerical computation and estimation
• ratios
• percentages
• powers
• exponents and logarithms
• permutations and combinations
• series
• Mensuration and geometry
• Elementary statistics and probability
• Logic: deduction and induction
• Analogy
• Numerical relations and reasoning
• Transformation of shapes: translation, rotation, scaling, mirroring, assembling, and grouping
• Paper folding, cutting, and patterns in 2 and 3 dimensions

Systems of linear equations, matrices, determinants…

• Systems of linear equations
• matrices
• determinants
• eigenvalues and eigenvectors
• LU decomposition
• Limits
• continuity and differentiability
• functions of one variable
• maxima and minima
• mean value theorem
• integration
• First-order equations
• higher-order linear differential equations
• Random variables
• uniform, normal, exponential, Poisson and binomial distributions
• mean, median, mode, standard deviation
• conditional probability and Bayes theorem
• Propositional and first-order logic
• sets
• relations
• functions
• partial orders and lattices
• monoids
• groups
• graphs (connectivity, matching, colouring)
• combinatorics (counting, recurrence relations, generating functions)

Boolean algebra, combinational and sequential circuits, minimization…

• Boolean algebra
• combinational and sequential circuits
• minimization
• number representations and computer arithmetic (fixed and floating point)
• 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)
• Programming in C
• recursion
• arrays
• stacks
• queues
• linked lists
• trees
• binary search trees
• binary heaps
• graphs
• Searching
• sorting
• hashing
• asymptotic worst-case time and space complexity
• algorithm design techniques (greedy, dynamic programming, divide-and-conquer, backtracking)
• graph traversals
• minimum spanning trees
• shortest paths
• Regular expressions and finite automata
• context-free grammars and push-down automata
• regular and context-free languages
• pumping lemma
• Turing machines and undecidability
• Lexical analysis
• parsing
• syntax-directed translation
• runtime environments
• intermediate code generation
• local optimization
• data flow analyses (constant propagation, liveness analysis, common subexpression elimination)
• System calls
• processes
• threads
• inter-process communication
• concurrency and synchronization
• deadlocks
• CPU scheduling
• memory management (paging, segmentation, virtual memory)
• file systems
• I/O systems
• 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
• Concept of layering (OSI and TCP/IP Protocol Stacks)
• basics of 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 like 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)