Video Lectures of 3 Months Preparation for GATE CSE for Computer Science Engineering (CSE) Exam
Watch free video lectures for 3 Months Preparation for GATE CSE covering all chapters/topics as per the latest syllabus in 2026. These concept videos, recorded lectures, and audio notes are designed to help Computer Science Engineering (CSE) students understand every topic clearly — anytime, anywhere. Start learning on EduRev.
Reading and Comprehension
| How to solve Reading Comprehension Passages 26:50 min |  |
| Important Concepts: Reading Comprehension 25:58 min | |
Vocabulary
| Prefix & Suffix: Verbal Aptitude 08:15 min | |
| Practice Questions: Vocabulary 29:43 min | |
| List of High Frequency Words- 2 33:33 min | |
| List of High Frequency Words- 1 16:28 min | |
| Idioms: Vocabulary 22:54 min | |
| Commonly Confused Words: Vocabulary- 1 48:57 min | |
| Commonly Confused Words: Vocabulary- 2 34:01 min | |
Tenses
| Simple Present Tenses: Tenses 27:57 min | |
| Present Perfect Tense - English Grammar Basics 13:43 min | |
Articles
| Articles (Solved Questions) 09:55 min | |
Adjectives
| Adjectives (Solved Questions) 11:18 min | |
Parts of Speech
| Nouns (Solved Questions) 07:29 min | |
| Parts of Speech: Nouns 10:40 min | |
| Parts of Speech: Pronouns - 1 12:44 min | |
| Parts of Speech: Pronouns - 2 11:10 min | |
| Parts of Speech: Pronouns - 3 07:07 min | |
| Pronouns (Solved Questions) 10:34 min | |
Words
| Tips & Tricks: Word 14:48 min | |
Idioms & Phrases
| 15 Idioms and Phrases -1 08:04 min | |
| 15 Idioms and Phrases -2 08:03 min | |
Prepositions
| Prepositions - 1 33:45 min | |
| Prepositions - 2 26:24 min | |
Subject Verb-Agreement
| Subject Verb Agreement - 1 11:06 min | |
| Subject Verb Agreement - 2 09:47 min | |
Introduction
| Database Management Systems (DBMS) 09:01 min | |
| Introduction to Database Management Systems 11:03 min | |
| DBMS Characteristics 12:46 min | |
ER Model
| Introduction to Database Management Systems (DBMS) 09:38 min | |
| Database Management Systems (DBMS) 09:01 min | |
Relational Algebra
| Basics of Relational Algebra 07:53 min | |
| Relational Algebra Basics - 1 21:36 min | |
| Relational Algebra (Union Operation) 20:15 min | |
| Relational Algebra Basics - 2 05:44 min | |
| Introduction to Relational Data Model 06:53 min | |
| Characteristics of Relations 07:40 min | |
| Relational Model Constraints 12:48 min | |
| Update Operations/Dealing with Constraint Violations 09:56 min | |
| Exercises based on Relational Model – Part 1 12:29 min | |
| Exercises based on Relational Model – Part 2 08:31 min | |
| Relational Algebra Operations - Unary 15:25 min | |
| Relational Algebra Operations - Set Theory 11:49 min | |
| Relational Algebra Operations - Binary 19:04 min | |
| Additional Relational Algebra Operations 21:58 min | |
| Relational Algebra Queries (Part 1) 21:39 min | |
| Relational Algebra Queries (Part 2) 11:36 min | |
Database Design (Integrity Constraints, Normalization)
| Basic Concept of Database Normalization - Simple Explanation for Beginners 08:11 min | |
| First Normal Form (1NF) | Database Normalization | DBMS 03:42 min | |
| Second Normal Form (2NF) | Database Normalization | DBMS 07:13 min | |
| Third Normal Form (3NF) | Database Normalization | DBMS 04:16 min | |
| Boyce-Codd Normal Form (BCNF) | Database Normalization | DBMS 04:42 min | |
| 4th Normal Form (4NF) | Multi-Valued Dependency | Database Normalization 04:51 min | |
| 5th Normal Form (5NF) | Join Dependency | Database Normalization 08:09 min | |
| Concept of Keys in DBMS - Super, Primary, Candidate, Foreign Key, etc 09:16 min | |
| How to Design DB Tables for any Application? (The Basics) 09:29 min | |
| RDBMS vs NoSQL Databases Explained! 13:35 min | |
| What is Database Transaction? | Transactions in Database | DB Transactions with Examples 08:29 min | |
| When to use Database Transactions? 13:26 min | |
SQL
| SQL JOINS Tutorial for beginners | Practice SQL Queries using JOINS - Part 1 35:23 min | |
| SQL JOINS Tutorial for beginners | Practice SQL Queries using JOINS - Part 2 29:59 min | |
| Subquery in SQL | Correlated Subquery + Complete SQL Subqueries Tutorial 70:44 min | |
| SQL WITH Clause | How to write SQL Queries using WITH Clause | SQL CTE (Common Table Expression) 24:48 min | |
| SQL Window Function | How to write SQL Query using RANK, DENSE RANK, LEAD/LAG | SQL Queries Tutorial 24:55 min | |
| SQL Window Function | How to write SQL Query using Frame Clause, CUME_DIST | SQL Queries Tutorial 54:31 min | |
| SQL Views Tutorial | VIEWS in SQL Complete Tutorial 43:20 min | |
File Organization & Indexing
| DSA 1.45 Part 1: Sequential File Organization with Examples | Types | Operations 05:37 min | |
| DSA 1.46 Part 2 : Index Sequential File Organization with Example 05:09 min | |
| DSA 1.47 Part 3: Direct Access File Organization with Example 05:51 min | |
| DSA 1.48 Part 4: Cluster File Organization with Example | Types | Operations 05:11 min | |
| DSA 1.49 Part 5: Comparison's of Sequential, Index Sequential & Direct Access File Organization 04:33 min | |
| Tree Height, Big O vs Worst Case: B Trees 09:46 min | |
| BST Performance: B Trees 08:38 min | |
| Splitting Non Leaf nodes, Terminolgoy: B Trees 05:34 min | |
| Basic Insertion: B Tree 07:11 min | |
| Bushiness Invariants for B Trees 05:00 min | |
| Runtime Analysis, Summary: B Trees 05:33 min | |
| B+ Tree Basics 1 03:54 min | |
| B+ Trees Basics 2 (insertion) 08:28 min | |
| B+ Tree Basics 3 06:05 min | |
| Extendible Hashing 07:29 min | |
Transaction & Concurrency Control
| Introduction to Transactions 06:26 min | |
| Examples and Problems: Transaction & Concurrency Control 06:15 min | |
| The Transaction Model 04:47 min | |
| ACID Properties of Transactions 07:39 min | |
| Serializability 06:06 min | |
| Conflict Serializability 05:22 min | |
| Conflict Dependency Graphs 02:40 min | |
| View Serializability 03:39 min | |
Networking Fundamentals & Physical Layer
| Introduction to Computer Networks 09:44 min | |
| Computer Networks: Basic Characteristics 08:57 min | |
| Network Protocols & Communications 12:26 min | |
| Components of a Computer Network 09:55 min | |
| Building a Computer Network 01:57 min | |
| Flow Control - Fundamentals & Link Layer 07:13 min | |
Data Link Layer
| Link Layer Services 09:14 min | |
| Sub-layers of the Data Link Layer 06:41 min | |
| Media Access Protocol 12:25 min | |
Transport Layer
| Comparison of Transport Protocols (UDP & TCP) 11:35 min | |
| User Datagram Protocol - 1 08:44 min | |
| User Datagram Protocol - 2 09:18 min | |
| User Datagram Protocol - 3 15:24 min | |
Media Access Control (MAC)
| Media Access Protocol 12:25 min | |
Network Layer
| Responsibilities of Network Layer 12:13 min | |
| Class A in IP Addressing with Example 23:28 min | |
Application Layer
| Application Layer of OSI Model 15:44 min | |
| Simple Network Management Protocol (SNMP) 16:45 min | |
| Email Architecture 03:52 min | |
Routing
| Routers in Computer Networks 08:08 min | |
| Collision Domain Vs. Broadcast Domain 13:52 min | |
| BGB (Broader Gateway Protocol) 07:10 min | |
Mirroring
| How to solve Mirror Image Problems 03:02 min | |
Rotation of shapes
| Rotation of Shapes - 1 05:13 min | |
| Rotation of Shapes - 2 02:52 min | |
Paper Folding and Cutting
| Paper Folding & Cutting - 1 07:09 min | |
| Paper Folding & Cutting - 2 11:47 min | |
Patterns in 2 and 3 dimensions
| Three-dimensional Visualization 52:26 min | |
Translation
| Translation Spatial Aptitude 42:55 min | |
Assembling and Grouping
| Assembling of Shapes 02:48 min | |
Complete Spatial Aptitude
| Spatial Aptitude 74:33 min | |
| Spatial Aptitude (All PYQs with Tricks) 60:08 min | |
Basic Concepts of OS
| Operating System: Syllabus 13:01 min | |
| Introduction to Operating Systems 16:45 min | |
| Basics of OS (Computer System Operation) 18:09 min | |
| Basics of OS (Storage Structure) 10:03 min | |
Process Management
| Process Management (Processes and Threads) 07:32 min | |
| Process Control Block 07:02 min | |
Threads
| Introduction to Threads 14:06 min | |
| Message Passing Systems 23:00 min | |
Linear Algebra
| Vector Space - Linear Algebra 20:52 min | |
| Vector Space : Properties of Vector Space - Linear Algebra 15:34 min | |
| Subspace Theorems & Examples - Linear Algebra 21:26 min | |
| Basis & Dimension & Examples Of Basis - Linear Algebra 15:58 min | |
| System Response Characteristics 07:35 min | |
| Linear Transformation & Examples of Linear Transformation - Linear Algebra 15:52 min | |
| Open Loop Systems 04:17 min | |
Calculus
| Short Tricks - Integration 00:55 min | |
| Short Trick Calculus - Limits 00:48 min | |
| L - Hospital Rule 17:55 min | |
| Calculus: Mean Value Theorem (Rolles, Lagrange & Cauchy) 05:14 min | |
| Vector Calculus - Vector Differentiation 51:09 min | |
| Vector Calculus - Vector Integration 66:32 min | |
| Calculus - Taylor Series & Maclaurin Series 04:26 min | |
| Calculus - Limit Continuity And Differentiability 10:40 min | |
Differential Equations
| Singular Solution - Differential Equation 14:55 min | |
| Cauchy Euler equation 01:00 min | |
| Differential Equation: Formation Of Differential Equation - Concept & Examples 12:34 min | |
| Differential Equation - Order And Degree With Concept & Examples 14:38 min | |
| Complementary Function and Particular Integral 00:59 min | |
| Initial Value Problem & Variable Separable Method 01:00 min | |
| Initial Value Problem & Boundary Value 00:59 min | |
Probability and Statistics
| Binomial Distribution - Fitting of Binomial Distribution 14:05 min | |
| Poisson Distribution - Fitting of Poisson Distribution 07:40 min | |
| Binomial Distribution 16:34 min | |
| Random Variable, Probability Density Function & Cumulative Distribution Function 21:22 min | |
| Probability & Statistics 00:59 min | |
| Probability & Statistics - Binomial Distribution 01:00 min | |
| Random Variables 18:38 min | |
| Probability Sum of Two Dice 00:56 min | |
| Poisson Distribution 10:34 min | |
| Poisson Distribution & Poisson Distribution Examples 10:43 min | |
| Statistics & Probability 08:00 min | |
| Mathematical Expectation 12:48 min | |
Basics of Computer Design
| Representation of Basic Information 01:51 min | |
| Introduction to Computer Organization & Architecture (CAO) 13:46 min | |
| Computer Instructions 04:20 min | |
| Main Memory Organization 08:22 min | |
| Introduction to Computer Architecture 19:12 min | |
Machine Instructions & Addressing Modes
| Addressing Mode - 1 13:32 min | |
| Addressing Mode - 2 18:16 min | |
ALU, Data Path & Control Unit
| CPU Structure & Function 04:16 min | |
| Design of Control Unit 12:25 min | |
| Fun Video: Arithmetic & Logic Unit 11:10 min | |
| Addressing Modes 12:14 min | |
| Control Unit Operation 10:53 min | |
Control Unit
| Design of Control Unit 12:25 min | |
Instruction Pipelining and Hazards
| RISC & CISC: Pipeline & Vector Processing 03:07 min | |
| Pipeline Hazards 27:44 min | |
Pipelining Hazards
| Pipeline Hazards 27:44 min | |
Memory Hierarchy: Cache, Main Memory and Secondary Storage
| Characteristics of Memory - 1 10:43 min | |
| Characteristics of Memory - 2 06:13 min | |
| Types of Mapping 02:38 min | |
| The Memory Hierarchy 08:03 min | |
I/O Interface
| Input/Output (I/O) Modules 11:20 min | |
| Modes of Transfer 17:18 min | |
Logic: Deduction and Induction
| Introduction to Circular & Linear Arrangement 20:11 min | |
| Linear Arrangement Problems 08:05 min | |
| Introduction: Blood Relations 22:37 min | |
| Concepts of Chain Relations: Blood Relations 20:19 min | |
| Concepts of Puzzle & Family Tree: Blood Relations 15:56 min | |
| Concepts of Coded Relations: Blood Relations 20:39 min | |
| Basic Problems on Arrangement 16:15 min | |
| Complex Seating Arrangement 21:56 min | |
| Verification of Truth 08:01 min | |
| Logical Connectives 29:04 min | |
Syllogism
| Practice Questions: Syllogism 18:04 min | |
| Introduction: Statements, Syllogisms 09:11 min | |
| Introduction: Conclusions, Syllogisms 10:10 min | |
Venn Diagram
| Venn Diagram Optimization- 1 14:02 min | |
| Venn Diagram Optimization- 2 22:27 min | |
Coding Decoding
| Coding & Decoding 58:50 min | |
| Coding & Decoding - 1 13:15 min | |
| Coding & Decoding - 2 04:55 min | |
| Coding & Decoding - 3 12:36 min | |
| Coding & Decoding - 4 07:36 min | |
Analogy
| Basics & Approach: Analogy 08:39 min | |
| Tricks & Applications: Analogy 06:40 min | |
Numerical relations and reasoning
| Numerical Reasoning Solved Examples 15:49 min | |
Ranking/Directions Test
| Data Sufficiency: Based On Directions 46:11 min | |
| Data Sufficiency: Ranking & Ordering Part - 1 23:26 min | |
| Data Sufficiency: Ranking & Ordering Part - 2 19:05 min | |
| Data Sufficiency: Based On Blood Relation 37:33 min | |
Introduction to Compiler
| Introduction to Compiler Design 05:39 min | |
| Regular Expressions & Languages 06:15 min | |
Lexical Analysis
| Introduction to Lexical Analyser & Grammars 19:51 min | |
| Examples: Regular Expression 05:32 min | |
| Identities of Regular Expression 06:44 min | |
| Arden’s Theorem 07:35 min | |
| Example Proof using Identities of Regular Expressions 05:49 min | |
| Designing Regular Expressions 06:55 min | |
| NFA to Regular Expression Conversion 13:37 min | |
| DFA to Regular Expression Conversion - 1 06:19 min | |
| DFA to Regular Expression Conversion - 2 08:27 min | |
| Conversion of Regular Expression to Finite Automata 04:27 min | |
| Examples: Conversion of Regular Expression to Finite Automata - 1 08:54 min | |
| Examples: Conversion of Regular Expression to Finite Automata - 2 06:20 min | |
| Examples: Conversion of Regular Expression to Finite Automata - 3 06:48 min | |
Parsing
| Examples On How to Find First & Follow in LL(1) - Top Down Parsing 21:58 min | |
| Parsing Table Creation for LALR(1), CLR(1) 12:40 min | |
| Bottom-up vs. Top Down Processing 04:27 min | |
| LR Parsing, LR(0) Items & LR(0) Parsing Table 19:25 min | |
| Operator Precedence Parsing 08:57 min | |
| Shift Reduce Parsing Operations & Example 10:45 min | |
| Elimination of Left Factoring 04:16 min | |
Intermediate Code Generation
| Intermediate Code Generation: Syntax Directed Translation 29:12 min | |
Code Optimization
| Basic Blocks & Flow Graphs in Compiler Design 18:37 min | |
| Peephole Optimization 08:21 min | |
Regular Expressions, Languages, Grammar & Finite Automata
| NFA & DFA Conversion 16:43 min | |
| Regular Expression 04:43 min | |
| Finite Automata With Outputs 10:37 min | |
| Construction of Moore Machine - Examples 09:39 min | |
| Pumping Lemma for Regular Languages 33:08 min | |
| Minimization of Deterministic Finite Automata (DFA) 06:10 min | |
| Regular Expression - Examples 05:32 min | |
Context Free Grammar, Languages and Pushdown Automata
| Introduction: Pushdown Automata 11:49 min | |
| Pumping Lemma for Context-Free Languages 08:53 min | |
| Context Free Grammar & Context Free Language 07:52 min | |
Regular & Context Free Languages, Pumping Lemma
| Pumping Lemma for Context-Free Languages 08:53 min | |
| Pumping Lemma for Regular Languages 33:08 min | |
Turing Machines
| Universal Turing Machine 08:20 min | |
| Multitape Turing Machine 17:33 min | |
| The Post Correspondence Problem 14:29 min | |
Undecidability
| Complexity Classes P & NP 08:30 min | |
| P & NP Problems 02:03 min | |
| Hamiltonian Cycle: Backtracking 18:35 min | |
| Traveling Salesman Problem 24:42 min | |
| NP-Completeness of Vertex Cover with Proof 11:14 min | |
Searching & Sorting
| Binary Search Recursive Method 07:11 min | |
| Heap - Heap Sort - Heapify - Priority Queues 51:08 min | |
| Two Way MergeSort - Iterative method 20:19 min | |
| Merge Sort Algorithm 24:07 min | |
| MergeSort in-depth Analysis 13:28 min | |
| QuickSort Algorithm 13:43 min | |
| QuickSort Analysis 11:37 min | |
| Searching in an Array 09:10 min | |
| Sorting - Concluding Remarks 08:08 min | |
| Binary Search Iterative Method 19:36 min | |
Hashing
| Introduction: Hashing 06:55 min | |
| Separate Chaining 07:49 min | |
| Open Addressing 11:29 min | |
| Rabin-Karp Algorithm 11:32 min | |
| Count Pairs with Given Sum 04:28 min | |
| Convert An Array to Reduced Form 04:16 min | |
| Advantages of BST over Hash Table 01:59 min | |
| Print a Binary Tree in Vertical Order 05:05 min | |
Asymptotic Analysis of Algorithms
| Characteristics of Algorithm 05:37 min | |
| How Write and Analyze Algorithm 10:37 min | |
| Frequency Count Method 12:22 min | |
| Time Complexity - 1 10:08 min | |
| Time Complexity Example - 2 14:13 min | |
| Time Complexity of While and if - 3 21:54 min | |
| Classes of functions 03:10 min | |
| Compare Class of Functions 05:11 min | |
| Asymptotic Notations Big Oh - Omega - Theta 1 15:46 min | |
| Asymptotic Notations - Big Oh - Omega - Theta 2 10:07 min | |
| Properties of Asymptotic Notations 11:58 min | |
| Comparison of Functions - 1 09:28 min | |
| Comparison of Functions - 2 10:26 min | |
| Best Worst and Average Case Analysis 18:56 min | |
Recurrence Relations
| Recurrence Relation (T(n)= T(n-1) + 1) 13:48 min | |
| Recurrence Relation (T(n)= T(n-1) + n) 16:00 min | |
| Recurrence Relation (T(n)= T(n-1) + log n) 12:25 min | |
| Recurrence Relation T(n)=2 T(n-1)+1 10:42 min | |
| Masters Theorem Decreasing Function 08:10 min | |
| Recurrence Relation Dividing Function T(n)=T(n/2)+1 08:41 min | |
| Recurrence Relation Dividing Function T(n)=T(n/2)+1 08:41 min | |
| Recurrence Relation [ T(n)= 2T(n/2) +n] 11:20 min | |
| Masters Theorem in Algorithms for Dividing Function 16:50 min | |
| Examples for Master Theorem 05:41 min | |
| Root function (Recurrence Relation) 05:37 min | |
Divide & Conquer
| Divide And Conquer 07:04 min | |
Greedy Techniques
| Knapsack Problem - Greedy Method 15:30 min | |
| Optimal Merge Pattern - Greedy Method 09:33 min | |
| Prims and Kruskals Algorithms - Greedy Method 20:12 min | |
| Greedy Method - Introduction 12:02 min | |
| Job Sequencing with Deadlines - Greedy Method 13:29 min | |
| Huffman Coding - Greedy Method 17:44 min | |
| Dijkstra Algorithm - Single Source Shortest Path - Greedy Method 18:35 min | |
Graph Based Algorithms
| Representing Graphs 13:47 min | |
| Introduction to Graphs 12:03 min | |
| Depth first search (DFS) 12:44 min | |
| Breadth first search (BFS) 20:39 min | |
| Applications of BFS and DFS 22:25 min | |
| Directed acylic graphs: topological sort 20:26 min | |
| Directed acylic graphs: longest paths 14:01 min | |
| Dijkstras algorithm: analysis 14:22 min | |
| Negative edge weights: Bellman-Ford algorithm 16:42 min | |
| All pairs shortest paths 19:36 min | |
| Minimum Cost Spanning Trees 11:59 min | |
| Prims Algorithm 21:11 min | |
| Kruskals algorithm 14:38 min | |
Dynamic Programming
| Principle of Optimality - Dynamic Programming Introduction 14:52 min | |
| MultiStage Graph - Dynamic Programming 21:07 min | |
| MultiStage Graph (Program) - Dynamic Programming 14:26 min | |
| All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming 14:13 min | |
| Matrix Chain Multiplication using Dynamic Programming Formula 52:02 min | |
| Matrix Chain Multiplication (Program) - Dynamic Programming 18:40 min | |
| Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming 17:12 min | |
| 0/1 Knapsack - Two Methods - Dynamic Programming 28:24 min | |
| 0/1 Knapsack Problem (Program) - Dynamic Programming 17:00 min | |
| Optimal Binary Search Tree (Successful Search Only) - Dynamic Programming 30:19 min | |
| Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming 57:00 min | |
| Traveling Salesman Problem - Dynamic Programming using Formula 17:18 min | |
| Reliability Design - Dynamic Programming 26:32 min | |
| Reliability Design - Dynamic Programming 26:32 min | |
