GATE Syllabus for Computer Science Engineering

GATE Syllabus 2020 for CSE

Syllabus for General Aptitude (GA):

  1. Verbal Ability: English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction.
  2. Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data interpretation.

Computer Science and Information Technology (CS):

  1. Engineering Mathematics:

    • Discrete Mathematics:
    • Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring.
    • Combinatorics:
    • counting, recurrence relations, generating functions.
    • Calculus:
    • Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
    • Linear Algebra:
    • Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
    • Probability:
    • Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.

  2. Digital Logic
  3. Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).

  4. Computer Organization and Architecture
  5. Machine instructions and addressing modes. ALU, data-path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).

  6. Programming and Data Structures
  7. Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

  8. Algorithms
  9. Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer. Graph search, minimum spanning trees, shortest paths.

  10. Theory of Computation
  11. Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.

  12. Compiler Design
  13. Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.

  14. Operating System
  15. Processes, threads, inter-process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.

  16. Databases
  17. 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.

  18. Computer Networks
  19. Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.

You want to apply for GATE 2020 – Click Here