Gate Smashers
Videos from Gate Smashers
Page 4 of 6 • 126 total videos
9:59
Lec-27: Regular Expressions in TOC with examples | Formal Definition
Gate Smashers
1.5M views
17:36
Lec-26: Minimization of DFA in Hindi with example | TOC
Gate Smashers
1.6M views
9:51
Understanding Moore Machine in Theory of Computation with Example
Gate Smashers
1.3M views
9:35
Lec-17: DFA for Even and Odd Combinations of 'a' and 'b'
Gate Smashers
1.0M views
9:37
Lec-16: Convert NFA to DFA with example in Hindi | How to Convert NFA to DFA
Gate Smashers
2.0M views
7:57
Lec-14: DFA vs NFA in TOC in Hindi with examples | Must Watch
Gate Smashers
1.1M views
9:01
Lec-13: What is NFA in TOC in Hindi | Non Deterministic Finite Automata
Gate Smashers
1.3M views
7:19
DFA for Strings with Specific Symbol Positions: 2nd Symbol '0' and 4th Symbol '1'
Gate Smashers
791.9K views
7:26
Lec-12: DFA of all binary strings divisible by 3 | DFA Example 5
Gate Smashers
1.1M views
8:12
Lec-7: DFA Example 1 | How to Construct DFA in TOC
Gate Smashers
1.5M views
13:14
Lec-6: What is DFA in TOC with examples in hindi
Gate Smashers
2.0M views
11:08
Lec-5: What is Grammar in TOC | Must Watch
Gate Smashers
1.3M views
5:18
Lec-3: What is Automata in TOC | Theory of Computation
Gate Smashers
1.3M views
12:21
Lec-2: Introduction to TOC | What is Language in TOC with Examples in Hindi
Gate Smashers
1.4M views
6:03
Lec-1: Syllabus of TOC(Theory of Computation) for GATE | UGC NTA NET | Imp Points
Gate Smashers
2.6M views
9:08
L-5.1: Understanding Dynamic Programming | Comparing Greedy and Dynamic Programming Algorithms
Gate Smashers
953.6K views
11:17
L-4.8: Kruskal Algorithm for Minimum Spanning Tree in Hindi | Algorithm
Gate Smashers
2.2M views
7:32
L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques
Gate Smashers
1.2M views
8:34
L-3.6: How Bubble Sort Works | Performance of Bubble Sort | All Imp Points with Example | Algorithm
Gate Smashers
992.6K views
13:27
L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer
Gate Smashers
3.1M views
14:25
L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm
Gate Smashers
2.9M views
7:51
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA
Gate Smashers
1.5M views
12:20
Lec-21: Propositional Logic in Artificial Intelligence | Knowledge Representation | All Imp Points
Gate Smashers
1.1M views
8:11
What is Constraint Satisfaction | Constraint Satisfaction Problem (CSP) in AI with Example
Gate Smashers
803.7K views