Summaries of Gate Smashers Videos 📚
Watch your favorite videos and the summaries on Glasp

Lec-20: Knowledge Representation and Reasoning | Logic, Semantic Net, Frames etc.
Gate Smashers

L-3.12: Solution of Readers-writers Problem using Binary semaphore
Gate Smashers

Lec-113: Secondary Index in Database with Example | Multilevel Indexing
Gate Smashers

What Is an Operating System and Its Key Functions?
Gate Smashers

Lec-3: Introduction to Cloud 🌧️ Computing with Real Life Examples | Key Characteristics & Benefits
Gate Smashers

What Are Big O, Big Omega, and Theta Notations?
Gate Smashers

Lec-112: Clustered Index in Database with Example
Gate Smashers

L-5.2: Memory management Techniques | Contiguous and non-Contiguous | Operating System
Gate Smashers

What Is Computer Organization and Architecture Syllabus?
Gate Smashers

What Are the Key Differences Between Datagram and Virtual Circuit Switching?
Gate Smashers

How Does FCFS CPU Scheduling Work With Examples?
Gate Smashers

What Are Database Normal Forms and Their Importance?
Gate Smashers

What Are Intelligent Agents in AI?
Gate Smashers

What Is a System Call in an Operating System?
Gate Smashers

How Does Indexing Reduce Database I/O Cost?
Gate Smashers

How to Calculate FCFS Disk Head Movement
Gate Smashers

What Are the Phases of a Compiler?
Gate Smashers

How to Use EXISTS and NOT EXISTS in SQL Queries
Gate Smashers

How Does CIDR Allocate IPv4 Address Blocks?
Gate Smashers

L-1.4:Types of Buses (Address, Data and Control) in Computer Organization and Architecture
Gate Smashers

Lec-24: Model Based Reflex Agent in Artificial Intelligence in HINDI with Real Life Examples
Gate Smashers

Lec-10: Repeaters in Computer Networks | Physical layer devices
Gate Smashers

L-1.2: Batch Operating System | Types of Operating System
Gate Smashers

What Is the Prototyping Model in Software Engineering?
Gate Smashers

Agile in Software Engineering
Gate Smashers

What Are the Main Cable Types in Computer Networks?
Gate Smashers

How Do AI Game-Playing Algorithms Work?
Gate Smashers

Lec-59: How to Create AVL tree | LL, RR, LR, RL Rotation in AVL | Data Structure
Gate Smashers

What Are Goal-Based Agents in Artificial Intelligence?
Gate Smashers

How Does Quick Sort Work and What Is Its Performance?
Gate Smashers

How Do B-Trees and B+ Trees Differ in DBMS?
Gate Smashers

What Is Breadth First Search (BFS) in AI?
Gate Smashers

What Are the Main Methods for Handling Deadlocks?
Gate Smashers

What Is Process Synchronization and Why Is It Important?
Gate Smashers

Lec-60: All Types of SQL Commands with Example | DDL, DML, DCL, TCL and CONSTRAINTS | DBMS
Gate Smashers

What Is Schema in a Database and How Is It Defined?
Gate Smashers

What Is a Database Transaction and How Does It Work?
Gate Smashers

What Is Bidirectional Search and How Does It Work?
Gate Smashers

How Does the UDP Header Work in Computer Networks?
Gate Smashers

What Is the Critical Section Problem in Operating Systems?
Gate Smashers

What Is 2-Tier vs 3-Tier Architecture in DBMS?
Gate Smashers

How to Find Candidate Keys Using Closure Method in DBMS
Gate Smashers

How Does Variable Partitioning Manage Memory?
Gate Smashers

What Is an Entity-Relationship Model and Its Purpose?
Gate Smashers

L-3.7: GATE 2005 Question on Direct Mapping | Cache Mapping Questions | Computer Organization
Gate Smashers

L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them
Gate Smashers

How Does Huffman Coding Compress Data With Example?
Gate Smashers

Lec-12: Insert, Update & Delete from Foreign Key table | Referential Integrity
Gate Smashers

Lec-12: Bridges In Computer Networks | Physical and data link layer device
Gate Smashers

Why Is UDP Preferred Over TCP in Some Applications?
Gate Smashers

