Gate Smashers
Videos from Gate Smashers
Page 3 of 6 • 126 total videos
5:33
L-6.2: Collision Resolution Techniques in Hashing | What are the collision resolution techniques?
Gate Smashers
1.1M views
5:53
L-6.1: What is hashing with example | Hashing in data structure
Gate Smashers
2.1M views
11:18
Designing a Turing Machine for a^n b^n c^n
Gate Smashers
723.8K views
11:56
Lec-58: Turing Machine for a^nb^n | Design Turing Machine
Gate Smashers
964.8K views
4:37
Lec-57: What is LBA(Linear Bounded Automata) | All Points Covered | Theory of Automata
Gate Smashers
368.7K views
12:03
SDLC Life Cycle for Beginners | Software Development Life Cycle with Real life example
Gate Smashers
2.4M views
20:54
Lec-8: Protection & Security in Operating system | Full OS playlist
Gate Smashers
457.3K views
15:32
L-3.7: Insertion Sort - Time Complexity, Stability, and In-Place Sorting Analysis
Gate Smashers
991.3K views
9:55
L-7.1: File System in Operating System | Windows, Linux, Unix, Android etc.
Gate Smashers
1.1M views
10:13
Lec-100: Introduction to B-Tree and its Structure | Block Pointer, Record Pointer, Key
Gate Smashers
1.1M views
9:03
Lec-56: Introduction to Turing Machine and its Definition in Hindi | TOC
Gate Smashers
1.1M views
7:48
Lec-54: Removing Null Productions from Context-Free Grammar with Example in Hindi
Gate Smashers
506.0K views
13:13
Lec-51: Design PDA for 0^n1^2n CFL Language | Very Important| Must Watch
Gate Smashers
1.2M views
10:58
Lec-50: What is Pushdown Automata in TOC | Definition & Explanation in Hindi
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
Lec-47: What is Context free grammar in TOC | Formal Definition
Gate Smashers
1.4M views
4:03
Lec-46: CFL and CFG Introduction and Syllabus discussion
Gate Smashers
410.0K views
7:57
Lec-45: Decidability & Undecidability table in toc for all languages
Gate Smashers
266.7K views
5:32
Lec-43: Homomorphism in Regular Languages | closure Properties | TOC
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: INIT Operation in TOC
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
Lec-28: Regular Expressions for Finite Languages Example 1 | TOC
Gate Smashers
780.6K views