GATE Computer Science Engineering (CSE) Syllabus

blob-article

GATE Computer Science Engineering (CSE) Syllabus 

Graduate Aptitude Test in Engineering (GATE) is organized for 27 domains of engineering to offer admissions and fellowship to aspiring candidates in recognized Universities and academic institutes of India and overseas. Additionally, the score of this exam is also used to obtain employment in several Public Sector Undertakings (PSUs) across India.

GATE CSE Syllabus

Section 1: Engineering Mathematics

1. Linear Algebra
2. Probability
3. Calculus
4. Discrete Mathematics

Section 2: Digital Logic

1. Combinational Boolean and sequential circuits; 
2. Algebra; 
3. Number representations, Minimization, and Computer arithmetic (floating and fixed point).

Section 3: Computer Organization and Architecture

1. ALU, data-path, and control unit.
2. Memory hierarchy: main memory, cache, and secondary storage; 
3. Machine instructions and addressing modes; Instruction pipelining; and I/O interface (DMA and interrupt mode).

Section 4: Programming and Data Structures

1. Arrays, Stacks, and Queues
2. Recursion, Programming in C
3. A linked lists, graphs, trees, binary search trees, and binary heaps

Section 5: Algorithms

1. Asymptotic worst-case time and space complexity
2. Searching, sorting, and hashing
3. Algorithm design techniques: Dynamic programming and divide-and-conquer graph search, minimum spanning trees, greedy, and shortest paths

Section 6: Theory of Computation

1. Context-free grammars and push-down automata; Regular and context-free languages; Regular expressions and finite automata; and Turning machines undecidability.

Section 7: Compiler Design

1. Parsing, Lexical analysis, and syntax-directed translation. Intermediate code generation. Runtime environments. Local optimization, Data flow analyses: livneness analysis, constant propagation, and common subexpression elimination.

Section 8: Operating System

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

Section 9: Databases

1. Integrity constraints, normal forms; Relational model: relational, algebra, SQL, and tuple calculus; ER-model; File organization and indexing (B and B+ trees).

Section 10: Computer Networks

1. Concept layering: TCP/IP and OSI Protocol Stacks; Data link layer: farming, error detection; Basics of packet and virtual circuit-switching; Ethernet bridging; Medium Access and Control; Routing protocols: flooding, distance, shortest path, and link state routing; Fragmentation and IP addressing, CIDR notation, Basics of IP support protocols (ICMP, ARP, and DHCP), Transport layer: flow control and congestion control, sockets, TCP, and UDP; Network Address Translation (NAT); and Application layer protocols: Email, DNS, FTP, HTTP, and SMTP.