What Is the Divide and Conquer Approach in Algorithms?
Gate Smashers

How to Use SQL Aggregate Functions in Queries
Gate Smashers

Lec-12: DFA of all binary strings divisible by 3 | DFA Example 5
Gate Smashers

I/O Interface in Computer Organization
Gate Smashers

What Does the Data Link Layer Do in Networks?
Gate Smashers

What Is the Producer-Consumer Problem in Operating Systems?
Gate Smashers

What Is Software Engineering and How Did It Evolve?
Gate Smashers

File System vs DBMS: Why DBMS Replaced File Systems
Gate Smashers

What Are the Key Topics in Operating System Syllabus?
Gate Smashers

How Does Circuit Switching Work in Networks?
Gate Smashers

L-2.8: Recurrence Relation T(n)=T(√n)+logn | Master Theorem
Gate Smashers

Lec-81: Symmetric Key Cryptography in Network Security with examples
Gate Smashers

Lec-1: Computer Networks and Security Full Syllabus for GATE, UGC NET,DSSSB,NIELIT & University exam
Gate Smashers

Lec-100:Shared Exclusive Locking Protocol with Example | Concurrency Control | DBMS | Part-1
Gate Smashers

How to Use Banker's Algorithm for Deadlock Avoidance
Gate Smashers

L-6.1: What is hashing with example | Hashing in data structure
Gate Smashers

How Does a Primary Index Speed Up DBMS Search?
Gate Smashers

Lec-65: Difference between Delete, Drop & Truncate in SQL | DBMS
Gate Smashers

How Do Utility-Based Agents Choose Actions?
Gate Smashers

How to Solve T(n)=8T(n/2)+n^2 by Master Theorem
Gate Smashers

How to Calculate Database Search I/O Cost
Gate Smashers

Lec-3: Uninformed Vs Informed Search in Artificial Intelligence with Example
Gate Smashers

L-1.5: Process States in Operating System| Schedulers(Long term,Short term,Medium term)
Gate Smashers

How Do Semaphores Solve the Producer Consumer Problem?
Gate Smashers

Lec-44: Natural Join operation with Example | Database Management System
Gate Smashers

Lec-75: Application layer of OSI model in Hindi | Application layer protocols & Port no
Gate Smashers

L-3.5: LOCK Variable in OS | Process Synchronization
Gate Smashers

Lec-67: SQL Queries and Subqueries (part-1) | Database Management System
Gate Smashers

What Is a Hub in Computer Networks and How Does It Work?
Gate Smashers

How Do the Three Main Machine Learning Types Differ?
Gate Smashers

Lec-20: Unicast, Broadcast & Multicast in Computer Networks
Gate Smashers

What Is Pure Aloha and How Does It Work?
Gate Smashers

L-1.4: Types of OS(Real Time OS, Distributed, Clustered & Embedded OS)
Gate Smashers

What Are Addressing Modes in Computer Architecture?
Gate Smashers

Unit Testing with examples in Software Engineering
Gate Smashers

How to Perform BFS and DFS in Graphs
Gate Smashers

How Does Depth First Search Work in AI Search?
Gate Smashers

Lec-58: Tuple Calculus in DBMS with examples
Gate Smashers

What Is Selection Sort and How Does It Work?
Gate Smashers

L-3.14: Insertion in Heap Tree | Max-Heap & Min-Heap Creation | Time Complexities
Gate Smashers

What Is Direct Mapping in Cache Memory?
Gate Smashers

How to Solve T(n) = T(n-1) + log n
Gate Smashers

L-5.3: Internal Fragmentation | Fixed size Partitioning | Memory management | Operating System
Gate Smashers

Risk Assessment with examples | Risk Management | Software Engineering
Gate Smashers

Lec-96: Introduction to Serializability | Transactions Concurrency and Control | DBMS
Gate Smashers

What Causes Deadlock in an Operating System?
Gate Smashers

What Is the Difference Between Multiprogramming and Multitasking?
Gate Smashers

What Are the Different Types of Attributes in ER Models?
Gate Smashers

What Is Class A in IP Addressing and Its Range?
Gate Smashers

How to Solve Non-Preemptive SJF Scheduling
Gate Smashers

