Number System Part B
Dr.G.M. Karthik
Number System Part B
51:36
Number System Part A
Dr.G.M. Karthik
Number System Part A
38:34
Hashing
Dr.G.M. Karthik
Hashing
42:10
Programming Techniques in Turing machine
Dr.G.M. Karthik
Programming Techniques in Turing machine
48:03
Sorting Techniques
Dr.G.M. Karthik
Sorting Techniques
25:31
Turing Machine Example Part 1
Dr.G.M. Karthik
Turing Machine Example Part 1
44:47
Computable Language and Function with TM
Dr.G.M. Karthik
Computable Language and Function with TM
44:29
Searching and Sorting Techniques - Part 1
Dr.G.M. Karthik
Searching and Sorting Techniques - Part 1
31:49
Turing Machine
Dr.G.M. Karthik
Turing Machine
50:45
Pumping Lemma for Context Free Language
Dr.G.M. Karthik
Pumping Lemma for Context Free Language
38:50
Equivalence of PDA and CFG Part 2
Dr.G.M. Karthik
Equivalence of PDA and CFG Part 2
45:33
Minimum Spanning Tree
Dr.G.M. Karthik
Minimum Spanning Tree
28:05
Topological Sorting and Shortest Path Algorithm
Dr.G.M. Karthik
Topological Sorting and Shortest Path Algorithm
33:53
Equivalence of PDA and CFG
Dr.G.M. Karthik
Equivalence of PDA and CFG
32:19
Pushdown Automata
Dr.G.M. Karthik
Pushdown Automata
39:34
Graph, Terminologies and Traversal
Dr.G.M. Karthik
Graph, Terminologies and Traversal
34:24
Greibach Normal Form GNF
Dr.G.M. Karthik
Greibach Normal Form GNF
56:00
Chomsky Normal Form - CNF
Dr.G.M. Karthik
Chomsky Normal Form - CNF
40:52
B Tree
Dr.G.M. Karthik
B Tree
23:45
Removal of Unit Production from CFG
Dr.G.M. Karthik
Removal of Unit Production from CFG
30:39
Reduction of CFG
Dr.G.M. Karthik
Reduction of CFG
46:54
Splay Tree
Dr.G.M. Karthik
Splay Tree
24:39
Parse Tree & Ambiguous Grammar
Dr.G.M. Karthik
Parse Tree & Ambiguous Grammar
51:09
Context Free Grammar, Derivation Types
Dr.G.M. Karthik
Context Free Grammar, Derivation Types
56:50
AVL Tree - Deletion Part 2
Dr.G.M. Karthik
AVL Tree - Deletion Part 2
26:27
AVL Tree - Insertion
Dr.G.M. Karthik
AVL Tree - Insertion
44:40
Introduction to Grammar, Types of Grammar
Dr.G.M. Karthik
Introduction to Grammar, Types of Grammar
39:23
Pumping Lemma for RE
Dr.G.M. Karthik
Pumping Lemma for RE
19:10
Conversion of FA to RE using State Elimination Method
Dr.G.M. Karthik
Conversion of FA to RE using State Elimination Method
30:13
Minimization of DFA
Dr.G.M. Karthik
Minimization of DFA
25:33
Binary Search Tree
Dr.G.M. Karthik
Binary Search Tree
18:31
Conversion of FA to Regular Expression using Ardens Theorem
Dr.G.M. Karthik
Conversion of FA to Regular Expression using Ardens Theorem
30:24
Binary Tree Representation Expression
Dr.G.M. Karthik
Binary Tree Representation Expression
26:16
Tree Terminologies Representation and Traversal
Dr.G.M. Karthik
Tree Terminologies Representation and Traversal
33:40
Conversion of FA to Regular Expression using Kleens Theorem
Dr.G.M. Karthik
Conversion of FA to Regular Expression using Kleens Theorem
29:44
Application of Stack
Dr.G.M. Karthik
Application of Stack
21:09
Priority Queue - Binary Heap
Dr.G.M. Karthik
Priority Queue - Binary Heap
31:18
Deque or Double Ended Queue using Linked List Implementation
Dr.G.M. Karthik
Deque or Double Ended Queue using Linked List Implementation
15:01
Queue using Linked List Implementation
Dr.G.M. Karthik
Queue using Linked List Implementation
15:59
Circular Queue using Array Implementation
Dr.G.M. Karthik
Circular Queue using Array Implementation
22:50