Previous Year Questions
|
GATE General Aptitude PYQs - 2024
4 pages
|
|
|
GATE General Aptitude PYQs - 2023
5 pages
|
|
|
GATE General Aptitude PYQs - 2022
5 pages
|
|
|
GATE General Aptitude PYQs - 2021
5 pages
|
|
|
GATE General Aptitude PYQs - 2020
3 pages
|
|
|
GATE General Aptitude PYQs - 2019
5 pages
|
|
Previous Year Questions: (General Aptitude for GATE)
|
Previous Year Questions: General Aptitude - 1
61 pages
|
|
|
Previous Year Questions: General Aptitude - 2
16 pages
|
|
|
Previous Year Questions: General Aptitude -3
23 pages
|
|
Formula Sheet
|
Important Formulas of General Aptitude for GATE Exam
28 pages
|
|
Practice Tests for General Aptitude
|
Practice Questions for General Aptitude (GATE)
4 pages
|
|
Toppers Handwritten Notes
|
Handwritten Notes: Number System
15 pages
|
|
|
Handwritten Notes: Time and Work Calendar
4 pages
|
|
|
Handwritten Notes: Set theory
7 pages
|
|
|
Handwritten Notes: Time and Work
15 pages
|
|
|
Handwritten Notes: Profit and Loss
13 pages
|
|
|
Handwritten Notes: Speed, Time & Distance
7 pages
|
|
|
Handwritten Notes: Circular Races
4 pages
|
|
|
Handwritten Notes: Clock
4 pages
|
|
|
Handwritten Notes: Aptitude and Reasoning
26 pages
|
|
|
Handwritten Notes: Data Interpretation
6 pages
|
|
|
Handwritten Notes: Simple Interest & Compound Interest
30 pages
|
|
Paper Folding and Cutting
|
Overview: Paper Folding Method
1 page
|
|
Complete Spatial Aptitude
Basic Concepts of OS
|
Introduction of Operating System
7 pages
|
|
|
PPT: Basic Concepts of OS
6 pages
|
|
|
Functions of Operating System
4 pages
|
|
|
Types of Operating Systems
8 pages
|
|
|
Dual Mode of Operations
2 pages
|
|
|
Need & Functions of Operating Systems
4 pages
|
|
|
Mind Map: Basic Concepts of OS
1 page
|
|
|
Short Notes: Basic Concepts of OS
2 pages
|
|
|
Handwritten notes: Basic Concepts of OS
8 pages
|
|
Process Management
|
Introduction to Process Management
4 pages
|
|
|
Short Notes: Processes Managements - Process and Threads
5 pages
|
|
|
PPT: Process Management
7 pages
|
|
|
Process Scheduler & States of a Process
5 pages
|
|
|
Process Control Block (PCB)
8 pages
|
|
|
Difference Between Dispatcher & Scheduler
2 pages
|
|
|
Mind Map: Process Management
1 page
|
|
|
Formula Sheets: Process Management
2 pages
|
|
|
Handwritten notes: Process Management
3 pages
|
|
Threads
|
Threads & Its Types - User Level Thread & Kernel Level Thread
3 pages
|
|
|
Process-Based & Thread-Based Multitasking
1 page
|
|
|
Microkernel & Monolithic Kernel
4 pages
|
|
|
Difference between Multiprogramming, Multitasking, Multithreading & Multiprocessing
9 pages
|
|
|
Formula Sheets: Threads
2 pages
|
|
|
Handwritten notes: Threads
2 pages
|
|
CPU Scheduling
|
Introduction to Preemptive & Non-Preemptive Scheduling
2 pages
|
|
|
Short Notes: T6-Process Management - CPU Scheduling
5 pages
|
|
|
Introduction to CPU Scheduling
6 pages
|
|
|
PPT: CPU Scheduling
8 pages
|
|
|
FCFS CPU Scheduling
4 pages
|
|
|
Priority CPU Scheduling
9 pages
|
|
|
Round Robin Scheduling
4 pages
|
|
|
Shortest Job First (or SJF) CPU Scheduling
9 pages
|
|
|
Shortest Remaining Time First (SRTF) CPU Scheduling Algorithm
2 pages
|
|
|
Longest Remaining Time First (LRTF) CPU Scheduling Algorithm
2 pages
|
|
|
Longest Job First (LJF) CPU Scheduling Algorithm
3 pages
|
|
|
Highest Response Ratio Next (HRRN) Scheduling Algorithm
6 pages
|
|
|
Multilevel Queue (MLQ) CPU Scheduling
5 pages
|
|
|
Multiple-Processor Scheduling
5 pages
|
|
|
Measure the Time Spent in Context Switch
2 pages
|
|
|
Mind Map: CPU Scheduling
1 page
|
|
|
Formula Sheets: CPU Scheduling
2 pages
|
|
|
Handwritten notes: CPU Scheduling
4 pages
|
|
Process Synchronization
|
Short Notes: Inter-Process Communication
1 page
|
|
|
Short Notes: Process Management - Synchronization
9 pages
|
|
|
Inter Process Communication (IPC)
11 pages
|
|
|
Process Synchronization & Critical Section
9 pages
|
|
|
Inter Process Communication Using Message Queues & Shared Memory
2 pages
|
|
|
Methods in Interprocess Communication
1 page
|
|
|
Hardware Synchronization Algorithms: Unlock & Lock, Test & Set, Swap
4 pages
|
|
|
Notes: Semaphores
9 pages
|
|
|
Mutex Vs Semaphores
4 pages
|
|
|
Peterson’s Algorithm
5 pages
|
|
|
Readers-Writers Problem
4 pages
|
|
|
Producer Consumer Problem
1 page
|
|
|
Sleeping Barber problem
2 pages
|
|
|
Lamport's Bakery Algorithm
3 pages
|
|
|
Dekker’s Algorithm
9 pages
|
|
|
Dining Philosophers Problem
7 pages
|
|
|
Deadlock, Starvation and Livelock
2 pages
|
|
|
Mind Map: Process Synchronization
1 page
|
|
|
Formula Sheets: Process Synchronization
2 pages
|
|
|
Handwritten notes: Process Synchronization
15 pages
|
|
|
PPT: Process Synchronization
15 pages
|
|
Concurrency & Deadlock
|
Notes: Concurrency
3 pages
|
|
|
Short Notes: Process Management - Deadlock
4 pages
|
|
|
Short Notes: Process Management - Concurrency
4 pages
|
|
|
Resource Allocation Graph (RAG) in Operating System
3 pages
|
|
|
The Fork & Join Constructs
1 page
|
|
|
Parbegin/Parend Concurrent statement
1 page
|
|
|
Banker’s Algorithm
4 pages
|
|
|
Deadlock Detection Algorithm
2 pages
|
|
|
Resource Allocation Techniques for Processes
1 page
|
|
|
Mind Map: Concurrency & Deadlock
1 page
|
|
|
Handwritten notes: Concurrency & Deadlock
3 pages
|
|
Memory Management
|
Allocating Kernel Memory
5 pages
|
|
|
Logical (Virtual) Vs Physical Address Space
6 pages
|
|
|
Short Notes: Memory Management and Virtual Memory
10 pages
|
|
|
Notes: Segmentation
3 pages
|
|
|
Partition Allocation Methods
7 pages
|
|
|
Requirements of Memory Management System
4 pages
|
|
|
Mind Map: Memory Management
1 page
|
|
|
Formula Sheets: Memory Management
2 pages
|
|
|
Handwritten notes: Memory Management
9 pages
|
|
|
PPT: Memory Management
15 pages
|
|
Virtual Memory
|
Virtual Memory (Overview)
5 pages
|
|
|
Page Replacement Algorithm - 1
10 pages
|
|
|
Page Replacement Algorithm - 2
4 pages
|
|
|
Allocation of Frames
2 pages
|
|
|
Thrashing & Spooling
7 pages
|
|
|
Overlays in Memory Management
3 pages
|
|
|
Mind Map: Virtual Memory
1 page
|
|
|
Formula Sheets: Virtual Memory
2 pages
|
|
|
Handwritten notes: Virtual Memory
6 pages
|
|
File Systems
|
Introduction to File Systems
4 pages
|
|
|
Short Notes: Operating System - File Systems
4 pages
|
|
|
FIle Access & Allocation Methods
6 pages
|
|
|
Structures of Directory
5 pages
|
|
|
Free Space Management
7 pages
|
|
|
Spooling & Buffering
3 pages
|
|
|
Disk Scheduling Algorithms
7 pages
|
|
|
Mind Map: File Systems
1 page
|
|
|
Formula Sheets: File Systems
2 pages
|
|
|
Handwritten notes: File Systems
6 pages
|
|
Disk Scheduling
|
Disk Scheduling Algorithms
7 pages
|
|
|
Spooling & Buffering
3 pages
|
|
|
Mind Map: Input / Output System
1 page
|
|
|
Handwritten notes: Input / Output System
13 pages
|
|
Introduction
|
Introduction of DBMS (Database Management System)
6 pages
|
|
|
DBMS Architecture
2 pages
|
|
|
PPT: Introduction
9 pages
|
|
|
Introduction: Database Management System (DBMS)
1 page
|
|
|
Short Notes: Introduction
2 pages
|
|
ER Model
|
Short Notes: ER Model
4 pages
|
|
|
Mind Map: ER Model
1 page
|
|
|
Handwritten notes: ER Model- 1
9 pages
|
|
|
Handwritten notes: ER Model- 1
9 pages
|
|
Concept of keys
|
Entity, Sets & Keys
9 pages
|
|
|
Short Notes: Concept of keys
2 pages
|
|
|
PPT: Concept of keys
11 pages
|
|
Relational Algebra
|
Introduction to Relation Model
6 pages
|
|
|
Anomalies & Constraint in Relational Model
4 pages
|
|
|
Short Notes: Relational Model
2 pages
|
|
|
Operators in Relational Algebra
5 pages
|
|
|
Relational Algebra
1 page
|
|
|
Relational Calculus
2 pages
|
|
|
Formula Sheets: Relational Algebra
2 pages
|
|
|
Handwritten notes: Relational Algebra
26 pages
|
|
Database Design (Integrity Constraints, Normalization)
|
Database Normalization
8 pages
|
|
|
Short Notes: Database Design
4 pages
|
|
|
Functional Dependency
8 pages
|
|
|
Number of Possible Super Keys in DBMS
4 pages
|
|
|
Lossless Decomposition
7 pages
|
|
|
Finding Highest Normal Form
6 pages
|
|
|
Equivalence of Functional Dependencies
5 pages
|
|
|
Canonical Cover of Functional Dependencies in DBMS
4 pages
|
|
|
Denormalization in Databases
1 page
|
|
|
Introduction of 4th & 5th Normal Form
4 pages
|
|
|
Redundancy in Databases
3 pages
|
|
|
PPT: Database Design (Integrity Constraints, Normalization)
55 pages
|
|
|
Formula Sheets: Database Design (Integrity Constraints, Normalization)
2 pages
|
|
|
Handwritten notes: Database Design (Integrity Constraints, Normalization)
53 pages
|
|
SQL
|
Structured Query Language (SQL)
4 pages
|
|
|
Having vs Where Clause in SQL
3 pages
|
|
|
Database Objects in DBMS
4 pages
|
|
|
DDL, DQL, DML, DCL & TCL Commands
3 pages
|
|
|
Nested Subqueries in SQL
4 pages
|
|
|
Formula Sheets: SQL
2 pages
|
|
|
Handwritten notes: SQL
20 pages
|
|
File Organization & Indexing
|
Indexing in Databases
4 pages
|
|
|
File Organization
10 pages
|
|
|
Short Notes: File Organization
5 pages
|
|
|
RAID (Redundant Arrays of Independent Disks)
4 pages
|
|
|
Formula Sheets: File Organization & Indexing
2 pages
|
|
|
Handwritten notes: File Organization & Indexing
23 pages
|
|
Transaction & Concurrency Control
|
Introduction to Timestamp & Deadlock Prevention Schemes
6 pages
|
|
|
Concurrency Control in DBMS
4 pages
|
|
|
Short Notes: Transactions and Concurrency Control
11 pages
|
|
|
Database Recovery Techniques
9 pages
|
|
|
Need for Recovery
2 pages
|
|
|
Transaction Isolation Levels
2 pages
|
|
|
Types of Schedules
5 pages
|
|
|
Types of Schedules based Recoverability
1 page
|
|
|
Conflict Serializability
3 pages
|
|
|
Precedence Graph For Testing Conflict Serializability
3 pages
|
|
|
Recoverability of Schedules
2 pages
|
|
|
Deadlock & Starvation
5 pages
|
|
|
Lock Based Concurrency Control Protocol
4 pages
|
|
|
Two Phase Locking Protocol
7 pages
|
|
|
Thomas Write Rule & Timestamp based Concurrency Control
5 pages
|
|
|
Multiple Granularity Locking
4 pages
|
|
|
Graph Based Concurrency Control Protocol
2 pages
|
|
|
Formula Sheets: Transaction & Concurrency Control
2 pages
|
|
|
Handwritten notes: Transaction & Concurrency Control
44 pages
|
|
Networking Fundamentals & Physical Layer
|
Network Topologies
4 pages
|
|
|
Short Notes: Concept of Layering
5 pages
|
|
|
Building a Computer Network
1 page
|
|
|
Short Notes: Flow and Error Control Techniques
9 pages
|
|
|
Types of Transmission media
3 pages
|
|
|
Transmission Modes in Computer Networks
2 pages
|
|
|
Redundant Link Problems
1 page
|
|
|
Flow Control Link Layer
3 pages
|
|
|
Framing in Computer Networks
2 pages
|
|
|
Requirements of Computer Networks
9 pages
|
|
|
Internet Architecture
1 page
|
|
|
Error Detection & Correction: Its Types
8 pages
|
|
|
Switching Techniques
6 pages
|
|
|
Network Performance Parameters
2 pages
|
|
|
Important Short Questions & Answers - Fundamentals & Link Layer
6 pages
|
|
|
PPT: Fundamentals of Computer Networks
15 pages
|
|
|
Mind Map: Networking Fundamentals & Physical Layer
1 page
|
|
|
Formula Sheets: Networking Fundamentals & Physical Layer
2 pages
|
|
|
Handwritten notes: Networking Fundamentals & Physical Layer
26 pages
|
|
Data Link Layer
|
Flow Control Link Layer
3 pages
|
|
|
Short Notes: LAN Technologies (Ethernet)
8 pages
|
|
|
Stop & Wait Protocol
3 pages
|
|
|
Sliding Window Protocol
2 pages
|
|
|
Media Access Protocols
10 pages
|
|
|
PPT: Data Link Layer
40 pages
|
|
|
PPT: Media Access Control
46 pages
|
|
|
Media Access Control
4 pages
|
|
|
Error Detection & Correction: Its Types
8 pages
|
|
|
Switching & Bridging
3 pages
|
|
|
Important Short Questions & Answers: Media Access & Internetworking
4 pages
|
|
|
Peer-to-Peer File Sharing
3 pages
|
|
|
Program to calculate Round Trip Time
2 pages
|
|
|
Mind Map: Data Link Layer
1 page
|
|
|
Formula Sheets: Data Link Layer
2 pages
|
|
|
Handwritten notes: Data Link Layer
3 pages
|
|
Transport Layer
|
Overview of Transport Layer
5 pages
|
|
|
PPT: Transport Layer
66 pages
|
|
|
UDP (User Datagram Protocol)
6 pages
|
|
|
Short Notes: TCP / UDP and Sockets
4 pages
|
|
|
Differences between TCP and UDP
3 pages
|
|
|
TCP - Reliable Byte Stream
4 pages
|
|
|
Services & Segment Structure in TCP
4 pages
|
|
|
Connection Management
3 pages
|
|
|
TCP Connection Termination
3 pages
|
|
|
Flow Control: Computer Networks
1 page
|
|
|
TCP Congestion Control
2 pages
|
|
|
Congestion Avoidance: DECBIT
1 page
|
|
|
Random Early Detection (RED)
1 page
|
|
|
Quality of Services (QoS)
1 page
|
|
|
Silly Window Syndrome
2 pages
|
|
|
TCP State Diagram
3 pages
|
|
|
Application Requirements
4 pages
|
|
|
Important Short Questions & Answers: Transport Layer
2 pages
|
|
|
IP Version 6 (IPV6)
6 pages
|
|
|
Multiplexing & Demultiplexing
1 page
|
|
|
Mind Map: Transport Layer
1 page
|
|
|
Formula Sheets: Transport Layer
2 pages
|
|
|
Handwritten notes: Transport Layer
9 pages
|
|
Media Access Control (MAC)
|
PPT: Media Access Control
46 pages
|
|
|
Media Access Control
4 pages
|
|
|
Wi-fi Ethernet (802.11)
5 pages
|
|
|
Bluetooth (802.15.1)
2 pages
|
|
|
Switching & Bridging
3 pages
|
|
|
Classless Interdomain Routing (CIDR)
1 page
|
|
|
IP (Internet Protocol)
8 pages
|
|
|
Important Short Questions & Answers: Media Access & Internetworking
4 pages
|
|
|
Mind Map: Media Access Control (MAC)
1 page
|
|
|
Short Notes: Media Access Control (MAC)
2 pages
|
|
|
Formula Sheets: Media Access Control (MAC)
2 pages
|
|
Network Layer
|
IP (Internet Protocol)
8 pages
|
|
|
Address Resolution Protocol (ARP)
1 page
|
|
|
Dynamic Host Configuration Protocol (DHCP)
2 pages
|
|
|
Error Reporting (ICMP)
1 page
|
|
|
Mind Map: Network Layer
1 page
|
|
|
Short Notes: Network Layer
2 pages
|
|
|
Formula Sheets: Network Layer
2 pages
|
|
|
Handwritten notes: Network Layer
17 pages
|
|
|
PPT: Network Layer
14 pages
|
|
Application Layer
|
Short Notes: Basics of Wi-Fi
2 pages
|
|
|
Short Notes: Application Layer Protocols (DNS, SMTP, POP, FTP, HTTP)
4 pages
|
|
|
Electronic Mail (SMTP, POP3, MIME, IMAP)
3 pages
|
|
|
SMTP : Simple Mail Transfer Protocol
4 pages
|
|
|
POP3 (Post Office Protocol) & IMAP(Intermediate Mail Access Protocol)
1 page
|
|
|
MIME (Multipurpose Internet Mail Extension)
1 page
|
|
|
HTTP (Hypertext Transfer Protocol)
2 pages
|
|
|
Web Services: Application Layer
3 pages
|
|
|
Domain Name Service (DNS)
3 pages
|
|
|
SNMP(Simple Network Management Protocol)
2 pages
|
|
|
Important Short Questions & Answers: Application Layer
7 pages
|
|
|
PPT: Application Layer
38 pages
|
|
|
File Transfer Protocol (FTP)
4 pages
|
|
|
Wifi: Basics, WPS, WPA
10 pages
|
|
|
Dynamic Host Configuration Protocol (DHCP)
13 pages
|
|
|
Mind Map: Application Layer
1 page
|
|
|
Formula Sheets: Application Layer
2 pages
|
|
|
Handwritten notes: Application Layer
14 pages
|
|
Routing
|
Short Notes: Network Security
9 pages
|
|
|
Routing Information Protocol (RIP)
1 page
|
|
|
Link State (OSPF)
2 pages
|
|
|
BGB (Broader Gateway Protocol) Interdomain Routing
4 pages
|
|
|
IP Version 6 (IPV6)
6 pages
|
|
|
Multicast Addresses - Routing
1 page
|
|
|
Multicast Routing (DVMRP, PIM)
1 page
|
|
|
DVMRP Distance Vector Multicast Routing Protocol
3 pages
|
|
|
PIM Protocol Independent Multicast
3 pages
|
|
|
Important Questions & Answers: Routing
4 pages
|
|
|
PPT: Introduction to IP Routing Protocols
45 pages
|
|
|
Formula Sheets: Routing
2 pages
|
|
Network Layer and Internetworking
|
Switching & Bridging
3 pages
|
|
|
Short Notes: IPv4 / IPv6
6 pages
|
|
|
Wi-fi Ethernet (802.11)
5 pages
|
|
|
Bluetooth (802.15.1)
2 pages
|
|
|
Classless Interdomain Routing (CIDR)
1 page
|
|
|
IP (Internet Protocol)
8 pages
|
|
|
Address Resolution Protocol (ARP)
1 page
|
|
|
Dynamic Host Configuration Protocol (DHCP)
2 pages
|
|
|
Error Reporting (ICMP)
1 page
|
|
|
Important Short Questions & Answers: Media Access & Internetworking
4 pages
|
|
|
PPT: Internetworking
40 pages
|
|
|
Classful IP Addressing
5 pages
|
|
|
IPv4 Datagram Header
3 pages
|
|
|
Datagram Fragmentation & Delays
1 page
|
|
|
Fragmentation at Network Level
2 pages
|
|
|
IP Addressing: Classless Addressing
2 pages
|
|
|
Unicast, Broadcast & Multicast
1 page
|
|
|
Network Address Translation (NAT)
4 pages
|
|
|
Types of Network Address Translation
3 pages
|
|
Additional Topics for GATE Preparation
|
Data Communication - 1
7 pages
|
|
|
Data Communication - 2
8 pages
|
|
|
Data Communication - 3
8 pages
|
|
|
PPT: Introduction to Data Communications
45 pages
|
|
|
PPT: Data Link Layer
40 pages
|
|
Introduction to Compiler
|
Regular Expressions
3 pages
|
|
|
Phases of a Compiler
10 pages
|
|
|
Symbol Table in Compiler
3 pages
|
|
|
Transition Diagram
1 page
|
|
|
Overview of Language Processing System: Introduction to Compiler Design
3 pages
|
|
|
Error Handling in Compiler Design
3 pages
|
|
|
PPT: Introduction
22 pages
|
|
|
Static & Dynamic Scoping
2 pages
|
|
|
Error detection & Recovery in Compiler
3 pages
|
|
|
Mind Map: Introduction to Compiler
1 page
|
|
|
Handwritten notes: Introduction to Compiler
16 pages
|
|
Lexical Analysis
|
Transition Diagram
1 page
|
|
|
Short Notes: Lexical Analysis
3 pages
|
|
|
Overview of Language Processing System: Introduction to Compiler Design
3 pages
|
|
|
Input Buffer & Lexical Analyzer Generator
2 pages
|
|
|
PPT: Lexical Analysis
51 pages
|
|
|
Formula Sheets: Lexical Analysis
2 pages
|
|
Parsing
|
PPT: Top Down Parsing
27 pages
|
|
|
Short Notes: Parsing
11 pages
|
|
|
Examples: Top Down Parsing
1 page
|
|
|
Top Down Parsing
16 pages
|
|
|
PPT: Bottom Up Parsing
41 pages
|
|
|
Introduction & Difference Between Top Down & Bottom Up Parsing
2 pages
|
|
|
Context-Free Grammars: Definition & Parsing
2 pages
|
|
|
Constructing SLR(1) Parsing Table
2 pages
|
|
|
Operator: Precedence Parsing
1 page
|
|
|
Shift: Reduce Parsing
2 pages
|
|
|
Expression Parsing
2 pages
|
|
|
Top Down Parsing & Bottom Up Parsing
13 pages
|
|
|
PPT: Syntax Analysis
68 pages
|
|
|
Left Factoring & Examples
3 pages
|
|
|
Formula Sheets: Parsing
3 pages
|
|
|
Handwritten notes: Parsing
52 pages
|
|
Syntax Directed Translation
|
Simple Syntax Directed Translator
6 pages
|
|
|
PPT: Syntax Directed Translation
22 pages
|
|
|
Short Notes: Syntax Directed Translation
2 pages
|
|
|
Syntax Definition: Simple Syntax Directed Translation
13 pages
|
|
|
A Translator for Simple Expressions: Simple Syntax Directed Translator
10 pages
|
|
|
Formula Sheets: Syntax Directed Translation
2 pages
|
|
|
Handwritten notes: Syntax Directed Translation
12 pages
|
|
Intermediate Code Generation
|
Intermediate Code Forms
6 pages
|
|
|
PPT: Intermediate Code Generation
42 pages
|
|
|
Short Notes: Syntax Directed Translation
2 pages
|
|
|
Type Checking & Type Expressions: Intermediate Code Generation
3 pages
|
|
|
Syntax Directed Translation
6 pages
|
|
|
Basic Blocks & Flow Graphs
1 page
|
|
|
Directed Acyclic Graph (DAG) in Compiler Design
3 pages
|
|
|
Peephole Optimization in Compiler Design
1 page
|
|
|
Formula Sheets: Intermediate Code Generation
3 pages
|
|
|
Handwritten notes: Intermediate Code Generation
7 pages
|
|
Runtime Environment
|
Short Notes: Runtime Environments
5 pages
|
|
|
Hash Tables & Hash Functions
4 pages
|
|
|
PPT: Run Time Storage Organization
85 pages
|
|
|
Storage Allocation
1 page
|
|
|
Formula Sheets: Runtime Environment
3 pages
|
|
|
Handwritten notes: Runtime Environment
2 pages
|
|
Code Optimization
|
Introduction to Code Optimization
2 pages
|
|
|
Function Preserving Transformations
5 pages
|
|
|
Optimization of Basic Blocks
2 pages
|
|
|
Loops in Flow Graph
4 pages
|
|
|
Peephole Optimization
2 pages
|
|
|
PPT: Code Generation
62 pages
|
|
|
Formula Sheets: Code Optimization
3 pages
|
|
|
Handwritten notes: Code Optimization
7 pages
|
|
Data Flow Analysis
|
Introduction: Data Flow Analysis
3 pages
|
|
|
Common Subexpression Elimination
12 pages
|
|
|
Liveness Analysis
5 pages
|
|
|
Reaching Definition Analysis
3 pages
|
|
Programming in C
|
Introduction: C Language
6 pages
|
|
|
Variables & Keywords in C
8 pages
|
|
|
Short Notes: Introduction to C, Structure of C Programming
7 pages
|
|
|
Short Notes: Introduction to Programming
3 pages
|
|
|
Operators in C-1
22 pages
|
|
|
Operators in C- 2
8 pages
|
|
|
PPT: Programming in C
15 pages
|
|
|
C - Flow Control Statements
6 pages
|
|
|
Scope of Variable
4 pages
|
|
|
Const Qualifier in C
4 pages
|
|
|
Sequence Points in C
2 pages
|
|
|
Relationship between Arrays & Pointers
2 pages
|
|
|
Storage Classes in C
6 pages
|
|
|
Mind Map: Programming in C
1 page
|
|
|
Handwritten notes: Programming in C
85 pages
|
|
Recursion
|
Short Notes: Recursion Verses Iteration
6 pages
|
|
|
Short Notes: Recursion
10 pages
|
|
|
Recursive Functions
9 pages
|
|
|
Mind Map: Recursion
1 page
|
|
|
Formula Sheets: Recursion
2 pages
|
|
|
Handwritten notes: Recursion
32 pages
|
|
Arrays
|
Introduction: Arrays
3 pages
|
|
|
Operation on Arrays
5 pages
|
|
|
Short Notes: Sparse Matrices
1 page
|
|
|
Short Notes: Storage Structure of Arrays
2 pages
|
|
|
Short Notes: Array Using Function
8 pages
|
|
|
Short Notes: Two Dimensional Arrays
9 pages
|
|
|
Short Notes: Arrays
5 pages
|
|
|
Multidimensional Array
2 pages
|
|
|
Passing Array as Function Arguments in C
1 page
|
|
|
Limitations of Array
1 page
|
|
|
Formula Sheets: Arrays
1 page
|
|
|
Handwritten notes: Arrays
24 pages
|
|
Linked Lists
|
Representation & Basic Operations
3 pages
|
|
|
Application of Linked Lists
2 pages
|
|
|
Linked List vs Array
2 pages
|
|
|
Types of Linked Lists
1 page
|
|
|
PPT: Linked Lists
20 pages
|
|
|
Mind Map: Linked Lists
1 page
|
|
|
Short Notes: Linked Lists
2 pages
|
|
|
Formula Sheets: Linked Lists
2 pages
|
|
|
Handwritten notes: Linked Lists
42 pages
|
|
Stacks & Queues
|
Stacks Representation & Operations
3 pages
|
|
|
Short Notes: Queue
2 pages
|
|
|
Short Notes: Stacks
2 pages
|
|
|
Expression Parsing
2 pages
|
|
|
Queues Representation & Operations
3 pages
|
|
|
Implementation of Queue using Stack
24 pages
|
|
|
Double Ended Queue
5 pages
|
|
|
Implement Stack Using Queue
6 pages
|
|
|
Implement Stack Using Array
3 pages
|
|
|
Implement Stack using Linked List
5 pages
|
|
|
Infix, Postfix & Prefix Conversion
4 pages
|
|
|
Implementation & Application of Queue using Array
2 pages
|
|
|
Mind Map: Stacks & Queues
1 page
|
|
|
Formula Sheets: Stacks & Queues
3 pages
|
|
|
Handwritten notes: Stacks & Queues- 1
43 pages
|
|
|
Handwritten notes: Stacks & Queues- 2
33 pages
|
|
|
PPT: Stacks & Queues
18 pages
|
|
Trees
|
Types of Binary Trees
1 page
|
|
|
Insertion & Deletion in Binary Tree
1 page
|
|
|
Array Representation of Binary Trees
1 page
|
|
|
Applications of Tree Data Structure
1 page
|
|
|
Binary Search Tree
6 pages
|
|
|
M-way Search Tree
21 pages
|
|
|
Binary Heap & Heapsort
24 pages
|
|
|
Extended Binary Tree
1 page
|
|
|
Insertion in AVL Tree
2 pages
|
|
|
Deletion in AVL Tree
10 pages
|
|
|
Height of Binary Tree
12 pages
|
|
|
Strictly Binary Tree
5 pages
|
|
|
Short Notes: Trees
2 pages
|
|
|
Formula Sheets: Trees
3 pages
|
|
|
Handwritten notes: Trees
46 pages
|
|
Graphs
|
Representation of Graphs
10 pages
|
|
|
Basic Terminology & Operations
1 page
|
|
|
Floyd Warshall Algorithm
23 pages
|
|
|
Graph Traversal (DFS & BFS)
24 pages
|
|
|
Topological Sorting
10 pages
|
|
|
Short Notes: Graphs
2 pages
|
|
|
Formula Sheets: Graphs
3 pages
|
|
|
Handwritten notes: Graphs
60 pages
|
|
Logic: Deduction and Induction
|
Linear & Circular Arrangement
14 pages
|
|
|
Handwritten Notes: Circular Races
4 pages
|
|
|
Basic Concepts & Types of Questions: Blood Relations
9 pages
|
|
|
Introduction & Examples: Logical Connectives
16 pages
|
|
|
Practice Questions: Seating Arrangements
4 pages
|
|
|
Verification of Truth: Solved Examples
1 page
|
|
Syllogism
|
Overview: Syllogism
8 pages
|
|
|
Syllogism Based Questions
3 pages
|
|
|
Cheatsheet: Syllogisms
2 pages
|
|
Venn Diagram
|
Questions With Answers: Venn Diagrams
7 pages
|
|
|
Concept & Solved Questions: Venn Diagram
9 pages
|
|
Coding Decoding
|
Coding & Decoding
6 pages
|
|
|
Cheatsheet: Coding & Decoding
2 pages
|
|
Analogy
|
Analogy: Solved Examples
1 page
|
|
Numerical relations and reasoning
|
Quantitative Reasoning: Solved Examples
6 pages
|
|
Ranking/Directions Test
|
Important Notes: Order and Ranking
5 pages
|
|
|
Distance and Direction
10 pages
|
|
|
Cheatsheet: Directions
1 page
|
|
|
Cheatsheet: Queues & Ranks
1 page
|
|
Revision Notes
|
Network Topologies
4 pages
|
|
|
Flow & Error Control Technique
5 pages
|
|
|
Congestion Control
1 page
|
|
|
Digital Signatures & Certificates
5 pages
|
|
|
Application layer Protocols
9 pages
|
|
Previous Year Questions: Computer Networks
|
Previous Year Questions: OSI Layer
1 page
|
|
|
Previous Year Questions: Data Link Layer
25 pages
|
|
|
Previous Year Questions: Network Layer Protocol
20 pages
|
|
|
Previous Year Questions: Transport Layer Protocol
21 pages
|
|
|
Previous Year Questions: Application Layer Protocols
10 pages
|
|
|
Previous Year Questions: Network Security
6 pages
|
|
Theory of Computation
|
Regular Expressions & Finite Automata
22 pages
|
|
Algorithms
|
Sorting Algorithms
25 pages
|
|
Programming & Data Structures
Database Management System (DBMS)
Searching & Sorting
|
Linear Search & Binary Search- 1
5 pages
|
|
|
Linear Search & Binary Search- 2
11 pages
|
|
|
Linear Search & Binary Search- 3
10 pages
|
|
|
Sorting Algorithms
25 pages
|
|
|
Searching Algorithms
3 pages
|
|
|
Sorting Algorithms- 1
6 pages
|
|
|
Sorting Algorithms- 2
14 pages
|
|
|
Sorting Algorithms- 3
9 pages
|
|
|
Sorting Algorithms- 4
13 pages
|
|
|
Sorting Algorithms- 5
16 pages
|
|
|
Sorting Algorithms- 6
16 pages
|
|
|
Mind Map: Searching & Sorting
1 page
|
|
|
Formula Sheets: Searching & Sorting
2 pages
|
|
|
Handwritten notes: Searching & Sorting
23 pages
|
|
Hashing
|
Hash Table and STL
4 pages
|
|
|
Short Notes: Hashing
7 pages
|
|
|
Extendible Hashing
6 pages
|
|
|
Formula Sheets: Hashing
2 pages
|
|
|
Handwritten notes: Hashing
15 pages
|
|
Asymptotic Analysis of Algorithms
|
Asymptotic Analysis
3 pages
|
|
|
Short Notes: Space and Time Complexity
6 pages
|
|
|
Solving Recurrences
3 pages
|
|
|
Worst, Average & Best Cases
5 pages
|
|
|
Asymptotic Notations
7 pages
|
|
|
Analysis of Loops
8 pages
|
|
|
Different Types of Recurrence Relations & Their Solutions
2 pages
|
|
|
Formula Sheets: Asymptotic Analysis of Algorithms
2 pages
|
|
|
Handwritten notes: Asymptotic Analysis of Algorithms
27 pages
|
|
Recurrence Relations
|
Different Types of Recurrence Relations & Their Solutions
2 pages
|
|
|
Solving Recurrences
3 pages
|
|
|
Formula Sheets: Recurrence Relations
1 page
|
|
|
Handwritten notes: Recurrence Relations
26 pages
|
|
|
PPT: Recurrence Relations
16 pages
|
|
Divide & Conquer
|
Introduction: Divide & Conquer
5 pages
|
|
|
Short Notes: Algorithms-Divide & Conquer
6 pages
|
|
|
Quick Sort & Merge Sort Comparison
2 pages
|
|
|
Count Inversions in Array
3 pages
|
|
|
Closest Pair of Points
2 pages
|
|
|
Strassen’s Matrix Multiplication
1 page
|
|
|
Divide & Conquer Recurrence Relations
3 pages
|
|
|
K-th Element of Two Sorted Arrays
7 pages
|
|
|
K-th Smallest/Largest element in an Unsorted Array
4 pages
|
|
|
Formula Sheets: Divide & Conquer
2 pages
|
|
|
PPT: Divide & Conquer
13 pages
|
|
Greedy Techniques
|
Activity Selection Problem
4 pages
|
|
|
Short Notes: Shortest Paths
5 pages
|
|
|
Short Notes: Greedy Algorithms (Part-2)
7 pages
|
|
|
Short Notes: Greedy Algorithms (Part-1)
4 pages
|
|
|
Dijkstra’s Shortest Path Algorithm
7 pages
|
|
|
Job Sequencing Problem
1 page
|
|
|
Greedy Algorithm to Find Minimum Number of Coins
1 page
|
|
|
Strongly Connected Components
3 pages
|
|
|
Fractional Knapsack
9 pages
|
|
|
Fractional Knapsack
2 pages
|
|
|
Optimal File Merge Patterns
2 pages
|
|
|
Minimum Spanning Tree
10 pages
|
|
|
Formula Sheets: Greedy Techniques
2 pages
|
|
|
Handwritten notes: Greedy Techniques
31 pages
|
|
|
PPT: Greedy Techniques
14 pages
|
|
Graph Based Algorithms
|
Transitive Closure of a Graph
1 page
|
|
|
Bridges in a graph
1 page
|
|
|
Graph and its representations
2 pages
|
|
|
Directed Acyclic Graphs (DAG)
5 pages
|
|
|
Topological Sorting
2 pages
|
|
|
Bellman-Ford Algorithm
3 pages
|
|
|
Floyd Warshall Algorithm
1 page
|
|
|
Kosaraju using DFS
2 pages
|
|
|
BFS (Breadth-first search) Algorithm
7 pages
|
|
|
Kruskal's Algorithm
5 pages
|
|
|
Formula Sheets: Graph Based Algorithms
2 pages
|
|
|
Handwritten notes: Graph Based Algorithms
60 pages
|
|
Dynamic Programming
|
Longest Common Subsequence
3 pages
|
|
|
Matrix Chain Multiplication
3 pages
|
|
|
Overlapping Subproblems Property in Dynamic Programming
3 pages
|
|
|
Traveling Salesman Problem
5 pages
|
|
|
Subset Sum Problem
2 pages
|
|
|
0-1 Knapsack Problem
3 pages
|
|
|
Dynamic Programming
7 pages
|
|
|
Formula Sheets: Dynamic Programming
2 pages
|
|
|
Handwritten notes: Dynamic Programming
104 pages
|
|
|
PPT: Dynamic Programming
16 pages
|
|
Revision Notes
|
Syntax-Directed Translation
3 pages
|
|
|
Runtime Environments
5 pages
|
|
|
Intermediate Code Generation
2 pages
|
|
Previous Year Questions - (Compiler Design)
|
Previous Year Questions: Lexical Analysis
5 pages
|
|
|
Previous Year Questions: Parsing
32 pages
|
|
|
Previous Year Questions: Syntax-directed Translation
6 pages
|
|
|
Previous Year Questions: Intermediate Code Generation
19 pages
|
|
|
Previous Year Questions: Runtime Environment
5 pages
|
|
|
Previous Year Questions: Matching
1 page
|
|
Introduction to Grammars, Languages & Automata
|
PPT: Introduction & Automata
25 pages
|
|
|
Introduction: Theory of Computation
2 pages
|
|
|
Formal Representation of Languages & Chomsky Hierarchy
7 pages
|
|
|
Recursive Function Theory
10 pages
|
|
|
Relationship Between Grammar & Language in TOC
2 pages
|
|
|
Applications of Automata
1 page
|
|
|
Proving Techniques
5 pages
|
|
|
Computable & Non-Computable Functions
2 pages
|
|
|
Mind Map: Introduction to Grammars, Languages & Automata
1 page
|
|
|
Formula Sheets: Introduction to Grammars, Languages & Automata
2 pages
|
|
|
Handwritten notes: Introduction to Grammars, Languages & Automata
13 pages
|
|
Regular Expressions, Languages, Grammar & Finite Automata
|
Regular Expressions & Finite Automata
22 pages
|
|
|
Intersection Process of Two DFAs
1 page
|
|
|
Short Notes: Regular Expressions & Finite Automata
5 pages
|
|
|
Regular Expressions
7 pages
|
|
|
Introduction to Automata Theory
1 page
|
|
|
NFA to DFA Conversion
6 pages
|
|
|
Minimization of DFA
2 pages
|
|
|
Automata with Output
4 pages
|
|
|
Applications of Finite Automata
1 page
|
|
|
Pumping Lemma for Regular Languages
7 pages
|
|
|
PPT: Introduction to Automata Theory
25 pages
|
|
|
PPT: Finite Automata
41 pages
|
|
|
PPT: Regular Expressions
16 pages
|
|
|
Regular Expression to Epsilon NFA
1 page
|
|
|
Regular Expression to DFA
6 pages
|
|
|
NFA to Regular Expression
2 pages
|
|
|
Formula Sheets: Regular Expressions, Languages, Grammar & Finite Automata
3 pages
|
|
|
Handwritten notes: Regular Expressions, Languages, Grammar & Finite Automata- 1
66 pages
|
|
|
Handwritten notes: Regular Expressions, Languages, Grammar & Finite Automata- 2
2 pages
|
|
Context Free Grammar, Languages and Pushdown Automata
|
PPT: Pushdown Automata (PDA)
37 pages
|
|
|
Context Free Grammars (CFG)
7 pages
|
|
|
Context-Sensitive Grammar (CSG) & Language (CSL)
1 page
|
|
|
Check if the language is Context Free or Not
3 pages
|
|
|
Simplification of Context Free Grammars
8 pages
|
|
|
Normal Forms for CFGs
7 pages
|
|
|
Pushdown Automata (PDA)
21 pages
|
|
|
Pumping Lemma for Context Free Languages (CFLs)
4 pages
|
|
|
PPT: Properties of Context-Free Languages
62 pages
|
|
|
PPT: Context-Free Languages & Grammars
40 pages
|
|
|
Closure Properties of Context Free Languages
3 pages
|
|
|
Relationship Between Grammar & Language
1 page
|
|
|
Equivalence of Pushdown Automata with Context-Free Grammar
45 pages
|
|
|
Formula Sheets: Context Free Grammar, Languages and Push Down Automata
2 pages
|
|
|
Handwritten notes: Context Free Grammar, Languages and Push Down Automata
28 pages
|
|
Regular & Context Free Languages, Pumping Lemma
|
Context-Sensitive Grammar (CSG) & Language (CSL)
1 page
|
|
|
Check if the language is Context Free or Not
3 pages
|
|
|
Short Notes: Regular and Context Free Languages
2 pages
|
|
|
Pumping Lemma for Regular Languages
7 pages
|
|
|
Short Notes: Pumping Lemma
2 pages
|
|
|
Pumping Lemma for Context Free Languages (CFLs)
4 pages
|
|
|
Closure Properties of Context Free Languages
3 pages
|
|
|
Relationship Between Grammar & Language
1 page
|
|
|
DFA to Regular Expression
3 pages
|
|
|
Formula Sheets: Regular & Context Free Languages, Pumping Lemma
2 pages
|
|
|
Handwritten notes: Regular & Context Free Languages, Pumping Lemma
2 pages
|
|
Turing Machines
|
Turing Machine (TM)
7 pages
|
|
|
Short Notes: Turing Machine
5 pages
|
|
|
Designing of Turing Machines
12 pages
|
|
|
TM as Transducers
5 pages
|
|
|
Types of TM: Turing Machines
4 pages
|
|
|
Church’s Thesis, Godelization, Time Complexity of Turing Machine & Halting Problem of TM
6 pages
|
|
|
Post Correspondence Problem & Linear Bounded Automata
4 pages
|
|
|
PPT: Turing Machines
27 pages
|
|
|
Turing Recognizable & Turing Decidable
1 page
|
|
|
Determining Accountability
2 pages
|
|
|
Formula Sheets: Turing Machines
2 pages
|
|
|
Handwritten notes: Turing Machines
15 pages
|
|
Undecidability
|
Short Notes: Undecidability
3 pages
|
|
|
Complexity, Complexity Class P & Complexity Class NP
10 pages
|
|
|
Vertex Cover Problem
2 pages
|
|
|
Hamiltonian Cycle Problem
1 page
|
|
|
SAT (Boolean Formula Satisfiability Problem)
5 pages
|
|
|
Travelling Salesman Problem (TSP)
2 pages
|
|
|
Formula Sheets: Undecidability
2 pages
|
|
|
Handwritten notes: Undecidability
4 pages
|
|
Linear Algebra
|
Different Operations on Matrices
3 pages
|
|
|
Introduction to Matrices
6 pages
|
|
|
Engineering Mathematics Formulas for GATE Exam
24 pages
|
|
|
Representations of Matrices and Graphs in Relations
2 pages
|
|
|
Matrix Diagonalization
2 pages
|
|
|
PPT: Rank of a Matrix
15 pages
|
|
|
Eigen Values & Eigen Vectors
4 pages
|
|
|
System of Linear Equations
8 pages
|
|
|
PPT: Eigenvalues and Eigenvectors
17 pages
|
|
|
PPT: Basics of Matrix & Operations on Matrix
23 pages
|
|
|
PPT: Determinants
29 pages
|
|
|
PPT: System of Linear Equations
12 pages
|
|
|
Mind Map: Linear Algebra
1 page
|
|
Calculus
|
Limits, Continuity & Differentiability
4 pages
|
|
|
Mean Value Theorem
2 pages
|
|
|
Short notes on Differentiation
8 pages
|
|
|
Solved examples on Differentiation
2 pages
|
|
|
Maxima and Minima
5 pages
|
|
|
PPT: Maxima & Minima
4 pages
|
|
|
Multivariable Integral
3 pages
|
|
|
PPT: Limit, Continuity & Differentiability
10 pages
|
|
|
PPT: Mean Value Theorem
17 pages
|
|
|
PPT: Derivatives & Their Application
18 pages
|
|
|
PPT: Integral Calculus
35 pages
|
|
|
PPT: Application of Integration
17 pages
|
|
|
PPT: Vector Calculus
11 pages
|
|
|
PPT: Stokes, Gauss & Green's Theorem
8 pages
|
|
|
Improper Integrals
1 page
|
|
|
Mind Map: Calculus
1 page
|
|
Differential Equations
|
Differential Equations
7 pages
|
|
|
Solution of Differential Equation
6 pages
|
|
|
Wave Equation & Heat Equation
2 pages
|
|
|
PPT: First Order Differential Equations
23 pages
|
|
|
PPT: Higher Order Linear Differential Equations with Constant Coefficients
16 pages
|
|
|
PPT: Method of Parameter Variations
8 pages
|
|
|
PPT: Partial Differential Equations
6 pages
|
|
|
Cauchy-Euler Equation
3 pages
|
|
|
Method of Separation of Variables
6 pages
|
|
Probability and Statistics
|
Basics of Probability
7 pages
|
|
|
Bayes’s Theorem for Conditional Probability
1 page
|
|
|
Conditional Probability
1 page
|
|
|
Law of total probability
2 pages
|
|
|
Probability Distributions (Uniform Distribution)
2 pages
|
|
|
Probability Distributions (Exponential Distribution)
2 pages
|
|
|
Probability Distributions (Normal Distribution)
4 pages
|
|
|
Probability Distributions (Poisson Distribution)
1 page
|
|
|
Probability Distributions (Binomial Distribution)
3 pages
|
|
|
Mean, Variance and Standard Deviation
1 page
|
|
|
Covariance and Correlation
1 page
|
|
|
PPT: Standard Deviation & Coefficient of Variance
9 pages
|
|
|
PPT: Correlation & Regression Analysis
52 pages
|
|
|
PPT: Random Variables
100 pages
|
|
Propositional Logic
|
Logical Connectives
2 pages
|
|
|
Tautologies & Contradictions
6 pages
|
|
|
Contingency & Satisfiable
10 pages
|
|
|
Rules of Inference
2 pages
|
|
|
Well-Formed Formulas
2 pages
|
|
Set Theory & Algebra
|
Properties of Set
16 pages
|
|
|
Principle of Inclusion & Exclusion
2 pages
|
|
|
Relation & Its Types
3 pages
|
|
|
Function & Its types
4 pages
|
|
|
Algebra of Functions
3 pages
|
|
|
Inverse Functions & Composition of Functions
2 pages
|
|
|
Rings, Integral domains & Fields
5 pages
|
|
Graph Theory
|
Walks, Trails, Paths, Cycles & Circuits in Graph
8 pages
|
|
|
Handshaking Lemma
2 pages
|
|
|
Types of Graphs in Graph Theory
5 pages
|
|
|
Eulerian & Hamiltonian Graphs
2 pages
|
|
|
Degree Sequence of a Graph
1 page
|
|
|
Havel's Hakimi Algorithm
6 pages
|
|
|
Planar & Non- Planar Graph
4 pages
|
|
|
Complement of a Graph
2 pages
|
|
|
Subgraphs & Induced Subgraphs
5 pages
|
|
|
Connected Components
7 pages
|
|
Combinatorics
|
Permutations, Combinations & Binomial Coefficients
3 pages
|
|
|
Pigeon Hole Principle
4 pages
|
|
|
Generating Functions
1 page
|
|
|
Recurrence Relations
5 pages
|
|
|
Sequences & Summations
5 pages
|
|
Basics of Computer Design
|
Representation of Basic Information
2 pages
|
|
|
The Main Memory Unit
1 page
|
|
|
PPT: Computer Architecture & Organization
122 pages
|
|
|
Memory Instruction
2 pages
|
|
|
Basic Working Principle of a Computer
2 pages
|
|
|
Main Memory Organization
2 pages
|
|
|
Main Memory Organization: Stored Program
1 page
|
|
|
Basic Computer Model & Different Units of Computer
1 page
|
|
|
Mind Map: Basics of Computer Design
1 page
|
|
|
Short Notes: Basics of Computer Design
2 pages
|
|
|
Formula Sheets: Basics of Computer Design
2 pages
|
|
Machine Instructions & Addressing Modes
|
Machine Instructions
4 pages
|
|
|
Short Notes: Machine Instructions and Addressing Modes
6 pages
|
|
|
Von Neumann Architecture
2 pages
|
|
|
Instruction Formats
4 pages
|
|
|
PPT: RISC & CISC
16 pages
|
|
|
64 - Bit Processor
2 pages
|
|
|
Addressing Sequencing
3 pages
|
|
|
Amdahl’s Law & Its Proof
2 pages
|
|
|
Basic Computer Instructions
3 pages
|
|
|
Stack & Register Based CPU Organization
3 pages
|
|
|
Problem Solving on Instruction Format
5 pages
|
|
|
Simplified Instructional Computer (SIC)
2 pages
|
|
|
Hardware Architecture (Parallel Computing)
4 pages
|
|
|
Generations of Computer
3 pages
|
|
|
Microarchitecture & Instruction Set Architecture
2 pages
|
|
|
Formula Sheets: Machine Instructions & Addressing Modes
3 pages
|
|
|
Handwritten notes: Machine Instructions & Addressing Modes
20 pages
|
|
ALU, Data Path & Control Unit
|
Introduction to Central Processing Unit
2 pages
|
|
|
Computer Configuration
1 page
|
|
|
PPT: Introduction to Central Processing Unit
24 pages
|
|
|
CPU Structure & Function
3 pages
|
|
|
Arithmetic & Logic Unit
2 pages
|
|
|
Instruction Formats
4 pages
|
|
|
Data Transfer & Manipulation
1 page
|
|
|
PPT: RISC & CISC
16 pages
|
|
|
64 - Bit Processor
2 pages
|
|
|
Addressing Sequencing
3 pages
|
|
|
Microinstruction Format
1 page
|
|
|
Symbolic Microinstructions
3 pages
|
|
|
Control Unit Operation
3 pages
|
|
|
PPT: Control Unit Operation
34 pages
|
|
|
Control Unit: Components & Its Types
5 pages
|
|
|
Single Cycle & Pipeline Datapath
1 page
|
|
|
Horizontal & Vertical Microprogramming
1 page
|
|
|
Formula Sheets: ALU, Data Path & Control Unit
3 pages
|
|
|
Handwritten notes: ALU, Data Path & Control Unit
21 pages
|
|
Control Unit
|
Computer Configuration
1 page
|
|
|
Short Notes: Control Unit
6 pages
|
|
|
Addressing Sequencing
3 pages
|
|
|
Microinstruction Format
1 page
|
|
|
Symbolic Microinstructions
3 pages
|
|
|
Control Unit Operation
3 pages
|
|
|
PPT: Control Unit Operation
34 pages
|
|
|
Control Unit: Components & Its Types
5 pages
|
|
Instruction Pipelining and Hazards
|
Introduction to Instruction Pipelining
4 pages
|
|
|
Instruction Pipelining
5 pages
|
|
|
Short Notes: Instruction Pipelining
6 pages
|
|
|
Dealing with Branches
2 pages
|
|
|
Pipeline & Vector Processing
6 pages
|
|
|
PPT: Pipelining & Vector Processing
29 pages
|
|
|
Interrupt Processing
1 page
|
|
|
Reduced Instruction Set Computers
13 pages
|
|
|
Performance of Computer
1 page
|
|
|
Handling Data Hazards & Control Hazards - Processor & Control Unit
3 pages
|
|
|
Pipeline Conflicts
2 pages
|
|
|
Vector Processing
3 pages
|
|
|
Solutions to Hazards
9 pages
|
|
|
Formula Sheets: Instruction Pipelining and Hazards
2 pages
|
|
|
Handwritten notes: Instruction Pipelining and Hazards
26 pages
|
|
Pipelining Hazards
|
Performance of Computer
1 page
|
|
|
Handling Data Hazards & Control Hazards - Processor & Control Unit
3 pages
|
|
Memory Hierarchy: Cache, Main Memory and Secondary Storage
|
Short Notes: Memory Hierarchy
4 pages
|
|
|
Hard Disk Drive (HDD) Secondary Memory
3 pages
|
|
|
The Memory Hierarchy
2 pages
|
|
|
Internal & External Memory
8 pages
|
|
|
Cache Memory Principles
3 pages
|
|
|
Elements of Cache Design
5 pages
|
|
|
PPT: Memory System
79 pages
|
|
|
Introduction of Secondary Memory
6 pages
|
|
|
Random Access Memory (RAM) & Read Only Memory (ROM)
5 pages
|
|
|
Multilevel Cache Organisation
3 pages
|
|
|
Types of Cache Misses
1 page
|
|
|
Formula Sheets: Memory Hierarchy: Cache, Main Memory and Secondary Storage
3 pages
|
|
|
Handwritten notes: Memory Hierarchy: Cache, Main Memory and Secondary Storage- 1
26 pages
|
|
|
Handwritten notes: Memory Hierarchy: Cache, Main Memory and Secondary Storage- 2
26 pages
|
|
Secondary Storage
|
Introduction of Secondary Memory
6 pages
|
|
|
Random Access Memory (RAM) & Read Only Memory (ROM)
5 pages
|
|
|
Handwritten notes: Secondary Storage
7 pages
|
|
I/O Interface
|
Peripheral devices
1 page
|
|
|
Short Notes: I/O Interface(Interrupt and DMA Mode)
6 pages
|
|
|
Input Output interface
2 pages
|
|
|
Input Output Organization
10 pages
|
|
|
Modes of DMA Transfer
4 pages
|
|
|
Data Communication Processor
1 page
|
|
|
Formula Sheets: I/O Interface
3 pages
|
|
Revision Notes
|
Machine Instructions & Addressing Modes
8 pages
|
|
|
Instruction Pipelining
10 pages
|
|
|
Cache & Memory Hierarchy
4 pages
|
|
|
I/O Interface (Interrupt & DMA Mode)
3 pages
|
|
Previous Year Questions − (Computer Organization)
|
Previous Year Questions: Machine Instruction
19 pages
|
|
|
Previous Year Questions: Addressing Modes
4 pages
|
|
|
Previous Year Questions: ALU Data Path and Control Unit
4 pages
|
|
|
Previous Year Questions: IO Interface
6 pages
|
|
|
Previous Year Questions: Interrupt
5 pages
|
|
|
Previous Year Questions: Pipeline Processor
27 pages
|
|
|
Previous Year Questions: Cache Memory
37 pages
|
|
|
Previous Year Questions: Secondary Storage
8 pages
|
|
|
Previous Year Questions: Memory Chip Design
6 pages
|
|
Boolean Algebra & Minimization Techniques
|
Logic Gates & Truth Tables
3 pages
|
|
|
Short Notes: Digital Logic Design
1 page
|
|
|
Laws of Boolen Algebra
5 pages
|
|
|
Canonical & Standard Forms
6 pages
|
|
|
Short Notes: Binary Logic
10 pages
|
|
|
Minimization of Boolean Functions
2 pages
|
|
|
Functional Completeness in Digital Logic
2 pages
|
|
|
K-Maps (Karnaugh Maps)
8 pages
|
|
|
Various Implicants in K-Map
1 page
|
|
|
Mind Map: Boolean Algebra & Minimization Techniques
1 page
|
|
|
Formula Sheets: Boolean Algebra & Minimization Techniques
2 pages
|
|
|
Handwritten notes: Boolean Algebra & Minimization Techniques- 1
34 pages
|
|
|
Handwritten notes: Boolean Algebra & Minimization Techniques- 2
22 pages
|
|
|
PPT: Boolean Algebra & Minimization Techniques
19 pages
|
|
Combinational Circuits
|
Construction of Combinational Circuits
2 pages
|
|
|
Encoders & Decoders
3 pages
|
|
|
Short Notes: Combinational Circuit
40 pages
|
|
|
Multiplexer & Demultiplexer
9 pages
|
|
|
Arithmetic Circuits - 1
8 pages
|
|
|
Arithmetic Circuits - 2
5 pages
|
|
|
Static Hazards in Digital Logic
2 pages
|
|
|
Formula Sheets: Combinational Circuits
3 pages
|
|
|
Handwritten notes: Combinational Circuits
55 pages
|
|
Sequential Circuits
|
Conversion of Flip-Flops
4 pages
|
|
|
Concepts of Sequential Circuits
1 page
|
|
|
Short Notes: Sequential Circuit
18 pages
|
|
|
Latches & Its Types
3 pages
|
|
|
Short Notes: Register
12 pages
|
|
|
Flip-Flops & Its Types
3 pages
|
|
|
Characteristic Equation & Excitation Table of Flip-Flops
1 page
|
|
|
Race Around Condition
1 page
|
|
|
Edge-Triggered Latches
5 pages
|
|
|
Shift Registers in Digital Logic
6 pages
|
|
|
Counters Counters
5 pages
|
|
|
Formula Sheets: Sequential Circuits
3 pages
|
|
|
Handwritten notes: Sequential Circuits
84 pages
|
|
|
PPT: Sequential Circuits
15 pages
|
|
Number System
|
Integer Representation
9 pages
|
|
|
Short Notes: Data Representation & Number System
15 pages
|
|
|
Floating-Point Number Representation
8 pages
|
|
|
Formula Sheets: Number System
2 pages
|
|
|
Handwritten notes: Number System
23 pages
|
|
Revision Notes
|
Regular Expressions & Finite Automata
22 pages
|
|
|
Context-free Grammars & Push-Down Automata
11 pages
|
|
|
Turing Machines & Undecidability
13 pages
|
|
Previous Year Questions - (Theory of Computation)
|
Previous Year Questions: Regular Expression
6 pages
|
|
|
Previous Year Questions: Regular Grammar
3 pages
|
|
|
Previous Year Questions: Regular Language
16 pages
|
|
|
Previous Year Questions: Finite Automata
19 pages
|
|
|
Previous Year Questions: Context Free Grammar
9 pages
|
|
|
Previous Year Questions: Context Free Language
19 pages
|
|
|
Previous Year Questions: Push-down Automata
4 pages
|
|
|
Previous Year Questions: Recursive Language
4 pages
|
|
|
Previous Year Questions: Turing Machine
12 pages
|
|
|
Previous Year Questions: Undecidability
5 pages
|
|
Revision Notes
|
Transactions & Concurrency Control
13 pages
|
|
|
Relational Algebra
8 pages
|
|
|
Integrity Constraints
3 pages
|
|
Previous Year Questions: Database Management System
|
Previous Year Questions: ER Model
6 pages
|
|
|
Previous Year Questions: Relational Schema
9 pages
|
|
|
Previous Year Questions: Relational Algebra
11 pages
|
|
|
Previous Year Questions: Normal Form
11 pages
|
|
|
Previous Year Questions: Transaction
20 pages
|
|
|
Previous Year Questions: Integrity Constraints
1 page
|
|
|
Previous Year Questions: SQL
18 pages
|
|
|
Previous Year Questions: Tuple Calculus
6 pages
|
|
|
Previous Year Questions: File System
8 pages
|
|
Revision Notes
|
Inter-Process Communication
12 pages
|
|
|
Memory Management & Virtual Memory
14 pages
|
|
|
Concurrency & Synchronization
7 pages
|
|
Previous Year Questions- (Operating System )
|
Previous Year Questions: Process
4 pages
|
|
|
Previous Year Questions: CPU Scheduling
14 pages
|
|
|
Previous Year Questions: Process Synchronization
27 pages
|
|
|
Previous Year Questions: Deadlock
13 pages
|
|
|
Previous Year Questions: Memory Management
35 pages
|
|
|
Previous Year Questions: File Systems
4 pages
|
|
|
Previous Year Questions: Disk Scheduling
7 pages
|
|
|
Previous Year Questions: System Call
10 pages
|
|
|
Previous Year Questions: Thread
7 pages
|
|
Revision Notes
|
Sorting Algorithms
25 pages
|
|
|
Asymptotic Worst Case Time & Space Complexity
12 pages
|
|
|
Minimum Spanning Trees
13 pages
|
|
|
Searching Algorithms
3 pages
|
|
|
Greedy Algorithm
33 pages
|
|
|
Dynamic Programming & Divide and Conquer
14 pages
|
|
|
Graph Search Algorithm
14 pages
|
|
|
Shortest Path Algorithm
14 pages
|
|
Previous year Questions-(Algorithm)
|
Previous Year Questions: Asymptotic Notation
26 pages
|
|
|
Previous Year Questions: Recurrence Relation
14 pages
|
|
|
Previous Year Questions: Divide and Conquer
2 pages
|
|
|
Previous Year Questions: Sorting
25 pages
|
|
|
Previous Year Questions: Greedy Technique
12 pages
|
|
|
Previous Year Questions: Minimum Spanning Tree
35 pages
|
|
|
Previous Year Questions: Shortest Path
16 pages
|
|
|
Previous Year Questions: Graph Traversal
19 pages
|
|
|
Previous Year Questions: Dynamic Programming
14 pages
|
|
Revision Notes
|
Basic Variables in C Programming
4 pages
|
|
|
Basic Syntax in C Programming
2 pages
|
|
|
Basic Data in C Programming
3 pages
|
|
|
Basic Constants & Literals in C Programming
4 pages
|
|
|
Basic Storage Classes in C Programming
3 pages
|
|
|
Basic Operators in C Programming
5 pages
|
|
|
Basic Decision Making in C Programming
9 pages
|
|
|
Basic Loops in C Programming
11 pages
|
|
|
Basic Functions in C Programming
8 pages
|
|
|
Basic Scope Rules in C Programming
3 pages
|
|
|
Basic Arrays in C Programming
11 pages
|
|
|
Basic Pointer in C Programming
15 pages
|
|
|
Basic Strings in C Programming
2 pages
|
|
|
Basic Structures in C Programming
6 pages
|
|
|
Basic Unions in C Programming
3 pages
|
|
|
Basic Recursion in C Programming
1 page
|
|
|
Basic File I/O in C Programming
5 pages
|
|
|
Basic Preprocessors in C Programming
4 pages
|
|
|
Basic Input & Output in C Programming
3 pages
|
|
|
Basic Memory Management in C Programming
3 pages
|
|
|
Binary Search Trees
14 pages
|
|
Previous year Questions - (Data Structure )
|
Previous Year Questions: ARRAY
2 pages
|
|
|
Previous Year Question: Link List
20 pages
|
|
|
Previous Year Questions :Stack
13 pages
|
|
|
Previous Year Question: Queue
10 pages
|
|
|
Previous Year Questions: Binary Tree
23 pages
|
|
|
Previous Year Question: Binary Search Tree:
21 pages
|
|
|
Previous Year Questions: AVL Tree
5 pages
|
|
|
Pervious Year question: B Tree
1 page
|
|
|
Previous Year Questions: B+ Tree
4 pages
|
|
|
Previous Year Questions: Heap Tree
21 pages
|
|
|
Previous Year Questions: n-ary tree
2 pages
|
|
|
Previous Year Questions: Hashing
12 pages
|
|
Previous Year Questions - (C Programming)
|
Previous Year Questions: Arithmetic Operation
11 pages
|
|
|
Previous Year Questions: Conditional Statement
13 pages
|
|
|
Previous Year Questions: Loop
9 pages
|
|
|
Previous Year Questions: Array and Pointer
25 pages
|
|
|
Previous Year Questions: Function
44 pages
|
|
Revision Notes
|
Combinational & Sequential Circuits
15 pages
|
|
|
Number Representations & Computer Arithmetic (Fixed & Floating point)
2 pages
|
|
Previous Year Questions - (Digital Logic)
|
Previous Year Questions: Number System
18 pages
|
|
|
Previous Year Questions: Boolean Algebra
13 pages
|
|
|
Previous Year Questions: Combinational Circuit
10 pages
|
|
|
Previous Year Questions: Sequential Circuit
8 pages
|
|
Revision Notes
|
System of Linear Equations
8 pages
|
|
|
Eigenvalues & Eigenvectors
1 page
|
|
|
Mean Value Theorem
1 page
|
|
|
Standard Deviation
1 page
|
|
Formula Sheets
|
Formula Sheet: Engineering Mathematics
24 pages
|
|
Engineering Mathematics
|
Previous Year Questions: Linear Algebra
30 pages
|
|
|
Previous Year Questions: Calculus
14 pages
|
|
|
Previous Year Questions: Numerical Method
5 pages
|
|
Discrete Mathematics
|
Previous Year Questions: Propositional Logic
35 pages
|
|
|
Previous Year Questions: Set Theory
25 pages
|
|
|
Previous Year Questions: Relation
6 pages
|
|
|
Previous Year Questions: Functions
8 pages
|
|
|
Previous Year Questions: Lattice
4 pages
|
|
|
Previous Year Questions: Group Theory
11 pages
|
|
|
Previous Year Questions: Graph Theory
47 pages
|
|
|
Previous Year Questions: Planar Graph
3 pages
|
|
|
Previous Year Questions: Combination
6 pages
|
|
|
Previous Year Questions: Probability Theory
29 pages
|
|
|
Previous Year Questions: Recurrence
7 pages
|
|
Syllabus & Full Mock Tests
|
Salient Features of GATE 2026 Virtual Calculator
8 pages
|
|
|
FAQs: GATE Online Test Series 2026
3 pages
|
|
|
GATE Syllabus for CSE with Weightage
8 pages
|
|
|
Mock Tests Series of GATE Computer Science Engineering
2 pages
|
|
|
Detailed & Scheduled Mock test Series for CSE & IT
7 pages
|
|
|
General FAQs regarding GATE
6 pages
|
|
GATE CSE Past Year Papers (1991 - 2025)
|
Gate (CS) 2025 Paper with Solution - Set - 1
38 pages
|
|
|
Gate (CS) 2025 Paper with Solution - Set - 2
41 pages
|
|
|
Gate (CS) 2024 Paper with Solution - Set - 1
28 pages
|
|
|
Gate (CS) 2024 Paper with Solution - Set - 2
35 pages
|
|
|
Gate (CS) 2023 Paper with Solution
26 pages
|
|
|
Gate (CS) 2022 Paper with Solution
25 pages
|
|
|
Gate (CS) 2021 Paper with Solution - Set- 1
40 pages
|
|
|
Gate (CS) 2021 Paper with Solution - Set- 2
42 pages
|
|
|
Gate (CS) 2020 Paper with Solution
37 pages
|
|
|
Gate (CS) 2019 Paper with Solution
44 pages
|
|
|
Gate (CS) 2018 Paper with Solution
26 pages
|
|
|
Gate (CS) 2018 Paper with Solution
31 pages
|
|
|
Gate (CS) 2017 Paper with Solution
27 pages
|
|
|
Gate (CS) 2016 Paper with Solution (Set A)
31 pages
|
|
|
Gate (CS) 2016 Paper with Solution (Set B)
35 pages
|
|
|
Gate (CS) 2015 Paper with Solution (Set A)
25 pages
|
|
|
Gate (CS) 2015 Paper with Solution (Set B)
26 pages
|
|
|
Gate (CS) 2015 Paper with Solution (Set C)
28 pages
|
|
|
Gate (CS) 2014 Paper with Solution (Set A)
22 pages
|
|
|
Gate (CS) 2014 Paper with Solution (Set B)
23 pages
|
|
|
Gate (CS) 2014 Paper with Solution (Set C)
28 pages
|
|
|
Gate (CS) 2013 Paper with Solution (Set A)
15 pages
|
|
|
Gate (CS) 2013 Paper with Solution (Set B)
29 pages
|
|
|
Gate (CS) 2013 Paper with Solution (Set C)
15 pages
|
|
|
Gate (CS) 2013 Paper with Solution (Set D)
15 pages
|
|
|
Gate (CS) 2012 Paper with Solution (Set A)
30 pages
|
|
|
Gate (CS) 2012 Paper with Solution (Set D)
30 pages
|
|
|
Gate (CS) 2012 Paper with Solution (Set A)
19 pages
|
|
|
Gate (CS) 2011 Paper without Solution
26 pages
|
|
|
Gate (CS) 2010 Paper without Solution
14 pages
|
|
|
Gate (CS) 2009 Paper without Solution
13 pages
|
|
|
Gate (CS) 2008 Paper without Solution
20 pages
|
|
|
Gate (CS) 2007 Paper without Solution
19 pages
|
|
|
Gate (CS) 2006 Paper without Solution
28 pages
|
|
|
Gate (CS) 2003 Paper without Solution
24 pages
|
|
|
Gate (CS) 2002 Paper without Solution
17 pages
|
|
|
Gate (CS) 2001 Paper without Solution
18 pages
|
|
|
Gate (CS) 2000 Paper without Solution
18 pages
|
|
|
Gate (CS) 1999 Paper without Solution
15 pages
|
|
|
Gate (CS) 1998 Paper without Solution
15 pages
|
|
|
Gate (CS) 1997 Paper without Solution
16 pages
|
|
|
Gate (CS) 1996 Paper without Solution
19 pages
|
|
|
Gate (CS) 1995 Paper without Solution
16 pages
|
|
|
Gate (CS) 1994 Paper without Solution
14 pages
|
|
|
Gate (CS) 1993 Paper without Solution
15 pages
|
|
|
Gate (CS) 1992 Paper without Solution
9 pages
|
|
|
Gate (CS) 1991 Paper without Solution
13 pages
|
|