03:34

65.Automata_38: Ex 3,4 of another use of + sign in regular expressions

24:17

64.Automata_37: Another use of + sign in Regular expressions

16:53

63.Automata_36: Regular Expressions (Fundamentals Part 2)

28:19

62.Automata_35: Regular Expressions (Fundamentals Part 1)

14:58

61.Automata_34: Example 4(Minimization of Finite Automata)

17:39

60.Automata_33: Example 2 & 3(Minimization of Finite Automata)

28:01

59.Automata_32: Example 1(Minimization of Finite Automata)

19:21

58.Automata_31: Minimization of Finite Automata

06:26

57.Automata_30: Relationship between DFA, NFA and NULL NFA and Regular language

25:09

56.Automata_29: Ex2( ɛ-NFA to NFA Conversion)

33:02

55.Automata_28: Ex1( ɛ-NFA to NFA Conversion)

21:43

54.Automata Lec 27: Equivalence of NFA & ɛ-NFA (Conversion of ɛ-NFA to NFA) Fundamental

10:21

53.Automata Lec 26: ɛ-NFA Ex5(non-acceptance string through Null NFA)

07:22

52.Automata Lec 25: ɛ-NFA Ex4(Null NFA)

08:11

51.Automata_24: ɛ-NFA Ex3(Null NFA)

18:21

50.Automata_23: ɛ-NFA Ex2(Null NFA)

20:50

49.Automata_22: ɛ-NFA - Extended Transition Function with example 1

27:28

48. Automata_21: NFA with null transition (ɛ-NFA), Null Closure Concept in Null NFA

08:23

47. Automata_20: NFA to DFA Example 3 (Subset Construction)

08:56

46. Automata_19:NFA to DFA Example 2(Subset Construction)

28:05

45. Automata_18: Equivalence of DFA and NFA (Subset Construction Method)

17:49

44. Automata_17: NFA Example 2

28:52

43. Automata_16: NFA - Extended Transition Function and language of NFA

47:14

42. Automata_15: NFA (Non-Deterministic Finite Automata) Fundamental

27:24

41. Automata_14: Extended Transition of DFA and Language of DFA

46:24

40. Automata_13: DFA Example 18,19,20

15:01

39. Automata_12: DFA which starts with 0 and ends with 1 on {0, 1}

31:11

38. Automata_11: DFA to accept the set of all the strings containing 1101 as substring on {0, 1

32:06

37. Automata_10: DFA accepting strings over {a, b, c} having "bca" as substring.

25:39

36.Automata_9:DFA Mod Based Questions Example 9 to 13

36:13

35. Automata_8: DFA Length of string greater than or less than or equal to 2 on {a, b}

27:12

34. Automata_7: DFA Example 4,5

17:15

33. Automata _6: DFA Example 3

19:30

32. Automata _5: DFA Example 2

17:29

LEC - 4 THEORY OF AUTOMATA AND FORMAL LANGUAGE

26:00

30. Automata Lec 3: Deterministic Finite Automata (DFA) Example 1

22:15

29. Automata Lec 2: Finite Automata working with Switch Example

13:52

28. Automata Lec1 - What is Finite Automata

21:57

27. ARRAY-FINDING SMALLEST ELEMENT THROUGH POINTERS

27:52

26. ARRAY POINTERS

34:42

25. BUBBLE SORT - C LANGUAGE

48:33

24. SELECTION SORT - C LANGUAGE

16:57

19. POINTER ARITHMETIC IN C

16:11

23. ARRAYS IN C - PROGRAM 5

22:00

22. ARRAYS IN C - PROGRAM 4

18:57

20. ARRAYS IN C - PROGRAM 1 AND 2

12:48

21 ARRAYS IN C -PROGRAMS 3

27:49

18. POINTERS IN C (PART 2) HINDI

27:00

17. POINTERS IN C (PART 1) HINDI

14:21

16. MASTER METHOD - PART 7 (FEW MORE PROBLEMS)

15:30

15. MASTER METHOD - PART 6 (MASTER METHOD DOES NOT ALWAYS APPLY)

16:38

14. MASTER METHOD - PART 5 DOES NOT ALWAYS APPLY

10:52

13.MASTER METHOD- PART 4 MASTER METHOD DOES NOT ALWAYS APPLY, POLYNOMIAL SMALLER AND LARGER,

15:24

12. MASTER METHOD-PART 3 HOW POLYNOMIALLY SMALLER AND POLYNOMIALLY LARGER CONDITION APPLIED

17:16

11. MASTER METHOD - PART 2 (PROBLEMS) DESIGN AND ANALYSIS OF ALGORITHMS

26:34

10. MASTER METHOD- PART 1 (DESIGN AND ANALYSIS OF ALGORITHMS)

07:38

9. C LANGUAGE QUESTIONS

06:07

8. C LANGUAGE QUESTIONS

10:28

7. C COMPLEX DECLARATIONS

05:14

6. C LANGUAGE - SHIFT OPERATORS