13:10

31. DFA to Regular Expressions - Using State Elimination Method

13:29

29. Regular Expression - Ex3

09:48

30. Closure properties of Regular Languages

06:43

32. Regular Expression to Finite Automata conversion

11:11

28. Examples for Regular Expressions

10:17

27. Regular Expression - Examples 2

09:35

26. Introduction to Regular Expression

11:11

22. Designing Mealy Machine- Eg.3 - Two's complement of a binary number

08:49

25..Conversion of MEALY MACHINE to MOORE MACHINE

09:13

23. Conversion of MOORE MACHINE to MEALY MACHINE

03:29

24. Conversion of Moore Machine to Mealy Machine- Eg.2

04:37

21. Designing Mealy Machine - Eg.2

05:48

20. Designing Mealy Machine - Eg.1

09:18

18. Designing Moore Machine- Eg.2

08:32

17. Designing Moore Machine- Eg.1

10:54

16. Moore Machine and Mealy Machine - Introduction

05:41

19. Designing Moore Machine- Eg.3

18:37

15. DFA Minimization- Myhill-Nerode Theorem

19:54

14. Conversion of ε-NFA to NFA

09:14

13. Epsilon NFA (ε - NFA) and ε- closure

07:05

12. NFA to DFA - Example

11:50

11. Converting NFA to DFA

06:39

10. Designing NFA- Example_2

09:54

9. Designing NFA - Example_1

05:33

8. Non- Deterministic Finite Automata (NFA)

04:30

7. DFA Example_4

06:42

5. DFA Examples_2

10:02

3. Deterministic finite Automata ( DFA)

08:19

2. Finite Automata/ Finite State Automata

06:42

6. DFA Exmaples_3

05:21

4. DFA Construction - Example_1

06:58

1. TOC Introduction

23:01

Radix Sort

23:14

Counting sort

10:45

CST201 (Mod3_14): First-fit, Best-fit and Worst-fit Allocation schemes.

09:10

CST201(Mod3_13): Queue implementation using Linked List - ENQUEUE Operation

03:24

CST201 (Mod3_14): DEQUEUE operation of Queue using Linked List

04:37

CST201(Mod3_12): POP operation of Stack using Linked List

08:06

CST201(Mod3_11): Linked List representation of Stack - PUSH operation

04:24

CST201(Mod3_10): Circular Linked List

06:40

CST201(Mod3_8) : Doubly Linked List and Insertion operation

11:59

CST201(Mod3_7): Singly Linked List-DELETION- At specified position

03:12

CST201(Mod3_9) : Doubly Linked List and Deletion Operation

06:42

CST201(Mod3_3): Singly Linked List- Insertion at the end of LL

07:55

CST201(Mod3_4): Singly Linked List- Insertion at specified position

05:21

CST201(Mod3_6): Singly Linked List- DELETION- At the end of LL

02:31

CST201(Mod3_5): Singly Linked List- DELETION- At beginning of LL

15:42

CST201(Mod2_12): Expression Evaluation - Infix to Postfix evaluation

07:01

CST201(Mod3_1): Linked List

08:41

CST201(Mod2_13): Expression Evaluation - Postfix to Infix expression evaluation

04:39

CST201(Mod3_2): Singly Linked List- Operation: Insertion at the beginning

06:11

CST201(Mod2_10): Double Ended Queue & Circular Queue

04:00

CST201(Mod2_11): Priority Queue

06:30

CST201(Mod2_9): Enqueue and Dequeue operations of Queue

05:22

CST201(Mod2_8): Queue

05:46

CST201(Mod2_7): Example of infix to postfix conversion

03:24

CST201(Mod2_6): Application of stack

07:16

CST201(Mod2_4): Push operation of Stack

07:38

CST201(Mod2_3): Stack

03:20

CST201(Mod2_5): Pop operation of Stack