2290 Questions on GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS) with Detailed Explanations and Solutions
Access detailed explanations (illustrated with images and videos) to 2290 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions below. 3 Year Validity- Access Unlimited Times on Unlimited Devices.
View Sample Explanation or View Features.
Rs. 600.00 -OR-
How to register? Already Subscribed?
There are 2290 questions on GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS) (topic-wise breakup given below). You can browse questions topic-wise below (recommended), or start browsing randomly across topics, or view previously Flagged🏁, Skipped↷, or Incorrect✗ questions.
Set Theory & Algebra (98)
StartGraph Theory (62)
- Connectivity (18)
- Spanning Trees (14)
- Cut Vertices & Edges (17)
- Matching (11)
- Colorings (1)
- Planarity (1)
Linear Algebra (5)
StartDigital Logic (83)
- Logic Functions (2)
- Minimization (2)
- Design and Synthesis of Combinational and Sequential Circuits (47)
- Number Representation and Computer Arithmetic (32)
Computer Organization and Architecture (147)
- Machine Instructions and Addressing Modes (64)
- ALU and Data-Path (18)
- CPU Control Design (13)
- Memory Interface (37)
- Instruction Pipelining, Cache and Main Memory (5)
- Input-Output Interface (Interrupt and DMA Mode) (1)
- Secondary Storage (9)
Programming and Data Structures (372)
- Programming in C (170)
- Functions (6)
- Recursion (1)
- Parameter Passing (14)
- Scope (4)
- Binding (6)
- Abstract Data Types (28)
- Arrays (15)
- Stacks (14)
- Queues (16)
- Linked Lists (9)
- Trees (78)
- Binary Search Trees (8)
- Binary Heaps (3)
Algorithms (115)
- Analysis (51)
- Asymptotic Notation (7)
- Notions of Space and Time Complexity (1)
- Worst and Average Case Analysis (1)
- Greedy Approach (8)
- Dynamic Programming (3)
- Divide-And-Conquer (1)
- Tree and Graph Traversals (7)
- Spanning Trees (3)
- Shortest Paths (2)
- Hashing (17)
- Sorting (11)
- Searching (1)
- Asymptotic Analysis of Time and Space (1)
- Upper and Lower Bounds (1)
Theory of Computation (91)
- Regular Languages and Finite Automata (41)
- Context Free Languages and Push-Down Automata (43)
- Recursively Enumerable Sets and Turing Machines (6)
- Undecidability (1)
Compiler Design (56)
- Lexical Analysis (14)
- Parsing (17)
- Syntax Directed Translation (3)
- Runtime Environments (13)
- Intermediate and Target Code Generation (5)
- Basics of Code Optimization (4)
Operating System (327)
- Processes (116)
- Threads (17)
- Inter-Process Communication (1)
- Concurrency (18)
- Synchronization (2)
- Deadlock (46)
- CPU Scheduling (27)
- Memory Management and Virtual Memory (76)
- File Systems (22)
- Input-Output Systems (1)
- Protection and Security (1)
Databases (265)
- ER-Model (22)
- Relational Model (115)
- Database Design (44)
- Query Languages (50)
- File Structures (14)
- Transactions and Concurrency Control (20)
Information Systems and Software Engineering (264)
- Information Gathering (25)
- Requirement and Feasibility Analysis (15)
- Data Flow Diagrams (2)
- Process Specifications (1)
- Input-Output Design (3)
- Process Life Cycle (15)
- Planning and Managing the Project (20)
- Design (92)
- Coding (8)
- Testing (70)
- Maintenance (13)
Computer Networks (263)
- ISO-OSI Stack (54)
- LAN Technologies (Ethernet, Token Ring) (43)
- Flow and Error Control Techniques (18)
- Routing Algorithms (49)
- Congestion Control (2)
- TCP-UDP and Sockets (3)
- IP(V4) (7)
- Application Layer Protocols (25)
- Basic Concepts of Hubs (8)
- Switches (6)
- Gateway (2)
- Routers (3)
- Network Security - Public Key and Private Key Cryptography (38)
- Digital Signature (1)
- Firewalls (4)