Video Lectures of Crash Course: Computer Science Engineering (CSE)
Free Video Lectures for CSE Crash Course: Build Concepts from Scratch
The Computer Science Engineering crash course video lectures are designed to take you from foundational concepts to advanced topics without wasting time. Whether you're starting with Digital Logic and Von Neumann's Architecture or diving into Operating Systems and Computer Networks, each video is structured to maximize understanding in the shortest time possible. Expert faculty break down complex subjects - like pipelining hazards, cache mapping techniques, and TCP/IP protocols - using real-life analogies that actually stick. These free video lectures are a reliable starting point for anyone serious about cracking the CSE exam.
Digital Logic
| Explanation: Digital Logic 04:40 min |  |
| Properties of various Logic Gates 08:44 min | |
| Types of Logic Gates: Symbols & Truth Tables 08:59 min | |
| Introduction: Sequential Circuit with Examples 04:16 min | |
| NAND & NOR Gate 05:50 min | |
| Explanation: Canonical Sum of Product (SOP) 06:55 min | |
| Full Adder: Combinational Circuit 09:27 min | |
| Half Adder: Combinational Circuits 05:45 min | |
| Half Subtractor: Combinational Circuits 03:50 min | |
| Introduction: Multiplexer 05:59 min | |
| Implement Function using Multiplexer 04:40 min | |
| Introduction: Demultiplexers 06:46 min | |
| Working of Multiplexers: Inside the Block Diagram of Multiplexers 05:17 min | |
| Functionally Complete Multiplexers 08:11 min | |
| Working of Demultiplexers 04:02 min | |
| Cascading Multiplexer 05:01 min | |
Computer Organization & Architecture
| Syllabus : Computer Organization and Architecture 13:40 min | |
| Von Neumann's Architecture: Stored Memory Concept 09:40 min | |
| Various General Purpose Registers 15:11 min | |
| Explanation: Types of Buses 07:59 min | |
| Common Bus system 19:11 min | |
| Common bus system using multiplexer 11:26 min | |
| Types of Instructions in General Purpose Computer 05:11 min | |
| Data Transfer Instructions 07:45 min | |
| Arithmetic Instructions(Data Manipulation) 08:44 min | |
| Logical Instructions(Data Manipulation) 09:12 min | |
| Shift Instructions(Data Manipulation) 13:28 min | |
| Program Control Instructions(Types of Control Instructions) 10:51 min | |
| Program Control Instructions in Computer Organization 18:17 min | |
| Instruction Format in Computer Organisation 10:40 min | |
| Question on Instruction Format 08:51 min | |
| Single Accumulator CPU Organisation 08:03 min | |
| General Register CPU Organisation: Two and Three Address Instructions 07:19 min | |
| Register Stack Organisation: Zero Address Instructions 11:50 min | |
| Memory Stack Organisation: Memory stack Vs Register stack 06:03 min | |
| Addressing Mode: Various Types of Addressing Modes 11:45 min | |
| Implied Addressing Mode 04:56 min | |
| Immediate Addressing Mode 06:36 min | |
| Register Mode: Addressing Mode 04:39 min | |
| Register Indirect Mode: Addressing Modes 06:22 min | |
| Auto Increment and Decrement Addressing Modes 06:51 min | |
| Direct Addressing Mode 04:51 min | |
| Indirect Addressing Mode 06:05 min | |
| Relative Addressing Mode 07:08 min | |
| Base Register Addressing Mode 06:58 min | |
| Indexed Addressing Mode 04:05 min | |
| Question on Addressing Modes 04:45 min | |
| Memory Hierarchy in Computer Architecture: Access time; Speed; Size; Cost 07:32 min | |
| Independent vs Hierarchical Memory Organization: 2-Level Memory Organization 10:04 min | |
| 3-Level Memory Organisation 08:19 min | |
| GATE 2004 Question on 3-Level Memory Organisation 05:50 min | |
| Introduction to Cache Mapping: Cache Mapping techniques 07:40 min | |
| Direct Mapping with Example: Cache Mapping 22:03 min | |
| GATE 2005 Question on Direct Mapping: Cache Mapping Questions 07:22 min | |
| Fully Associative Mapping with examples 09:56 min | |
| Advantages and Disadvantages of Direct Mapping 09:08 min | |
| Set Associative Mapping with Examples: Cache Mapping 10:52 min | |
| Cache Replacement Algorithms 05:35 min | |
| Locality of Reference in Cache Memory: Spatial Vs Temporal Locality 08:47 min | |
| LRU (Least Recently Used) Cache Replacement Algorithm 08:58 min | |
| Gate 2014 Question on Set Associative Cache Mapping 08:16 min | |
| FIFO Cache Replacement Policy with example 09:05 min | |
| LRU(least recently used ) Cache Replacement Policy 07:31 min | |
| Pipelining with real life example: Need of Pipelining 08:18 min | |
| Pipelining Introduction and structure 03:54 min | |
| Pipelining Vs Non-Pipelining: Instruction Execution - Speedup; Efficiency; Utilization 13:04 min | |
| Hazard in Pipelining: Various types of Hazards 10:29 min | |
| Stage Delay in Pipeline: Previous Year GATE Question 10:54 min | |
| Numerical Question on Pipelining: Previous year GATE Question 04:25 min | |
| Structural Hazards in Pipelining: Types of Hazards with Example 09:33 min | |
| Read After Write(RAW) Hazards: Data Hazard in Pipelining with Example 08:05 min | |
| Control Hazards in Pipelining: Types of Hazards with Example 13:52 min | |
| Write After Read Hazard with Example 09:19 min | |
| Write After Write Hazard: Data Hazards in Pipelining 05:51 min | |
| Register Renaming in Computer Organization 09:56 min | |
| I/O Interface in Computer Organization 05:45 min | |
| Interrupts in 8085 microprocessor 09:37 min | |
| Parallel priority interrupt 07:38 min | |
| Daisy Chaining in Priority Interrupt: Priority Based Interrupt in I/O Organization 06:35 min | |
| Question on Interrupt Handling: I/O organization 08:49 min | |
| Question on DMA (Direct Memory Access): I/O Organization 07:01 min | |
| Operand Forwarding: Data Hazard 11:11 min | |
Data Structures & Algorithms
| Introduction: Data Structure with examples 05:21 min | |
| Addressing in One Dimensional Array: Data Structure 07:32 min | |
| Arrays in Data Structure: Initialization; Declaration; Memory Representation 11:07 min | |
| Linear Search in Data Structure: Time Complexity 12:28 min | |
| Types of Array: One dimensional & Multi-dimensional Array 09:17 min | |
| Introduction: Trees 10:45 min | |
| Preorder; Inorder and Postorder: Tree Traversal 06:47 min | |
| Deletion from Binary Search Tree with Example 08:36 min | |
| Binary Search Tree in Data Structure: Insertion and Traversal in BST 11:02 min | |
| Creating AVL tree: LL, RR, LR, RL Rotation in AVL 10:46 min | |
| Introduction: AVL Tree in Data Structure with Examples 09:54 min | |
| Find Preorder, Postorder & Inorder of Binary Search Tree 09:39 min | |
| Important Question: Binary Search Tree 11:21 min | |
| AVL Tree Creation in Data Structure 12:53 min | |
| Comparison of All Data Structures: Search, Insert & Delete Time Complexity 08:13 min | |
| Binary Search in Data Structure 10:33 min | |
| Introduction to Linked List: Types and Need of linked list 10:17 min | |
| Arrays vs Linked Lists 08:41 min | |
| Single Linked List in Data Structure: Self Referential Structure 08:27 min | |
Topic-wise Video Lectures Covering Every Important CSE Subject
Preparing for a competitive CSE exam means covering a broad syllabus efficiently, and topic-wise video lectures make that possible. The course spans all critical areas including:
- Theory of Computation: DFA, NFA, Pushdown Automata, Turing Machines
- Database Management Systems: Normalization, SQL Queries, Transaction Concurrency
- Compiler Design: Parsing techniques, LL(1), LR(0), SLR(1), and Code Optimization
- Algorithms and Data Structures: AVL Trees, BST, Linked Lists, and Sorting
- Computer Networks: OSI Model, Routing Protocols, Error Detection, and Cryptography
Each topic is treated as a self-contained module, so you can revisit specific areas without having to sit through unrelated content. This targeted approach ensures no concept is left unaddressed before exam day.
Theory of Computation
| Theory of Computation: Syllabus of TOC 06:03 min | |
| Automata in TOC 05:18 min | |
| Introduction to TOC: Language in TOC with Examples 12:21 min | |
| Power of Sigma Σ in TOC: Kleene closure in TOC 08:31 min | |
| What is DFA in TOC? With examples 13:14 min | |
| DFA Example 1: How to Construct DFA in TOC? 08:12 min | |
| DFA Example 2: DFA of language with all strings end with 'a' 05:51 min | |
| DFA Example 3: DFA of language with all strings starting with 'a' and ending with 'b' 08:34 min | |
| DFA Example 6: DFA of all strings in which 2nd symbol is '0' and 4th symbol is '1' 07:19 min | |
| DFA Example 4: DFA of language with all strings Not starting with 'a' OR Not ending with 'b' 07:24 min | |
| DFA Example 5: DFA of all binary strings divisible by 3 07:26 min | |
| What is NFA in TOC: Non Deterministic Finite Automata 09:01 min | |
| DFA vs NFA in TOC in Hindi with examples 07:57 min | |
| Convert NFA to DFA with example 09:37 min | |
| Design NFA of all binary strings in which 2nd last bit is 1: NFA Designing 06:09 min | |
| DFA for Even a and Even b, Even a Odd b, Odd a and Even b, Odd a Odd b 09:35 min | |
| Eliminate Epsilon ε-moves: Conversion from epsilon nfa to nfa 07:40 min | |
| Moore Machine in TOC with example 09:51 min | |
| Limitations of DFA and Applications of DFA in TOC 12:40 min | |
| Mealy Machine in TOC 07:45 min | |
| Difference between Mealy and Moore Machine 07:55 min | |
| Mealy to Moore Conversion with Example 12:11 min | |
| Moore to Mealy Conversion with example 08:46 min | |
| Regular Expressions in TOC with examples 09:59 min | |
| Regular Expressions for Finite Languages Example 1 08:29 min | |
| Minimization of DFA in Hindi with example 17:36 min | |
| Important Questions on Regular Expressions 05:51 min | |
| Regular Expressions for Infinite Languages Example 2 13:46 min | |
| Closure properties of regular languages in TOC 09:33 min | |
| Pumping lemma for regular languages in TOC with examples 12:00 min | |
| How regular languages closure under reversal? Reversal Operation in TOC 06:28 min | |
| Quotient operation in toc with example: Closure Properties 09:52 min | |
| INIT Operation in TOC 05:50 min | |
| Closure Properties Of Various Languages in TOC 12:33 min | |
| Regular languages Not Closed under Infinite Union 03:06 min | |
| Comparison between Languages, Automata, Grammars in TOC 12:21 min | |
| Question on DCFL and CFL 11:05 min | |
| Important Questions on Decidability and closure property 08:38 min | |
| TOP 10 Important questions of Theory of Computation 08:55 min | |
| Homomorphism in Regular Languages: Closure Properties 05:32 min | |
| TOC Most Important 10 Questions with explanation 31:39 min | |
| Inverse Homomorphism in Regular Languages: Closure Properties in TOC 07:13 min | |
| Decidability & Undecidability table in TOC for all languages 07:57 min | |
| CFL and CFG Introduction and Syllabus 04:03 min | |
| Context free grammar in TOC 07:57 min | |
| Convert Context free language to Context free grammar with examples 15:48 min | |
| Pushdown Automata in TOC 10:58 min | |
| Left Most & Right Most Derivation in CFG 06:22 min | |
| Design PDA for 0^n1^2n CFL Language 13:13 min | |
| Design PDA for {w | na(w) = nb(w)} CFL language 11:25 min | |
| Closure Properties of CFL (Context Free Languages) 08:57 min | |
| Remove Null Production from CFG (Context Free Grammar) 07:48 min | |
| Remove Unit Production from CFG(Context Free Grammar) 07:10 min | |
| Introduction to Turing Machine 09:03 min | |
| What is LBA(Linear Bounded Automata)? 04:37 min | |
| Turing Machine for a^nb^n: Design Turing Machine 11:56 min | |
| Turing Machine for a^nb^nc^n: Design Turing Machine 11:18 min | |
| Recursive vs Recursive Enumerable Languages 06:56 min | |
| Turing Machine for 1's Complement: Transition Table & Diagram 08:06 min | |
| Modifications in Turing machine 09:20 min | |
| CNF To GNF: Chomsky to Greibach Normal Form 06:33 min | |
| CYK Algorithm: Membership Algorithm in CFG 17:10 min | |
Compiler Design
| Compiler Design: Syllabus 06:24 min | |
| Phases of Compiler with examples: Compiler Design 14:33 min | |
| Find First() in Compiler Design: First() & Follow() 10:37 min | |
| Lexical Analysis in Compiler Design with Examples 09:10 min | |
| Questions on Lexical Analysis 08:47 min | |
| Parsing & Types of Parsers: Syntax Analysis 09:38 min | |
| LL(1) Parsing Table: Check Whether a Grammar is LL(1) or Not 10:57 min | |
| How to Check a Grammar is LL(1) or Not? 09:12 min | |
| Find FOLLOW() in Compiler Design: Learn First() & Follow() in Easiest way 09:27 min | |
| LR(0) Parsing Table: Check Whether a Grammar is LR(0) or not 16:46 min | |
| What is LL(1) Parser? 09:27 min | |
| SLR(1) Parsing Table: Check Whether a Grammar is SLR(1) or Not 07:46 min | |
| CLR Parsing Table: LR(1) Canonical Items 11:50 min | |
| Difference between LR(0), SLR(1), LALR(1) & CLR(1) using Same example 08:34 min | |
| What is SDT(Syntax Directed Translation) & its Applications: Semantic Analysis 06:31 min | |
| LALR Parsing Table: LALR vs CLR 13:06 min | |
| Difference between LALR & CLR parsing table 17:13 min | |
| How to Parse SDT (Top Down vs Bottom Up Parsing): Syntax Directed Translation 09:06 min | |
| How to Evaluate Arithmetic Expression using SDT: Syntax Directed Translation Example 09:34 min | |
| S-Attributed vs L-Attributed SDT: Types of SDT 10:11 min | |
| What is 3-Address Code in Compiler 05:17 min | |
| Gate Question on S-Attributed and L-Attributed SDT 04:48 min | |
| Intermediate Code Generation with example 08:12 min | |
| What is Code Optimization: Machine Dependent vs Machine Independent Techniques 07:25 min | |
| Peephole Optimization in Compiler 10:19 min | |
| Question on Code Optimization in Compiler 07:09 min | |
| Control Flow Graph: Basic Blocks 10:09 min | |
| Loop Optimization in Compiler 06:56 min | |
| Basic Block & Flow Graph in Compiler: Partition Algorithm in Basic Block 08:31 min | |
| Comparison of all Parsers in Compiler Design 05:27 min | |
| Local vs Global Optimization: Scope of Optimization 08:56 min | |
| Error Detection And Recovery & Lexical Phase Error: Compiler Design 06:38 min | |
| Symbol Table in Compiler Design: Attributes of Symbol Table 08:10 min | |
| Symbol Table Data Structure Implementation 08:28 min | |
| Lexeme vs Tokens in Compiler Design 05:54 min | |
Database Management Systems
| Database Management Systems: Syllabus 18:04 min | |
| Introduction to DBMS (Database Management System) With Real life examples 12:00 min | |
| What is Schema? 04:34 min | |
| File System vs DBMS: Disadvantages of File System & DBMS Advantages 13:00 min | |
| Three Schema Architecture: Three Level of Abstraction 15:25 min | |
| L2 tier and 3 tier Architecture with real life examples 12:57 min | |
| What is Candidate and Primary key 05:12 min | |
| Data Independence ? 10:22 min | |
| What is Primary Key in DBMS: Primary Key with Examples 11:31 min | |
| Foreign Key in DBMS 08:43 min | |
| Insert, Update & Delete from Foreign Key table: Referential Integrity 18:19 min | |
| Question on Foreign Key 08:44 min | |
| Super key in DBMS 09:42 min | |
| Introduction to ER model 08:32 min | |
| Types of Attributes in ER Model 14:02 min | |
| One to One relationship in DBMS 16:44 min | |
| Many to Many Relationship in DBMS: M-N Relationship 10:47 min | |
| One to Many Relationship in DBMS: 1-M Relationship 13:59 min | |
| Question on Minimize tables in ER Model 05:38 min | |
| Normalization in DBMS 12:51 min | |
| Functional Dependency & its properties in DBMS 17:09 min | |
| Finding Closure of Functional dependency in DBMS 17:46 min | |
| First Normal form in DBMS: 1st Normal form 08:29 min | |
| Second Normal Form: 2NF 18:00 min | |
| Third Normal Form in dbms with examples: Normalization 16:26 min | |
| Boyce Codd Normal Form 06:48 min | |
| Minimal Cover in DBMS With Example: Canonical cover 09:09 min | |
| BCNF Always Ensures Dependency Preserving Decomposition? 10:04 min | |
| Lossless and Lossy Decomposition: Fifth (5th) Normal Form 22:17 min | |
| All Normal Forms with Real life examples: 1NF, 2NF, 3NF, BCNF, 4NF to 5NF 11:15 min | |
| Practice Question on Normalization 20:08 min | |
| GATE 2018 Question Explanation of Normalization 19:28 min | |
| How to find out the Normal form of a Relation? 24:03 min | |
| How to Solve Normalization Questions? 09:21 min | |
| Cover and Equivalence of Functional Dependencies 13:24 min | |
| Dependency Preserving Decomposition in DBMS 10:51 min | |
| Dependency Preserving Decomposition 07:20 min | |
| Introduction to Joins and its types: Need of Joins with example 10:41 min | |
| Natural Join operation with Example 16:11 min | |
| Self Join operation with Example 14:37 min | |
| Equi Join operation with Example 14:15 min | |
| Left Outer Join operation with Example 07:48 min | |
| Introduction to Relational Algebra 04:24 min | |
| Right Outer Join operation with Example 08:32 min | |
| Projection in Relational Algebra 06:19 min | |
| Cross/Cartesian Product in Relational Algebra 06:18 min | |
| Selection in Relational Algebra 06:33 min | |
| Union Operation in Relational Algebra 07:20 min | |
| Set Difference in Relational Algebra 06:03 min | |
| Tuple Calculus in DBMS with examples 16:09 min | |
| Division Operation in Relational Algebra 14:43 min | |
| All Types of SQL Commands with Example: DDL, DML, DCL, TCL and CONSTRAINTS 10:32 min | |
| ALTER Command (DDL) in SQL with Implementation on ORACLE 13:09 min | |
| Introduction to Structured Query Language 12:10 min | |
| Create table in SQL with execution: SQL for Beginners 07:25 min | |
| Difference between Delete, Drop & Truncate in SQL 10:19 min | |
| Constraints in SQL 12:01 min | |
| Difference between Alter and Update in SQL with examples 08:01 min | |
| SQL Queries and Subqueries - 1 08:58 min | |
| SQL Queries and Subqueries-2: 2nd Highest Salary & Nested Queries 12:27 min | |
| SQL Queries and Subqueries -4: Having clause 11:02 min | |
| SQL Queries and Subqueries -3: Group By clause 09:12 min | |
| SQL Queries and Subqueries - 6: Use of IN and Not IN 09:14 min | |
| EXIST and NOT EXIST Subqueries - 8 14:09 min | |
| SQL Queries and Subqueries - 5 11:30 min | |
| SQL Queries and Subqueries - 7: Use of IN and Not IN in Subquery 09:40 min | |
| SQL Aggregate Functions - SUM, AVG(n), COUNT, MIN, MAX Functions 11:21 min | |
| Correlated Subquery in SQL with Example 11:43 min | |
| Difference between Joins, Nested Subquery and Correlated Subquery 15:57 min | |
| Find Nth(1st;2nd;3rd....N) Highest Salary in SQL 12:54 min | |
| Introduction to PL-SQL in DBMS 06:25 min | |
| 3 Important Questions on SQL basic Concepts 09:38 min | |
| Introduction to Transaction Concurrency 12:42 min | |
| ACID Properties of a Transaction 13:58 min | |
| Schedule: Serial Vs Parallel Schedule 10:46 min | |
| Transaction States 11:57 min | |
| All Concurrency Problems: Dirty Read, Incorrect Summary, Lost Update, Phantom Read 04:57 min | |
| Write-Read Conflict or Dirty Read Problem 08:24 min | |
| Read-Write Conflict or Unrepeatable Read Problem 07:44 min | |
| Cascading vs Cascadeless Schedule with Example 11:33 min | |
| Irrecoverable Vs Recoverable Schedules in Transactions 06:09 min | |
| Conflict Equivalent Schedules with Example: Transaction concurrency and Control 07:20 min | |
| Conflict Serializability, Precedence Graph: Transaction 12:18 min | |
| Use of View Serializability: Introduction to View Serializability 11:24 min | |
| Introduction to Serializability: Transactions Concurrency and Control 09:17 min | |
| Drawbacks in Shared/Exclusive Locking Protocol with Example: Concurrency Control Part-2 10:59 min | |
| Shared Exclusive Locking Protocol with Example: Concurrency Control -1 06:44 min | |
| Basic Timestamp Ordering Protocol with Example: Concurrency Control 15:11 min | |
| 2 Phase Locking(2PL) Protocol in Transaction Concurrency Control 09:53 min | |
| Drawbacks in 2 Phase Locking(2PL) Protocol with examples: Concurrency Control 10:48 min | |
| Strict 2PL; Rigorous 2PL and Conservative 2PL Schedule: 2 Phase Locking in DBMS 11:30 min | |
| Why Indexing is used: Indexing Beginning 10:20 min | |
| Numerical Example on I/O Cost in Indexing- 2 11:45 min | |
| How to Solve Question on Timestamp Ordering Protocol: Concurrency Control 12:38 min | |
| Numerical Example on I/O Cost in Indexing - 1 12:27 min | |
| Clustered Index in Database with Example 06:46 min | |
| Types Of Indexes 04:38 min | |
| Primary Index With Example 07:56 min | |
| How to find Order of B-Tree 11:14 min | |
| Secondary Index in Database with Example: Multilevel Indexing 13:04 min | |
| Introduction to B-Tree and its Structure: Block Pointer, Record Pointer, Key 10:13 min | |
| Insertion in B-Tree with example 12:48 min | |
| Difference b/w B-Tree & B+Tree 14:58 min | |
| Order of B+ Tree: Order of Leaf Node & Non Leaf Node in B+Tree 10:02 min | |
| Immediate Database Modification: Log Based Recovery Methods 06:19 min | |
| Like Command in SQL with example 10:42 min | |
| Basic PL-SQL Programming(While, For Loop) With Execution - 2 06:12 min | |
| How Aggregate Functions work on NULL Values? 07:23 min | |
| Deferred Database Modification: Log Based Recovery 10:30 min | |
| View in Database: Oracle, SQL Server Views 13:58 min | |
| RAID: RAID 0, RAID 1, RAID 4, RAID 5, RAID 6, Nested RAID 10 Explained 14:35 min | |
| Various objects in Database 06:05 min | |
| ER Model based GATE-2018 Question 08:44 min | |
| Questions on DBMS basic concepts and Data Modelling 10:56 min | |
| Important Questions on Advance DBMS: BIG Data and Data Warehouse 10:17 min | |
| Inner, Left, Right & Full Outer Joins Explanation with Gate-2018 Question 04:03 min | |
| Gate-2018 DBMS Question(Schemas) Explanation 06:53 min | |
| GATE-2018 Question on Relational Algebra 08:56 min | |
Quick Revision Videos for Last-Minute CSE Exam Preparation
When exams are approaching, quick revision video lectures become your best resource for reinforcing what you've already studied. The crash course includes concise, high-yield videos on frequently tested topics like addressing modes, process scheduling algorithms, deadlock avoidance, and propositional logic. Rather than re-reading long notes, watching a focused 10-15 minute video on cache replacement algorithms or 2-Phase Locking protocols can sharpen your recall significantly. These revision videos are particularly useful for consolidating knowledge across the discrete mathematics and operating systems sections, which tend to overlap in exam questions.
Operating Systems
| Operating System: Syllabus 13:01 min | |
| Introduction to Operating System and its Functions 18:59 min | |
| Batch Operating System: Types of Operating System 07:12 min | |
| Process States in Operating System: Schedulers(Long term, Short term, Medium term) 20:54 min | |
| Multiprogramming and Multitasking Operating System 06:34 min | |
| Types of OS(Real Time OS, Distributed, Clustered & Embedded OS) 08:15 min | |
| Questions on Fork System Call With Explanation: Operating System 06:39 min | |
| Fork System call with Example: Fork() system call questions 10:02 min | |
| Important Linux Commands(Operating System) 10:58 min | |
| System Calls in Operating system and its types 10:07 min | |
| User Level Vs Kernel Level Thread 08:29 min | |
| Process Vs Threads in Operating System 11:17 min | |
| User mode and Kernel mode 06:46 min | |
| Process Scheduling Algorithms (Preemption Vs Non-Preemption) 10:31 min | |
| What is Arrival, Burst, Completion, Turnaround, Waiting and Response time in CPU Scheduling 08:59 min | |
| First Come First Serve(FCFS) CPU Scheduling Algorithm with Example 10:34 min | |
| Round Robin(RR) CPU Scheduling Algorithm with Example 16:23 min | |
| Shortest Job First(SJF) Scheduling Algorithm with Example 09:14 min | |
| Shortest Remaining Time First (SJF With Preemption) Scheduling Algorithm with Example 13:37 min | |
| Question on Shortest Job First(SJF) with Preemption Scheduling Algorithm 07:52 min | |
| Preemptive Priority Scheduling Algorithm with Example 10:30 min | |
| Multilevel Feedback Queue Scheduling 05:22 min | |
| Example of Mix Burst Time(CPU & I/O both) in CPU Scheduling 14:19 min | |
| Multilevel Queue Scheduling 03:41 min | |
| Process Synchronization, Process Types, Race Condition 17:02 min | |
| Critical Section Problem, Mutual Exclusion, Progress and Bounded Waiting 25:36 min | |
| Producer Consumer Problem: Process Synchronization Problem in Operating System 26:36 min | |
| Printer-Spooler Problem: Process Synchronization Problem in Operating System 13:15 min | |
| Semaphore, Wait, Signal Operation, Counting Semaphore Example 24:42 min | |
| LOCK Variable in OS: Process Synchronization 07:24 min | |
| Test and Set Instruction in OS: Process Synchronization 09:09 min | |
| Turn Variable, Strict Alternation Method: Process Synchronization 08:21 min | |
| What is Binary Semaphore? 12:23 min | |
| Solution of Producer Consumer Problem using Semaphore 17:30 min | |
| Practice Question on Binary Semaphore in Operating System 16:00 min | |
| DEADLOCK concept an Example and Necessary condition 12:21 min | |
| Solution of Readers-writers Problem using Binary semaphore 21:11 min | |
| Resource Allocation Graph in Deadlock: Single Instance with example 26:18 min | |
| Dining philosophers Problem and Solution using Semaphore in Operating System 35:13 min | |
| Multi-Instance Resource Allocation Graph with Example 21:42 min | |
| Deadlock Handling Methods and Deadlock Prevention 24:49 min | |
| Deadlock Avoidance Banker's Algorithm with Example 24:04 min | |
| GATE 2018 Question on Banker's Algorithm: Deadlock avoidance 16:02 min | |
| Question Explanation on Deadlock 15:46 min | |
| GATE 2018 Question Explanation on deadlock 22:15 min | |
| Memory Management and Degree of Multiprogramming 23:41 min | |
| Memory management Techniques, Contiguous and non-Contiguous 11:46 min | |
| Internal Fragmentation: Fixed size Partitioning in Memory management 18:53 min | |
| GATE Question Solved on First Fit, Best Fit and Worst fit Memory Allocation 14:02 min | |
| Variable size Partitioning: Memory management 15:11 min | |
| First Fit, Next Fit, Best Fit, Worst fit Memory Allocation: Memory Management 16:22 min | |
| GATE 2007 Question Solved on First Fit, Best Fit and Worst fit with timeline 15:41 min | |
| Need of Paging: Memory Management 14:20 min | |
| What is Paging: Memory management 25:54 min | |
| Question Explanation on Logical address and Physical address space 15:25 min | |
| Page Table Entries: Format of Page Table 10:39 min | |
| Question Explanation on Paging: Memory Management 13:52 min | |
| Inverted paging: Memory Management 10:35 min | |
| 2-Level Paging in Operating System: Multilevel Paging 15:45 min | |
| Paging Questions in Operating System 07:53 min | |
| What is Thrashing 08:34 min | |
| Segmentation Vs Paging: Segmentation Working 16:30 min | |
| Overlay: Memory Management 11:12 min | |
| Virtual Memory, Page fault: Significance of virtual memory 20:18 min | |
| Translation Lookaside Buffer(TLB) in Operating System 12:23 min | |
| Belady's Anomaly in FIFO page Replacement with example 12:26 min | |
| Numerical on Translation Lookaside Buffer (TLB) 04:31 min | |
| Page Replacement Introduction:FIFO Page Replacement algorithm 16:07 min | |
| Optimal Page Replacement algorithm 13:07 min | |
| Least Recently Used Page Replacement Algorithm 07:57 min | |
| Most recently used page replacement algorithm 06:42 min | |
| Hard Disk Architecture in Operating System 11:35 min | |
| FCFS in Disk scheduling with Example 08:44 min | |
| Disk Access Time with Example: Seek Time, Rotational Time and Transfer Time 15:13 min | |
| Disk Scheduling Algorithm 06:08 min | |
| SSTF in Disk scheduling with Example 08:30 min | |
| SCAN Algorithm in Disk scheduling with Example 07:54 min | |
| LOOK Algorithm in Disk scheduling with Example 04:28 min | |
| C-SCAN Algorithm in Disk scheduling with Example 05:22 min | |
| C-LOOK Algorithm in Disk scheduling with Example 04:59 min | |
| Important Questions on Operating System 09:41 min | |
| File System in Operating System: Windows, Linux, Unix, Android etc. 09:55 min | |
| File Attributes & Operations in Operating System 11:14 min | |
| Allocation Methods in operating system: Contiguous vs Non Contiguous 05:59 min | |
| Indexed File Allocation in Operating System 10:43 min | |
| Contiguous Allocation: Advantages & Disadvantages 12:37 min | |
| Protection & Security in Operating system 20:54 min | |
| TLBs Toughest Question asked in GATE exam 09:53 min | |
Computer Networks
| Computer Networks and Security: Full Syllabus 07:12 min | |
| Introduction to Computer Network: Need of OSI model 22:08 min | |
| TCP/IP Protocol Suite: Internet Protocol Suite 06:46 min | |
| Physical layer in computer networks: Functions of Physical layer 10:46 min | |
| Topologies in Computer Networks: Part 1 10:43 min | |
| Topologies in Computer Networks: Mesh, Star, Hub, Bus, Hybrid 08:30 min | |
| Various Devices In Computer Networks 03:59 min | |
| Manchester encoding and differential manchester encoding 07:50 min | |
| Types Of Cables in Computer Networks: Coaxial, twisted pair, fibre optic cable 08:19 min | |
| Bridges In Computer Networks: Physical and data link layer device 13:12 min | |
| Repeaters in Computer Networks: Physical layer devices 07:24 min | |
| Hub in Computer Networks: Physical layer devices 05:25 min | |
| Collision Domain Vs. Broadcast Domain: Repeater, Hub, Bridge, Switch, Router 13:52 min | |
| What's the difference between Switch, Hub & Bridge ? 04:59 min | |
| What is Circuit Switching? 10:32 min | |
| Routers in Computer Networks: Physical, data link and network layer device 08:08 min | |
| Unicast; Broadcast & Multicast in Computer Networks 05:53 min | |
| What is Message Switching In Computer Networks? 05:56 min | |
| Packet Switching In Computer Networks 08:28 min | |
| Datagram Switching Vs Virtual Circuit Switching in Packet Switching 11:26 min | |
| Go-Back-N ARQ: Data Link layer 09:40 min | |
| Stop and Wait ARQ protocol: Data link layer 05:56 min | |
| Data link layer in computer Networks and its Responsibilities 19:23 min | |
| Various Flow Control Protocols: Stop Wait, GoBackN & Selective repeat in Data Link Layer 16:16 min | |
| Selective Repeat ARQ: Data Link Layer 07:39 min | |
| Framing in Data Link Layer: Bit Stuffing vs Byte(Character) Stuffing 07:25 min | |
| Introduction to Error detection and Correction 10:44 min | |
| Single Bit Parity along With Hamming Distance Concept 11:39 min | |
| Hamming Code for Error Detection & Correction both with easiest examples 10:59 min | |
| Cyclic Redundancy Check(CRC) for Error Detection and Correction 12:42 min | |
| Various Medium Access Control Protocols in Data Link Layer 08:10 min | |
| What is Pure Aloha: MAC Layer Protocol 10:50 min | |
| Pure Aloha Vs Slotted Aloha 08:17 min | |
| Carrier Sense Multiple Access in Computer Network 10:49 min | |
| CSMA/CA in Computer Network 10:11 min | |
| Carrier Sense Multiple Access/ Collision Detection 14:39 min | |
| Numerical Question on CSMA/CD 06:13 min | |
| Ethernet Frame Format (IEEE-802.3) in Data Link Layer 10:37 min | |
| Token Ring (IEEE 802.5) in Computer Networks 09:43 min | |
| Network Layer, Responsibilities of Network Layer: OSI Model 12:13 min | |
| Class A in IP addressing with Example 23:28 min | |
| Class B in IP addressing with Example 20:35 min | |
| Disadvantages of Classful Addressing: IP addressing 06:12 min | |
| Find Range, Network Id, Host, Broadcast address with Numerical Examples 12:48 min | |
| Class D & Class E in IP addressing with Example 10:38 min | |
| Class C in IP addressing with Example 14:22 min | |
| What is Classless Addressing (CIDR) 16:42 min | |
| Subnetting in Classful Addressing with Examples 19:17 min | |
| Variable Length Subnet Masking(VLSM) 14:03 min | |
| Subnetting in CIDR Addressing: Classless Interdomain Routing 11:11 min | |
| Numerical Question on CIDR: Classless Addressing 12:28 min | |
| VLSM in Classless Addressing(CIDR): Variable Length Subnet Masking 13:08 min | |
| IPv4 Header Format 18:25 min | |
| Fragmentation of IPv4 Datagram: Identification, Flags and Fragment Offset 13:22 min | |
| Options & Padding in IPv4 Header 08:22 min | |
| IPv6 Header Format 13:07 min | |
| Distance vector routing algorithm 26:00 min | |
| What are Routing Protocols? Various types of Routing Protocols 06:57 min | |
| Count to Infinity Problem in Distance Vector Routing 10:41 min | |
| Link state routing in computer networks 14:36 min | |
| ARP Explained- Address Resolution Protocol 08:13 min | |
| NAT Explained - Network Address Translation 09:48 min | |
| Transport Layer, Responsibilities of Transport Layer: OSI Model 16:11 min | |
| TCP: Transmission control protocol - 1 14:51 min | |
| TCP connection Establishment and connection Termination 15:12 min | |
| TCP: Transmission control protocol - 2 12:31 min | |
| TCP Data Transfer: Piggybacking & Pure Acknowledgement 11:24 min | |
| Connection Termination in TCP 11:15 min | |
| UDP (User Datagram Protocol) header in Computer Networks 11:48 min | |
| TCP Congestion Control in Computer Networks 12:39 min | |
| Advantages of UDP protocol over TCP: Transport Layer 12:07 min | |
| Session Layer of OSI model 10:38 min | |
| HTTP, FTP, SMTP, POP: All Application Layer Protocols 17:45 min | |
| Presentation layer in computer networks 06:27 min | |
| Domain Name System (DNS) in computer Networks 09:22 min | |
| Application layer of OSI model 15:44 min | |
| Domain Name Server(DNS) & its types 06:52 min | |
| Persistent vs Non-Persistent HTTP 07:51 min | |
| Cryptography in computer network 07:39 min | |
| Important Question on Network Security: Symmetric Key Cryptography 08:26 min | |
| Symmetric Key Cryptography in Network Security with examples 06:14 min | |
| Asymmetric key Cryptography with example 08:23 min | |
| What is Firewalls and How it Works? 13:45 min | |
| RSA Algorithm in Network Security with examples 11:28 min | |
| What is Application(Proxy) Firewall ? 05:18 min | |
| Important Questions on Computer Networks 12:46 min | |
| All Networking Protocols & Devices 15:52 min | |
| Need of IPv6 Protocol 07:56 min | |
| Top Linux Network Commands 13:40 min | |
| Socket Programming in Computer Networks 08:16 min | |
| Transport Mode Vs Tunnel Mode in IPSec 08:15 min | |
| What is IPSec Protocol? 06:53 min | |
| Basics of Communication 08:38 min | |
| Why both IP & Port address is used for Connection? 10:04 min | |
Propositional Logic
| Introduction & Motivation to Propositional Logic 08:14 min | |
| Propositional Logic, Propositional Variables & Compound Propositions 06:28 min | |
| Negation, Conjunction & Disjunction 06:09 min | |
| Exclusive OR: Logical Operators 06:51 min | |
| Implication - 1 10:18 min | |
| Implication - 2 15:24 min | |
| Implication - 3 07:56 min | |
| Converse, Contrapositive & Inverse 03:47 min | |
| Biconditional Operator 06:25 min | |
| Precedence of Logical Operators 06:20 min | |
| Translating Sentences to Logical Expressions 10:16 min | |
| Propositional Logic: Puzzle - 1 11:18 min | |
| Propositional Logic: Puzzle - 2 09:57 min | |
| Tautology, Contradiction, Contingency & Satisfiability 05:05 min | |
| Propositional Logic: Solved Problem - 1 05:49 min | |
| Propositional Logic: Logical Equivalences 17:23 min | |
| Propositional Logic: Solved Problem - 2 06:13 min | |
| Propositional Logic: Solved Problem - 3 04:31 min | |
| Propositional Logic: Solved Problem - 4 05:11 min | |
| Propositional Logic: Solved Problem - 5 05:25 min | |
| Propositional Logic: Solved Problem - 6 06:08 min | |
| Propositional Logic: Solved Problem - 7 06:31 min | |
| Rules of Inference: Basic Terminology 06:14 min | |
| Definition & Types of Inference Rules 07:44 min | |
| Arguments Building Using Rules of Inference - 1 05:39 min | |
| Arguments Building Using Rules of Inference - 2 05:57 min | |
| Checking the Validity of an Argument 03:58 min | |
| Rules of Inference: Solved Problem - 1 03:18 min | |
| Rules of Inference: Solved Problem - 2 04:07 min | |
| Limitation of Propositional Logic 04:54 min | |
| First Order Logic 05:20 min | |
| Examples - Finding the Truth Values of Predicates 02:30 min | |
| Quantifiers: Propositional Logic 05:05 min | |
| Universal Quantifiers 03:48 min | |
| Universal Quantifiers with Counter Examples 03:42 min | |
| Expressing Quantifications 03:12 min | |
| Existential Quantifiers 04:06 min | |
| Examples - Existential Quantifiers 04:46 min | |
| Quantifiers having Restricted Domain 03:39 min | |
| Logical Equivalences: Predicates & Quantifiers - 1 09:12 min | |
| Logical Equivalences: Predicates & Quantifiers - 2 08:48 min | |
| Negating the Quantified Expressions - 1 03:33 min | |
| Negating the Quantified Expressions - 2 03:26 min | |
| Examples: Negating the Quantified Expressions 03:05 min | |
| Translating English Sentences to Logical Expressions 11:19 min | |
| First Order Logic (Solved Problems) - 1 05:14 min | |
| First Order Logic (Solved Problems) - 2 04:58 min | |
| First Order Logic (Solved Problems) - 3 04:44 min | |
| First Order Logic (Solved Problems) - 4 04:52 min | |
| First Order Logic (Solved Problems) - 5 06:56 min | |
| Introduction: Nested Quantifiers 03:17 min | |
| Nested Quantifiers (Solved Example) - 1 07:34 min | |
| Nested Quantifiers (Solved Example) - 2 05:43 min | |
| Nested Quantifiers (Solved Example) - 3 04:29 min | |
| Nested Quantifiers (Translating English Statements) - 1 05:05 min | |
| Nested Quantifiers (Translating English Statements) - 2 04:14 min | |
| Nested Quantifiers (Translating English Statements) - 3 03:02 min | |
| Nested Quantifiers (Translating English Statements) - 4 04:45 min | |
| Nested Quantifiers (Translating English Statements) - 5 04:29 min | |
| Negation of Nested Quantifiers 03:08 min | |
| Negation of Nested Quantifiers (Example 2) 02:40 min | |
| Negation of Nested Quantifiers (Example 3) 02:37 min | |
| The Resolution Principle - Preliminaries 05:25 min | |
| Theorem Proof - The Resolution Principle 03:50 min | |
| The Resolution Principle - Proving if an Argument is Valid 02:32 min | |
| Solved Problems of The Resolution Principle 07:04 min | |
| Fallacies - Propositional Logic 05:35 min | |
| Rules of Inference for Quantified Statements - 1 05:23 min | |
| Rules of Inference for Quantified Statements - 2 03:09 min | |
| Universal Modus Ponens Rule 02:51 min | |
| Universal Modus Tollens Rule 02:14 min | |
How CSE Video Lectures Help You Tackle GATE-Level Questions
Many videos in this course are directly aligned with previous year GATE questions, giving you an exam-oriented perspective right from your first watch. Instructors walk through solutions to questions on topics such as Set Associative Cache Mapping, Banker's Algorithm, and Normalization, explaining not just the answer but the reasoning behind it. This method builds the analytical thinking required for competitive CSE examinations, where tricky application-based questions are the norm. Watching these worked examples helps bridge the gap between theoretical understanding and actual problem-solving under exam conditions.
Set Theory and Group Theory
| Introduction to Set Theory - Set, Subset & Proper Subset 09:23 min | |
| Power Set - Set Theory & Algebra 03:55 min | |
| Relation in Set Theory 07:24 min | |
| Reflexive Relation with Examples 11:41 min | |
| How Many Reflexive Relations Possible? 07:55 min | |
| Irreflexive Relation with Examples 07:28 min | |
| Symmetric Relation with Examples 06:40 min | |
| Antisymmetric Relation with Examples 06:54 min | |
| Asymmetric vs Antisymmetric Relation 06:53 min | |
| Transitive Relation 05:52 min | |
| Equivalence Relation 06:12 min | |
| Partial Order Relation - POSET 08:26 min | |
| Totally Ordered Set 07:35 min | |
| Comparison of All Relations - Reflexive, Irreflexive etc. 16:30 min | |
| Introduction to Group Theory 04:29 min | |
| Algebraic Structure 08:07 min | |
| Semigroup in Group Theory 08:22 min | |
| Introduction to Monoid - Group Theory 07:39 min | |
| Introduction to Group with Examples 08:24 min | |
| Abelian Group with Examples 05:32 min | |
| Introduction to Function 07:39 min | |
| How many Functions Possible - Counting Functions 07:50 min | |
| One to One Function - Injective Function 07:53 min | |
| ONTO Function - Surjective Function 08:01 min | |
| Bijective Function - Bijection 03:22 min | |
Graph Theory
| Introduction to Graph Theory - Basics of Graph Theory 11:03 min | |
| Handshaking Theorem 07:43 min | |
| Regular Graph Vs Complete Graph 07:25 min | |
| Havel Hakimi Theorem 08:37 min | |
| Difference Between Walk, Trail, Path, Circuit & Cycle 09:22 min | |
| Types of Simple Graph 12:59 min | |
| Questions Related to Graph Theory 09:03 min | |
| Question on Planar Graph 06:45 min | |
| Isomorphism: Graph Theory 08:35 min | |
| Euler Graph in Graph Theory 06:45 min | |
| Hamiltonian Graph - Hamiltonian Path & Circuit 08:38 min | |
Combinatorics
| Combinatorics: Counting for Selection 53:20 min | |
| Combinatorics: Counting for Distribution - 1 32:11 min | |
| Combinatorics: Counting for Distribution - 2 26:33 min | |
| Combinatorics: Some Counting Problems 25:27 min | |
| Counting using Recurrence Relations - 1 21:30 min | |
| Counting using Recurrence Relations - 2 20:21 min | |
| Solving Recurrence Relations - 1 17:17 min | |
| Solving Recurrence Relations - 2 20:20 min | |
| Asymptotic Relations & Notation - 1 16:58 min | |
| Asymptotic Relations & Notation - 2 20:41 min | |
| Asymptotic Relations & Notation - 3 21:17 min | |
| Asymptotic Relations & Notation - 4 19:36 min | |
| Generating Functions - 1 20:54 min | |
| Generating Functions - 2 14:26 min | |
| Generating Functions - 3 15:46 min | |
| Generating Functions - 4 15:05 min | |
| Combinatorics Revision 09:30 min | |
Linear Algebra
| Matrix & Its Types 03:17 min | |
| Addition, Subtraction & Multiplication of Matrices 07:00 min | |
| Trace, Transpose & Conjugate of Matrix 06:33 min | |
| Finding Determinant of Matrix 07:21 min | |
| Properties of Determinants 04:04 min | |
| Inverse of Matrix 07:51 min | |
| Solving System of Equations 04:31 min | |
| Gauss Jordan Elimination 08:15 min | |
| Numericals on System of Equations 05:36 min | |
| LU Decomposition Method 03:49 min | |
| Finding Eigenvalues 04:29 min | |
| Properties of Eigenvalues 05:48 min | |
| Finding Eigenvectors 02:55 min | |
| Cayley Hamilton Theorem 02:49 min | |
Calculus
| Calculus: Limits 32:59 min | |
| Maxima & Minima (for Single Variable) - 1 31:59 min | |
| Maxima & Minima - 2 12:30 min | |
| Maxima & Minima (For Two Variables)- 3 20:47 min | |
| Integral Calculus - 1 25:39 min | |
| Integral Calculus - 2 24:56 min | |
| Vector Calculus: Gradient, Divergence & Curl 37:46 min | |
| Double & Triple Integrals 26:36 min | |
| Green, Gauss & Stokes Theorem 26:13 min | |
| Gate Previous Year Question: Calculus - Limit 17:22 min | |
| Calculus: Continuity 23:35 min | |
| Calculus: Differentiation 13:07 min | |
| Gate Previous Year Question: Continuity - 1 20:51 min | |
| Gate Previous Year Question: Continuity - 2 20:04 min | |
Probability and Statistics
| Introduction to Probability 47:57 min | |
| Question Discussion: Basic Probability - 1 27:54 min | |
| Question Discussion: Basic Probability - 2 23:30 min | |
| Question Discussion: Basic Probability - 3 24:35 min | |
| Classification of Compound Events 29:29 min | |
| Dependent & Independent Events 32:03 min | |
| Questions based on Events - 1 24:47 min | |
| Question based on Events - 2 40:36 min | |
| Concept of Conditional Probability 23:02 min | |
| Relationship between Conditional probability & Bayes Theorem 15:41 min | |
| Questions based on Conditional probability & Bayes Theorem - 1 15:08 min | |
| Questions based on Conditional probability & Bayes Theorem - 2 17:10 min | |
| Introduction to Random Variable - 1 21:39 min | |
| Introduction to Random Variable - 2 25:05 min | |
| Discrete & Continuous Random Variables 15:33 min | |
| Important Properties of Expectations 19:04 min | |
| Probability Distribution 13:31 min | |
| Question on Random Variables & Probability and some tricks - 1 42:23 min | |
| Question on Random Variables & Probability and some tricks - 2 39:40 min | |
| Binomial Distribution - 1 25:44 min | |
| Binomial Distribution - 2 26:45 min | |
| Question on Binomial Distribution 39:15 min | |
| Uniform Distribution & Its Questions 24:34 min | |
| Normal Distribution - 1 34:13 min | |
| Normal Distribution - 2 19:11 min | |