Why Is Indexing Used in DBMS?
Gate Smashers

L-1.7: Question#1 on Comparison of Various Time Complexities | GATE Questions
Gate Smashers

AI Syllabus for NTA UGC NET: Priority Topics to Study
Gate Smashers

Lec-9: What is CANDIDATE KEY and PRIMARY key | Full Concept | Most suitable examples | DBMS
Gate Smashers

What Should a Cloud Computing Syllabus Cover?
Gate Smashers

How Do Preemptive CPU Scheduling Algorithms Work?
Gate Smashers

What Problems Can Occur in Two-Phase Locking?
Gate Smashers

L-1.17: Register Stack Organisation | Zero Address Instructions | COA
Gate Smashers

How Does a Simple Reflex Agent Work in AI?
Gate Smashers

What Are the Different Types of Registers in Computer Architecture?
Gate Smashers

What Is SQL and Which Topics Matter Most?
Gate Smashers

What Are Collision and Broadcast Domains in Networks?
Gate Smashers

What Is the Traveling Salesman Problem and How to Solve It?
Gate Smashers

How Does a Common Bus Simplify CPU Transfers?
Gate Smashers

What Is the Classical Waterfall Model in Software Development?
Gate Smashers

How Do SQL Joins and Subqueries Differ?
Gate Smashers

What Is a Database Management System (DBMS)?
Gate Smashers

How to Find an MST Using Kruskal's Algorithm
Gate Smashers

What Is Alpha-Beta Pruning in Game Trees?
Gate Smashers

How Do Counting Semaphores Synchronize Processes?
Gate Smashers

L-1.15: Single Accumulator CPU Organisation | Single Address Instructions in Computer Organisation
Gate Smashers

How Does Test-and-Set Ensure Mutual Exclusion?
Gate Smashers

What Does the OSI Physical Layer Do?
Gate Smashers

Lec-15: What is Hypervisor | Types of Hypervisor
Gate Smashers

What Is the Software Engineering Syllabus and Its Importance?
Gate Smashers

Lec-8: DFA Example 2 | DFA of language with all strings end with 'a'
Gate Smashers

Lec-5: What is Grammar in TOC | Must Watch
Gate Smashers

L-1.2: Von Neumann's Architecture | Stored Memory Concept in Computer Architecture
Gate Smashers

What Are Greedy Algorithms and How Do They Work?
Gate Smashers

Verification vs Validation in Software Engineering
Gate Smashers

L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA
Gate Smashers

Lec-18: One to One relationship in DBMS in Hindi
Gate Smashers

What Is Lossless vs Lossy Decomposition in Databases?
Gate Smashers

Lec-19: What is Message Switching In Computer Networks
Gate Smashers

How to Find a Project's Critical Path Using CPM
Gate Smashers

Lec-9: Binary to Gray Code Conversion & Vice-versa
Gate Smashers

How to Solve the 8-Puzzle with Heuristic Search
Gate Smashers

Perfective, Preventive, Adaptive, Corrective Maintenance in Software Engineering
Gate Smashers

How to Analyze Algorithms Before and After Execution
Gate Smashers

How Does Backtracking Solve CSP Problems?
Gate Smashers

What is Constraint Satisfaction | Constraint Satisfaction Problem (CSP) in AI with Example
Gate Smashers

What Is the OSI Model and Why Is It Needed?
Gate Smashers

What Is State Space Search and How Does It Work?
Gate Smashers

L-1.10: User mode and Kernel mode in operating system in hindi
Gate Smashers

What Is Manchester Encoding and How Does It Work?
Gate Smashers

L-3.7: Turn Variable | Strict Alteration Method | Process Synchronization
Gate Smashers

What Is PL-SQL and How Is It Used in Databases?
Gate Smashers

Lec-14: A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example
Gate Smashers

Lec-77: Domain Name Server(DNS) & its types in Hindi | All about DNS
Gate Smashers

L-5.19: Virtual Memory | Page fault | Significance of virtual memory | Operating System
Gate Smashers
Summarize YouTube Videos and Get Video Transcripts with 1-Click
Download browser extensions on:
Try YouTube Summary with ChatGPT & Claude or YouTube Transcript Generator