GATE 2021 syllabus for Computer Science and Information Technology (CS) gives you details of the latest GATE syllabus for the subject release by the official gate organizing institute IIT Bombay for the year 2021. We also created an easy to use ad-free mobile app for GATE syllabus, previous year papers with keys, gate calculator, virtual calculator, and more. Download iStudy App for all GATE preparation needs.
You will also find IIT GATE college predictor, NIT GATE college predictor, GATE score calculator and GATE Exam Info & Stats useful during GATE preparation. Without further due let’s jump into the GATE syllabus for Computer Science and Information Technology.
GATE 2021 Syllabus – Computer Science and Information Technology (CS)
Section l: Engineering 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.
Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
Probability and Statistics
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, pipeline hazards. 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 traversals, 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. Local optimization, Data flow analyses; constant propagation, liveness analysis, common subexpression elimination.
Section 8: 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.
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
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.
GENERAL APTITUDE (Common for all branches)
Basic English Grammar
Tenses, articles, adjectives, prepositions, conjunctions, verb-noun agreement, and other parts of speech
Words, idioms, and phrases in context
Reading and Comprehension
Data graphs (bar graphs, pie charts, and other graphs representing data), 2- and 3-dimensional plots, maps, and tables
Numerical Computation and Estimation
Ratios, percentages, powers, exponents and logarithms, permutations and combinations, and series
Mensuration and Geometry
Elementary Statistics and Probability
Deduction and Induction
Numerical Relations and Reasoning
Transformation of Shapes
Translation, rotation, scaling, mirroring, assembling, and grouping
Paper folding, cutting, and patterns in 2 and 3 dimensions
InI India has tons of information for M.Tech Admissions in IITs, NITs, IIITs, and other state-level institutes. Do benefit from the content and also share it with your friends. If you want to discuss things with friends do check our communities, All Q&A about GATE Preparation and M.Tech Admissions.
We wish you great luck with GATE preparations.