Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Table of contents
1.
Introduction
2.
General Aptitude Syllabus
3.
CSE/IT Syllabus
4.
Frequently Asked Questions
5.
Conclusion
Last Updated: Mar 27, 2024
Easy

# Gate Syllabus CSE

Aditi
2 upvotes
Leveraging ChatGPT - GenAI as a Microsoft Data Expert
Speaker
Prerita Agarwal
Data Specialist @
23 Jul, 2024 @ 01:30 PM

## Introduction

IIT, Kharagpur, has released the gate CSE syllabus for 2022. There is no change in the gate syllabus with respect to the previous year, i.e., Gate CSE 2021.

There are two parts of the Gate CSE syllabus

1. GA - General Aptitude (15 marks)
2. CS/IT - Computer Science and Information Technology general subjects (85 marks)

## General Aptitude Syllabus

Verbal Aptitude :

Parts of speech like tenses, articles, prepositions, adjectives, etc.

Vocabulary: words, idioms, and phrases in reading and comprehension, narrative sequencing.

Data Interpretation and Quantitative Aptitude :

Data graphs, 2-D and 3-D plots, maps, and tables.

Numerical computation and estimation include ratios, powers, exponents and logarithms, percentages, series, permutations, and combinations.

Elementary statistics and probability, geometry, and mensuration.

Analytical Aptitude Logic :

Analogy, deduction and induction, numerical relations, and reasoning.

Spatial Aptitude and Transformation of Shapes:

Scaling, rotation, mirroring, translation, assembling, and grouping

Paper folding and cutting, 2 and 3 dimensions patterns.

Get the tech career you deserve, faster!
Connect with our expert counsellors to understand how to hack your way to success
User rating 4.7/5
1:1 doubt support
95% placement record
Akash Pal
Senior Software Engineer
326% Hike After Job Bootcamp
Himanshu Gusain
Programmer Analyst
32 LPA After Job Bootcamp
After Job
Bootcamp

## CSE/IT Syllabus

This part is divided into the following ten sections:-

Section 1: Engineering Mathematics

1. Discrete Mathematics
Propositional and first-order logic
Sets, relations, functions, partial orders and lattices, Monoids,  Groups.
Graphs: connectivity, matching, coloring.
Combinatorics:  counting, recurrence relations, generating functions.

2. Linear Algebra
Matrices and determinants
System of linear equations,
Eigenvalues and eigenvectors,
LU decomposition.

3. Calculus
Limits, continuity and differentiability
Maxima and minima
Mean value theorem.
Integration.

1. Probability and Statistics
Random variables.
Uniform, normal, exponential, Poisson, and binomial distributions.
Mean, median, mode, and standard deviation.
Conditional probability and  Bayes theorem.

Section 2: Digital Logic

1. Boolean algebra.
2. Combinational and sequential circuits.
3. Minimization.
4. Number representations and computer arithmetic (fixed and floating-point).

Section 3: Computer Organization and Architecture

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

Section 4: Programming and Data Structures

1. Programming in C.
2. Recursion.
3. Arrays, stacks, queues,
4. Linked lists, trees, binary search trees, binary heaps,
5. Graphs.

Section 5: Algorithms

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

Section 6: Theory of Computation

1. Regular expressions and finite Automata
2. Context-free grammars and push-down automata.
3. Regular and context-free languages, pumping lemma.
4. Turing machines and undecidability.

Section 7: Compiler Design

1. Lexical Analysis, parsing, syntax-directed translation.
2. Runtime environments.
3. Intermediate code generation.
4. Local optimization,  Data flow analyses:  constant propagation,  liveness analysis, common subexpression elimination.

Section 8: Operating System

1. System calls, processes, threads, inter-process communication, concurrency, and synchronization.
2. Deadlock.
3. CPU and I/O scheduling.
4. Memory management and virtual memory.
5. File systems.

Section 9: Databases

1. ER-model.
2. Relational model: relational algebra, tuple calculus, SQL.
3. Integrity constraints, normal forms.
4. File organization, indexing (e.g., B and B+ trees).
5. Transactions and concurrency control.

Section 10: Computer Networks

1. Concept of layering: OSI and TCP/IP Protocol Stacks;
2. Basics of the packet, circuit, and virtual circuit-switching;
3. Data Link  layer:  framing,  error  detection,  Medium Access  Control,  Ethernet  bridging;
4. Routing protocols: shortest path, flooding, distance vector, and link-state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT);
5. Transport layer: flow control and congestion control, UDP, TCP, sockets;
6. Application layer protocols: DNS, SMTP, HTTP, FTP, Email.
7. You can read related articles such as Congestion Control in Computer Networks here.

## Frequently Asked Questions

1. What is the duration of the gate exam?
The duration of the gate exam is 3 hours.

2. What is the total number of questions and full marks in the paper?
There are a total of 65 questions comprising 100 marks.

3. Is it beneficial for the computer science students to give the gate exam?
Yes, it will be beneficial only if you want to do higher education, i.e., for MTech or ME.

4. What is the mode of the exam?
Gate exam is held in online mode.

## Conclusion

In this article, we have extensively discussed the gate syllabus for CSE 2022. The gate exam syllabus is mainly divided into aptitude and CSE core subjects. We hope that this blog has helped you enhance your knowledge regarding the gate exam syllabus. Do upvote our blog to help other ninjas grow. Happy Coding!

Live masterclass