IMPORTANT: GATE Exam Preparation is an independent, privately developed study app. It is NOT affiliated with, endorsed by, authorized by, or representing IITs, IISc, any government body, examination authority, or official board. All content is for practice purposes only.
GATE CS Exam Preparation
A study app for the Graduate Aptitude Test in Engineering โ Computer Science and Information Technology. The GATE CS paper is 180 minutes, 65 questions, in two formats: Multiple Choice Questions (MCQ) and Numerical Answer Type (NAT). MCQ carries negative marking (โ1/3 for 1-mark questions, โ2/3 for 2-mark questions). NAT has no negative marking. The app covers all question types, all CS subjects and Engineering Mathematics.
Computer Science Subjects
Data Structures and Algorithms: arrays, stacks, queues, linked lists, binary trees, BST, AVL trees, B-trees, heaps, hash tables, graphs and tries. Sorting (merge, quick, heap, counting), divide and conquer, greedy methods, dynamic programming, graph algorithms (BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Prim, Kruskal) and algorithm complexity analysis using the Master Theorem.
Theory of Computation: DFA and NFA construction and minimisation, regular expressions and the pumping lemma for regular languages, pushdown automata, context-free grammars, the pumping lemma for CFLs, Turing machines, decidability and undecidability.
Operating Systems: CPU scheduling (FCFS, SJF, Round Robin, Priority), process synchronisation using semaphores and monitors, deadlock detection and the Banker's algorithm, paging and segmentation, TLB operation, virtual memory and page replacement (LRU, FIFO, Optimal).
Database Management Systems: ER model and ER-to-relational mapping, relational algebra, SQL (joins, aggregation, subqueries, correlated queries), functional dependencies, Armstrong's axioms, normalisation from 1NF to BCNF, transaction ACID properties, two-phase locking, timestamp ordering, B-tree and B+-tree indexing.
Computer Networks: OSI and TCP/IP models, data link layer error detection (CRC, Hamming code), MAC protocols (CSMA/CD, CSMA/CA), IPv4 addressing and subnetting, distance-vector and link-state routing, OSPF, TCP connection management (three-way handshake), flow control (sliding window) and congestion control.
Computer Organisation and Architecture: Boolean algebra, combinational and sequential circuits, IEEE 754 floating-point representation, instruction pipelining and hazards (structural, data and control), forwarding paths, cache memory design (direct-mapped, set-associative, fully-associative), cache replacement policies.
Engineering Mathematics: Linear Algebra (matrices, determinants, eigenvalues and eigenvectors), Calculus (limits, derivatives, integration), Probability (Bayes' theorem, distributions), Statistics, and Discrete Mathematics (propositional and first-order logic, sets, relations, functions, combinatorics, graph theory).
General Aptitude: Verbal Ability (grammar, vocabulary, reading comprehension) and Quantitative Aptitude (numerical reasoning, data interpretation) as tested in the GATE General Aptitude section.
Mock Tests and Practice Questions
Full-length 65-question mock tests with MCQ and NAT questions, the exact GATE negative marking scheme and a 180-minute timer. Topic-wise practice question sets across all CS subjects and Engineering Mathematics at both 1-mark and 2-mark difficulty levels.
Study Plan and Progress Tracking
Personalised weekly study schedule generated from your subject-level accuracy and your exam date. Track topic-wise accuracy across all CS subjects and identify which sub-topics need the most revision before the paper.
For official GATE information: https://gate2026.iitr.ac.in
โ ๏ธ FINAL DISCLAIMER
GATE Exam Preparation is an independent platform and not an official government app. Exam names are used only to describe the scope of content covered in the app.