GATE and CSVTU Syllabus Match

S.N. Gate Syllabus Component B.E. Syllabus Component

Section/Unit Topic Semester Subject Unit Remark
1 Propositional and first order logic 1
2 Algebra Linear Mathematics Discrete Sets, relations, functions partial

Discrete Structures
2
orders and lattices
3 Groups. 3
4th
4 Graphs: connectivity, matching,
4
coloring
5 Combinatorics: counting, recurrence
5
Engineering Mathematics

relations, generating functions.

6 Matrices determinants, system of

Maths-1
Applied
linear equations, eigenvalues and 1st 1
eigenvectors, LU decomposition.
7 Limits, continuity and
Calculus

differentiability. Maxima and Not Available in syllabus of BE

NA
minima. Mean value theorem. (12th Components)
Integration
8 Random variables. Uniform,

Mathematics
Probability

normal, exponential, poisson and

binomial distributions. Mean

III
3rd 5
median, mode and standard
deviation. Conditional probability
Computer Science and Information Technology

Digital Electronics & Logic

9 and Bayes theorem.

Boolean algebra 1
10 Combinational and sequential
2,3
circuits
11 Minimization. 1
Digital Logic

12 Number representations and 1

computer arithmetic (fixed and 3rd
floating point).
Computer Systems Architecture Design
Computer Organization and Architecture

13 Machine instructions and 4th 1

addressing modes. ALU, data
path and control unit. Instruction
pipelining
14 Memory hierarchy: cache, main 3
memory and secondary storage;
15 I/O interface (interrupt and DMA 4
mode
 Programming and Data Structures
16 Programming in C. Recursion Problem 1-5
Solving &
3rd Logic
Building
using C
17 Arrays, 1

Data Structures
18 stacks, queues, linked lists, 2
19 trees, binary search trees, binary 4th 3
heaps,
20 graphs 4
Computer Science and Information Technology

21 Searching, sorting, hashing 5

Structures
Data
4th
Algorithms

22 Asymptotic worst case time and 1

Analysis & Design of

space complexity
23 Algorithm design techniques: 2

Algorithms
greedy
5th
24 dynamic programming 3
25 and divideandconquer 2
26 Graph search, minimum spanning 3
trees, shortest paths.
27 Regular expressions and finite Compiler Design Theory of Computation 1-2
Design Compiler Theory of Computation

automata
28 Context-free grammars and push- 3-4
down automata, Regular and contex- 5th
free languages, pumping lemma.
29 Turing machines and undecidability 5

30 Lexical analysis, 1
31 parsing 2
32 syntax-directed translation 6th 3
33 Runtime environments 4
34 Intermediate code generation 5
35 Processes, threads, interprocess 2
Operating System
Operating System

communication, concurrency and

synchronization CPU scheduling
36 Deadlock 4th 3
37 Memory management and virtual 4
memory.
38 File systems 5
Databases

39 ERmodel. Relational model: 5th 1

40 relational algebra, tuple calculus 2
Integrity constraints
41 SQL 3
42 normal forms. Transactions and 4
concurrency control
43 File organization, indexing 5
(e.g., B and B+ trees).
 Data Base Management System
44 Concept of layering. LAN 1
technologies (Ethernet

Computer Networks
45 Flow and error control techniques 2
46 switching. IPv4/IPv6, routers and 3-5
Computer Networks

routing algorithms (distance vector, 6th

link state).
47 TCP/UDP and sockets, congestion 3-5
control. Application layer protocols
(DNS, SMTP, POP, FTP, HTTP).
Basics of Wi-Fi.
48 Network security: authentication, Cryptogra 1-5
basics of public key and private key phy and
cryptography, digital signatures and 7th
Network
certificates, firewalls. Security