02:05:43

8.8 | class 11 | Chemistry | Ch-8-REDOX Reaction

16:42

1.2 | Class 11 | Chemistry | Ch-1-Basic Concept of Chemistry | Problems based on Mole Concept part-2

25:24

1.1 | Class 11 | Chemistry | Ch-1-Basic Concept of Chemistry | Mole Concept part-1

06:01

5.18| Automata | Design of Turing Machine, that accept even or odd length string

04:46

5.17 | Automata | Design of Turing Machine for that accept even integer, written in Binary language

07:42

5.16 | Automata | Design of Turing Machine for that accept odd integer, written in Binary language

22:19

4.14 | Automata | TWO STACK PDA for a^n b^n a^n b^n | Dr. Pushpa Choudhary

17:42

AUTOMATA UNIT WISE IMPORTANT TOPICS FOR AKTU EXAMS

16:13

Automata Question Bank for AKTU exam

08:51

DBMS model paper for AKTU exam

18:44

8.7 | class 11 | Chemistry | Ch-8-REDOX | Examples of Disproportionation Reaction

14:31

8.6 | class 11 | Chemistry | Ch-8-REDOX | Examples of Balance equation

12:38

8.5 | class 11 | Chemistry | Ch-8-REDOX | Balancing the given equation in acidic and basic medium

12:27

8.4 | class 11 | Chemistry | Ch-8-REDOX | To Identify oxidation and reduction half reaction

19:51

8.3 | class 11 | Chemistry | Ch-8-REDOX | Examples of Oxidation Number (Some Exception case)

27:27

8.2 | class 11 | Chemistry | Ch-8-REDOX | How to calculate oxidation number

18:23

8.1 | class 11 | Chemistry | Ch-8-REDOX | What is oxidation and reduction

16:45

5.15 | Automata | Turing Machine for Palindrome | Dr. Pushpa Choudhary

13:37

5.14 | Automata | Turing Machine for 2's compliment | Dr. Pushpa Choudhary

37:23

5.13 | Automata | Turing Machine for a^n b^n | Dr. Pushpa Choudhary

20:16

4.13 | Automata | TWO STACK PDA for a^n b^n c^n | Dr. Pushpa Choudhary

30:15

4.12 | Automata | Conversion from PDA to CFG Part 2 | Dr. Pushpa Choudhary

15:35

4.11 | Automata | Conversion from PDA to CFG Part 1| Dr. Pushpa Choudhary

27:09

4.10 | Automata | Conversion from CFG to PDA | Dr. Pushpa Choudhary

19:22

4.9 | Automata | PDA for Palindrome | Dr. Pushpa Choudhary

18:56

4.8 | Automata | String acceptance in ww^r for PDA | Dr. Pushpa Choudhary

14:37

4.7 | Automata | PDA for ww^r | Dr. Pushpa Choudhary

13:22

4.6 | Automata | PDA for wcw^r | Dr. Pushpa Choudhary

16:24

4.5 | Automata | PDA for number of a's and number of b's are equal | Dr. Pushpa Choudhary

31:44

4.4 | Automata | PDA for a^n b^m c^m d^n or a^n b^n c^m d^m or a^n b^2n | Dr. Pushpa Choudhary

33:19

4.3 | Automata | PDA for a^n b^m and PDA for a^n b^n c^m | Dr. Pushpa Choudhary

22:22

4.2 | Automata | PDA for a^n b^n | Dr. Pushpa Choudhary

23:38

4.1 | Automata | What is PDA | Dr. Pushpa Choudhary

34:35

3.27 | Automata | Pumping Lemma for CFG | Dr. Pushpa Choudhary

14:42

3.26 | Automata | Example 2, Conversion from CFG to GNF | Dr. Pushpa Choudhary

32:14

3.25 | Automata | Conversion from CFG to GNF | Dr. Pushpa Choudhary

06:44

3.24 | Automata | Conversion from CFG to CNF Part 3 | Dr. Pushpa Choudhary

07:53

3.23 | Automata | Conversion from CFG to CNF Part 2 | Dr. Pushpa Choudhary

11:55

3.22 | Automata | Conversion from CFG to CNF | Dr. Pushpa Choudhary

03:15

3.21 | Automata | What is CNF (Chomsky Normal Form) | Dr. Pushpa Choudhary

06:55

3.20 | Automata | Simplification of CFG Grammar part 2 | Dr. Pushpa Choudhary

13:21

3.19 | Automata | Simplification of CFG Grammar part 1 | Dr. Pushpa Choudhary

06:19

3.18 | Automata | Removal of Unit Production | Dr. Pushpa Choudhary

13:54

3.17 | Automata | Removal of Null Production Examples| Dr. Pushpa Choudhary

06:03

3.16 | Automata | Example of Reduced Grammar | Dr. Pushpa Choudhary

13:49

3.15 | Automata | Simplification of Context Free Grammar | Dr. Pushpa Choudhary

10:55

3.14 | Automata | Conversion from Language to Context Free Grammar | Dr. Pushpa Choudhary

06:55

3.13 | Automata | Context Free Grammar with Example | Dr. Pushpa Choudhary

09:22

3.12 | Automata | Removal of Ambiguity from Grammar part 2 | Dr. Pushpa Choudhary

12:04

3.11 | Automata | Removal of Ambiguity from Grammar part 1 | Dr. Pushpa Choudhary

11:07

3.10 | Automata | Show that given grammar is Ambiguous | Dr. Pushpa Choudhary

13:18

3.9 | Automata | Problems based on Ambiguous Grammar and unambiguous grammar | Dr. Pushpa Choudhary

07:35

3.8 | Automata | Difference between Ambiguous Grammar and unambiguous grammar | Dr. Pushpa Choudhary

20:30

3.7 | Automata | Parse Tree or Derivation Tree | Dr. Pushpa Choudhary

16:11

3.6 | Automata | Example 4 Conversion from Language to Grammar | Dr. Pushpa Choudhary

07:49

3.5 | Automata | Example 3 Conversion from Grammar to Language | Dr. Pushpa Choudhary

11:51

3.4 | Automata | Example 2 Conversion from Grammar to Language | Dr. Pushpa Choudhary

08:22

3.3 | Automata | Example 1 Conversion from Grammar to Language | Dr. Pushpa Choudhary

10:53

3.2 | Automata | Type 3 (Regular Grammar) | Dr. Pushpa Choudhary

25:27

3.1 | Automata | Noam Chomsky Grammar Classification | Dr. Pushpa Choudhary