Dr.G.M. Karthik

Circular Queue using Array Implementation

Pushdown Automata

Context Free Grammar, Derivation Types

Binary Search Tree

Chomsky Normal Form - CNF

Turing Machine Example Part 1

Reduction of CFG

Splay Tree

Topological Sorting and Shortest Path Algorithm

Computable Language and Function with TM

Equivalence of PDA and CFG Part 2

Searching and Sorting Techniques - Part 1

Number System Part A

AVL Tree - Deletion Part 2

Minimization of DFA

Programming Techniques in Turing machine

AVL Tree - Insertion

B Tree

Graph, Terminologies and Traversal

Hashing

Conversion of FA to Regular Expression using Kleens Theorem

Removal of Unit Production from CFG

Minimum Spanning Tree

Pumping Lemma for Context Free Language

Number System Part B

Pumping Lemma for RE

Turing Machine

Greibach Normal Form GNF

Introduction to Grammar, Types of Grammar

Equivalence of PDA and CFG

Sorting Techniques