GATE Syllabus of CSE | GATE 2019 CSE Syllabus

0

Computer Science and Engineering (CSE) is one of the most popular streams in GATE. If you are looking to get admitted into the CSE courses in any of the IITs or other premier institutes, then you need to read the syllabus and prepare in the right way. In the following post, we would be taking a look at the details of the GATE Syllabus of CSE.

GATE Syllabus of CSE – Complete Details

Let us take a look at the detailed GATE Syllabus for Computer Syllabus. The GATE 2019 CSE Syllabus has certain changes compared to last year. Let us check out the GATE Syllabus for CSE.

Section1: 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, the 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

Section 2: Digital Logic

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

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

Section 9: Databases

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

The 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 the public key and private key cryptography, digital signatures, and certificates, firewalls.

You can also download the PDF version of the GATE 2019 CSE syllabus by clicking on the link below:

GATE Syllabus of CSE – Download PDF

This was the detailed GATE Syllabus of CSE. To get more information about the GATE 2019 Exam, click on the button below:

GATE Exam 2019