09:32

Types of Finite Automata | Theory of Computation and Formal Languages | Vishal Gupta

10:05

Automata Theory | Theory of Computation and Formal Languages | Vishal Gupta

05:19

Quick Sort | Data Structure and Algorithms | Vishal Gupta

06:04

Recursion | Data Structure and Algorithms | Vishal Gupta

24:46

Quick Sort Algorithm | Data Structure and Algorithms | Vishal Gupta

05:46

How to Create Tree from Preorder and Inorder Traversal | Data Structure and Algorithms

06:52

How to Create Tree from Preorder and Inorder Traversal | Data Structure and Algorithms |

06:28

Conversion of Infix expression to Binary trees | Data Structure and Algorithms | Vishal Gupta

07:30

Practice Questions on 2D array mapping | Data Structure and Algorithms | Vishal Gupta

09:28

Deleting the root of Heap | Data Structure and Algorithms | Vishal Gupta

09:43

Insertion in Heap | Data Structure and Algorithms | Vishal Gupta

08:19

Heap - Complete Binary Tree | Data Structure and Algorithms | Vishal Gupta

11:20

Deletion in Binary Search Tree - Case - II | Data Structure and Algorithms | Vishal Gupta

07:02

Deletion in Binary Search Tree | Data Structure and Algorithms | Vishal Gupta

08:26

Deletion in Binary Search Tree - Case - I | Data Structure and Algorithms | Vishal Gupta

11:22

Searching in Binary Search Tree | Data Structure and Algorithms | Vishal Gupta

08:51

Insertion in Binary Search Tree | Data Structure and Algorithms | Vishal Gupta

05:12

Introduction to Binary Search Tree | Data Structure and Algorithms | Vishal Gupta

11:11

Traversing Binary Tree - PREORDER Algorithm | Data Structure and Algorithms | Vishal Gupta

13:37

Traversing Binary Tree - INORDER Algorithm | Data Structure and Algorithms | Vishal Gupta

16:16

Traversing Binary Tree - POSTORDER Algorithm | Data Structure and Algorithms | Vishal Gupta

04:33

Traversing Binary Tree - POSTORDER | Data Structure and Algorithms | Vishal Gupta

04:04

Traversing Binary Tree - PREORDER | Data Structure and Algorithms | Vishal Gupta

06:51

Traversing Binary Tree - INORDER | Data Structure and Algorithms | Vishal Gupta

10:52

Introduction to Tree | Data Structure and Algorithms | Vishal Gupta

05:36

Introduction to Data Structures | Data Structure and Algorithms | Vishal Gupta

05:05

Delete Node at Ending of Doubly Linked List | Data Structure and Algorithms | Vishal Gupta

07:21

Delete Node at in Between of Doubly Linked List | Data Structure and Algorithms | Vishal Gupta

04:51

Delete Node at Beginning of Doubly Linked List | Data Structure and Algorithms | Vishal Gupta

05:58

Insert Node at Beginning of Doubly Linked List | Data Structure and Algorithms | Vishal Gupta

04:20

Insert Node at in Between of Doubly Linked List | Data Structure and Algorithms | Vishal Gupta

03:51

Insert Node at Ending of Doubly Linked List| Data Structure and Algorithms | Vishal Gupta

08:35

Introduction to Doubly Linked List | TwoWay Lists | Data Structure and Algorithms | Vishal Gupta

05:24

Deletion from Circular Header Linked List Part - II | Data Structure and Algorithms | Vishal Gupta

07:28

Deletion from Circular Header Linked List Part - I | Data Structure and Algorithms | Vishal Gupta

09:09

Searching in Circular Header Linked List| Data Structure and Algorithms | Vishal Gupta

10:54

Header Linked List | Data Structure and Algorithms | Vishal Gupta

07:23

Turing Machine Example | Theory of Computation and Formal Languages

06:18

NFA To R.E. Using Arden's Theorem | Theory of Computation and Formal Languages

09:42

Turing Machine to Accept Palindrome Numbers | Theory of Computation and Formal Languages

03:49

Turing Machine for 2's Complement | Turing Machine | Theory of Computation and Formal Languages

06:16

Introduction to Turing Machine | Turing Machine | Theory of Computation and Formal Languages

10:18

Conversion from Moore machine to Mealy machine | Theory of Computation and Formal Languages

06:30

Introduction to Moore and Mealy Machine | Theory of Computation and Formal Languages | Automata

01:06

Quiz Project in Kotlin | Mobile App Development | Vishal Gupta

04:08

DELETION OF A NODE FOLLOWING A GIVEN NODE FROM A LINKED LIST | DSA | Vishal Gupta

11:16

DELETION OF A NODE WITH A GIVEN ITEM OF INFORMATION FROM A LINKED LIST | DSA | Vishal Gupta

06:52

DELETION FROM END OF A LINKED LIST | DSA | Vishal Gupta

07:47

DELETION FROM BEGINNING OF A LINKED LIST | DSA | Vishal Gupta

13:57

INSERTION INTO A SORTED LINKED LIST | DSA | Vishal Gupta

16:04

INSERTION INTO A LINKED LIST | DSA | Vishal Gupta

10:38

SEARCHING IN LINKED LIST | Linked List | DSA | Vishal Gupta

09:07

LINK LIST | DSA | Vishal Gupta

09:27

Sparse Matrix | DSA | Vishal Gupta

14:14

DEQUEUE | DSA | Vishal Gupta

15:23

CIRCULAR QUEUE | DSA | Vishal Gupta

16:12

LINEAR QUEUE | DSA | Vishal Gupta

06:56

Infix to Prefix Conversion | DSA | Vishal Gupta

10:06

INFIX TO POSTFIX CONVERSION | DSA | Vishal Gupta

06:03

Evaluation of Postfix Expression | DSA | Vishal Gupta