— Computer Science Engineering (CS) —
–Computer Science Engineering (CS)–
Candidate qualifying for GATE Exam 2022/2023 in Computer Science Engineering stream, can secure an admission in IITs/IISc and explore career opportunity in PSU Jobs.Aspirants of Gate Computer Science i.e. those who are appearing for GATE 2022 Computer Science Engineering Exam, are required to understand syllabus thoroughly before starting preparation.
Engineering Mathematics
Calculus
- Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
Linear Algebra
- Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
Probability and Statistics
- Random variables. Uniform, normal, exponential, Poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
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.
Computer Science and Information Technology
Digital Logic
- Boolean algebra. Combinational and sequential circuits. Minimization. Number representationsand computer arithmetic (fixed and floating point).
Theory of Computation
- Regular expressions and finite automata. Context-free grammars and push-down automata. Regularand contex- free languages, pumping lemma. Turing machines and undecidability.
Programming and Data Structures
- Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees,binary heaps, graphs.
Algorithms
- Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm designtechniques: greedy, dynamic programming and divide‐and‐conquer. Graph traversals, minimum spanning trees, shortest paths.
Databases
- ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normalforms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.
Compiler Design
- Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediatecode generation. Local optimisation, Data flow analyses: constant propagation, liveness analysis, common subexpression elimination.
Operating System
- System calls, processes, threads, inter‐process communication, concurrency and synchronization.Deadlock. CPU and I/O scheduling. Memory management and virtual memory. File systems.
Computer Organization and Architecture
- Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining, pipeline hazards. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).
Computer Networks
- Concept of layering: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit-switching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging; 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); Transport layer: flow control and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email.
Change in syllabus 2022
| Removed topic | Added topic | Removed topic | Added topic |
|---|---|---|---|
| Section 1: Engineering mathematics
Discrete Mathematics: NA Linear Algebra: NA Linear Algebra: NA Probability and Statistics: NA |
Section 1: Engineering mathematics
Discrete Mathematics: Monoids Linear Algebra: NA Calculus: NA Probability and Statistics: NA |
Section 2: Digital Logic:NA | Section 2:Digital Logic:NA |
| Section 3: Computer Organisation and Architecture:NA | Section 3:Computer Organisation and Architecture:Pipeline Hazards | Section 4:Programming and Data Structure:NA | Section 4: Programming and Data Structure:NA |
| Section 5: Algorithms:NA | Section 5: Algorithms:NA | Section 6: Theory of Computation:NA | Section 6: Theory of Computation:NA |
| Section 7: Compiler Design:NA | Section 7: Compiler Design:Local optimisation, Data flow analyses: constant propagation, liveness analysis, common subexpression
elimination. |
Section 8: Operating system:NA | Section 8: Operating system:System Calls, I/O Scheduling |
| Section 9: Database:NA | Section 9: Database:NA | Section 10: Computer Networks:IPv6
LAN Technologies Application Layer Protocol: POP Basics of Wi-Fi Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.
|
Section 10: Computer Networks:
Concepts of Layering: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit-switching Data Link Layer: Framing, Error Detection, Medium Access Control, Ethernet Bridging Routing Protocols: Shortest Path, Flooding, Distance Vector and Link State Routing; Fragmentation and IP addressing, CIDR notation Basics of IP support Protocols 9ARP, DHCP, ICMP), Network Address Translation (NAT) Transportation Layer: Flow Control Application Layer protocols: Email |