- Being a GATE aspirant, it is very important that you first know what is the syllabus for GATE Computers (CS/IT) Examination before you start preparation.
- Keep handy the updated copy of GATE Computers (CS/IT) Examination syllabus.
- Go through the complete and updated syllabus, highlight important subjects and topics based on Past GATE Computers (CS/IT) Papers and Weightage plus your understanding of particular subject or topic.
- Keep tracking and prioritising your preparation-to-do list and the syllabus for the GATE Computers (CS/IT) examination.

## GATE 2018 Computers (CS/IT) Syllabus

#### Section I: 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.

##### 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.

####

Section II: Digital Logic

##### Topics:

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

#### Section III: Computer Organization and Architecture

##### Topics:

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).

#### Section IV: Programming and Data Structures

##### Topics:

Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

#### Section V: Algorithms

##### Topics:

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.

#### Section VI: Theory of Computation

##### Topics:

Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.

#### Section VII: Compiler Design

##### Topics:

Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.

#### Section VIII: Operating System

##### Topics:

Processes, threads, inter?process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.

#### Section IX: Databases

##### Topics:

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 X: Computer Networks

##### Topics:

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.