GATE Syllabus for CSE – Computer Science and Information Technology.
Given here is the detailed syllabus for GATE Exam CSE Paper. The syllabus for Computer science and information technology has been published by IITs and IISC for the GATE syllabus. Mainly there are two components – Engineering mathematics, and CS-IT. Candidates who will be appearing in GATE must know the complete GATE exam syllabus before starting their preparation. The GATE CSE paper would contain 25 questions carrying 1-mark each (sub-total 25 marks) and 30 questions carrying 2-marks each (sub-total 60 marks). The question paper will consist of questions of multiple choice and numerical answer type. For numerical answer questions, choices will not be given. Candidates have to enter the answer (which will be a real number, signed or unsigned, e.g., 25.06, -25.06, 25, -25 etc.). The paper will also have 15 marks for questions on General Aptitude.
Please note – The GATE exam will also have General Aptitude section. The General Aptitude section GATE syllabus is defined separately.
Given below is the GATE Syllabus CSE.
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.
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: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Computer Science and Information Technology
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Computer Organization And Architecture
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).
Programming And Data Structures
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 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 contex-free languages, pumping lemma. Turing machines and undecidability.
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.
Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File 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. 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.
Download GATE Syllabus for CSE – Click here to download syllabus of GATE 2018 for Computer Science and Information Technology.