GATE 2023 Computer Science and Information Technology -

Introduction

Welcome to the world of GATE Computer Science! The Graduate Aptitude Test in Engineering (GATE) is an esteemed examination that serves as a gateway for aspiring individuals seeking admission to postgraduate programs in computer science and related fields. Designed to evaluate the comprehensive understanding of core subjects, GATE Computer Science assesses candidates’ knowledge in areas like algorithms, data structures, programming languages, databases, computer networks, and theory of computation, among others.

GATE Computer Science is conducted jointly by the Indian Institutes of Technology (IITs) and the Indian Institute of Science (IISc) on behalf of the National Coordination Board (NCB). The exam follows a standardized format and rigorous evaluation process, making it a crucial benchmark for assessing a candidate’s proficiency in computer science concepts. It not only opens doors to pursue advanced studies in leading institutions but also plays a pivotal role in various public and private sector job recruitments, research fellowships, and scholarship opportunities.

Computer Science Subject Code: CS

Computer Science Syllabus GATE 2023

Engineering Mathematics

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.

Linear Algebra

Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.

Calculus

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.

Digital Logic

Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).

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).

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 design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph traversals, minimum spanning trees, shortest paths

Theory of Computation

Regular expressions and finite automata. Context-free grammars and push-down automata, Regular and contex-free languages, pumping lemma. Turing machines and undecidability.

Compiler Design

Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code 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.

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.

Computer Networks

Concept of layering: OSI and TCP/IP Protocol Stacks; Basics of packet,circuit and virtual circuitswitching; 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.

GATE Computer Science Engineering Result analysis

GATE Computer Science topper score by year

Year	Papers	Marks	Score
2022	GATE Computer Science	83.33	1000
2021	GATE Computer Science	84	1000
2020	GATE Computer Science	81	1000
2019	GATE Computer Science	88.67	1000
2018	GATE Computer Science	83.33	1000
2017	GATE Computer Science	86.38	1000

GATE Computer Science cut-off by year

Year	General	OBC	SC/ ST/ PH
2022	25	22.5	16.6
2021	26.1	17.4	23.4
2020	28.5	25.6	19.0
2019	29.5	26.6	19.7
2018	25	22.5	16.6
2017	25	22.5	16.6

Number of students appearing for GATE Computer Science Engineering Exam

Year	Registered candidates	Candidates appeared	Qualified candidates
2022	115458	77257	12725
2021	–	101,922	_
2020	122552	_	97481
2019	124984	99932	–
2018	_	107893	–
2017	1,31,803	_	15,207