Students who are looking for the GATE syllabus for CSE (Computer Science) must note that the syllabus for computer science and information technology has been published by the IITs and IISC for the GATE 2019.
The syllabus mainly parts, namely, Engineering mathematics and CSIT.
Students who wish to appear for the GATE exam next year must know the syllabus completely and properly.
The exam, GATE CSE paper, in its first part, will contain 25 questions of 1 mark each. Making a total of 25 marks. And in its second part, it will contain a total of 30 questions of 2 marks each. Making a total of 60 marks. The question paper will also have questions related to general aptitude for 15 marks. It shall be noted that the question paper will contain will contain multiple choice and numerical answer questions for which choices will not be given.
It shall be noted as the question paper will have the general aptitude section, this section is defined separately under the GATE syllabus.
The syllabus for the GATE CSE is as follows.
- Propositional and first-order logic.
- Partial order and lattices
- Graphs” connectivity, matching, colouring.
- Combinatorics such as counting, recurrence relations and generating functions.
- A system of linear equations
- Eigenvalues and eigenvectors
- LU decomposition.
- Continuity and differentiability
- Maxima and minima
- Mean value theorem
- Random variables
- Poisson and binomial distributions
- Mode and standard deviation
- Conditional probability
- Bayes theorem
- Boolean algebra
- Combinational and sequential circuits
- Number representations
- Computer and arithmetic (fixed and floating point)
Computer organization and architecture
- Machine instruction and addressing modes.
- Data path and control unit.
- Instruction pipelining.
- Memory hierarchy such as cache.
- Main memory and secondary storage
- I/O interface (Interrupt and DMA mode.)
Programming and data structures.
- Programming in C Recursion
- Linked lists
- Search trees
- binary heaps
- Asymptotic worst-case time and space complexity.
- Algorithm design techniques such as greedy, dynamic programming and divide and conquer.
- Graph search
- Minimum spanning trees
- Shortest paths.
Theory of computation
- Regular expressions and finite automata.
- Context-free grammars and push down automata.
- Regular and context-free language
- Pumping lemma
- Tuning machines and undecidability.
- Lexical analysis
- Syntax directed translation.
- Runtime environments
- Intermediate code generation
- Interprocess communication
- Concurrency and synchronization
- CPU scheduling
- Memory and management and virtual memory
- File systems.
- ER model
- Relational model
- Relational algebra
- Tuple calculus
- Normal forms
- File organisation
- Transations and concurrency control.
- Concept of layering
- LAN technologies
- Flow and error control techniques
- Routers and routing algorithms (distance vector, link state)
- TCP/UDP and sockets
- Congestion control.
- Application layer protocols
- Basics of a public key and private key cryptography
- Digital signatures and certificates
Also, read: Top MCA Colleges in India