Gate Smashers

Videos from Gate Smashers

Page 4 of 7 β€’ 154 total videos

15:32

L-3.7: Insertion Sort - Time Complexity, Stability, and In-Place Sorting Analysis

Gate Smashers
991.3K views
9:55

Understanding File Systems in Windows, Linux, Unix & Android πŸ“

Gate Smashers
1.1M views
10:13

Lec-100: Mastering B-Trees – Structure, Pointers & Keys Explained πŸ“š

Gate Smashers
1.1M views
9:03

Turing Machine Explained in Hindi: Basics & Definition πŸ“š

Gate Smashers
1.1M views
7:10

Remove Unit Production from CFG in Hindi

Gate Smashers
452.7K views
7:48

Lec-54: Removing Null Productions from Context-Free Grammar with Example in Hindi

Gate Smashers
506.0K views
13:13

Designing a PDA for the 0ⁿ1²ⁿ Context-Free Language | Essential Tutorial

Gate Smashers
1.2M views
10:58

Pushdown Automata (PDA) Explained in Hindi | Complete TOC Guide πŸ“š

Gate Smashers
1.3M views
15:48

Lec-48: Converting Context-Free Languages to Context-Free Grammars with Examples | TOC

Gate Smashers
1.1M views
7:57

Understanding Context-Free Grammar in Theory of Computation (TOC) πŸ“š

Gate Smashers
1.4M views
4:03

Lec-46: Introduction to CFL & CFG – Concepts, Syllabus & More πŸ“š

Gate Smashers
410.0K views
7:57

Decidability & Undecidability Table Explained | All Languages in TOC πŸ“Š

Gate Smashers
266.7K views
5:32

Homomorphism in Regular Languages: Closure Properties Explained πŸ“š

Gate Smashers
176.2K views
3:06

Lec-36: Regular languages Not Closed under Infinite Union | TOC

Gate Smashers
156.9K views
6:28

Lec-33: Reversal Operation in Theory of Computation

Gate Smashers
285.7K views
5:50

Lec-35: Understanding the INIT Operation in Theory of Computation πŸ”

Gate Smashers
157.6K views
12:00

Lec-31: Understanding the Pumping Lemma for Regular Languages in Theory of Computation

Gate Smashers
1.3M views
8:29

Master Regular Expressions for Finite Languages | Lec-28 with Examples πŸ“š

Gate Smashers
780.6K views
9:59

Master Regular Expressions in Theory of Computation (TOC) | Clear Examples & Formal Definitions

Gate Smashers
1.5M views
17:36

DFA Minimization in Hindi | Easy Step-by-Step Explanation with Examples ✨

Gate Smashers
1.6M views
7:55

Mealy vs Moore Machine: Key Differences in Hindi

Gate Smashers
667.0K views
7:45

Mealy Machine in TOC | Formal Definition & Explanation πŸ€–

Gate Smashers
961.6K views
9:51

Understanding Moore Machine in Theory of Computation with Example

Gate Smashers
1.3M views
12:40

DFA Limitations & Applications in TOC | Hindi

Gate Smashers
515.3K views