GATE CS 2019 SYLLABUS-CLICK NOW

GATE 2019 CS SYLLABUS:

Section 1: Numerical and Verbal Ability

• Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data interpretation

• Verbal Ability: English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction

Section 2: Mathematics

Discrete Mathematics :

• Propositional and first-order logic

• Sets, relations, functions, partial orders and lattices. Groups

• Combinatorics: counting, recurrence relations, generating functions

• Graphs: connectivity, matching, colouring

Linear Algebra :

• Matrices, determinants

• LU decomposition

• System of linear equations

• Eigenvalues and eigen vectors

Probability :

• Random variables

• Mean, median, mode and standard deviation

• Uniform, normal, exponential, Poisson and binomial distributions

• Conditional probability and Bayes theorem

Calculus:

• Limits,

• Maxima, Minima and Mean Value Theorem

• Integration

Section3: Digital Logic

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

 Section 4: 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). 

Section 5: Programming and Data Structures

•  Programming in C. 

• Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

 Section 5: Algorithms

•  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 6: Theory of Computation

• Regular expressions and finite automata.

•  Context-free grammars and push-down automata. 

• Regular and context-free languages, pumping lemma. 

• Turing machines and undecidability.

 Section 7: Compiler Design

•  Lexical analysis, parsing, syntax-directed translation.

•  Runtime environments. Intermediate code generation. 

Section 8: Operating System

•  Processes, threads, inter‐process communication, concurrency and synchronization. 

• Deadlock. 

• CPU scheduling. 

• Memory management and virtual memory.

•  File systems

        BEST BOOK FOR PREPARATION OF GATE:

GATE 2020: Computer Science and Information Technology 30 Years' Topic-wise Previous Solved Papers

                                                          BUY NOW

                                        

GATE 2019: Computer Science and IT Engineering - Previous Solved Papers

                                           BUY NOW