Company Logo

Introduction to the Course - Theory of Computation (in Hindi)

Lesson 1 of 32 • 42 upvotes • 11:15 mins

Rashmi Vishwakarma

Introduction to the course Theory of computation for NTA UGC NET Computer science, syllabus and pattern of questions asked in previous years.

(Hindi) Theory of Computation : NTA UGC NET

32 lessons • 5 h 35 m

1

Introduction to the Course - Theory of Computation (in Hindi)

11:15 mins

2

Origin of Theory of Computation/ TOC (in Hindi)

7:53 mins

3

Basics Concept (Alphabet, Strings) in Theory of Computation (in Hindi)

14:21 mins

4

Basics Concept (Language) in Theory of Computation (in Hindi)

8:28 mins

5

Introduction to Finite Automata in Theory of Computation (in Hindi)

15:00 mins

6

DFA notation - TOC - NTA UGC NET Computer Science

9:44 mins

7

Numericals on DFA - part 1- NTA UGC NET Computer Science

8:59 mins

8

Numericals on DFA part 2 - NTA UGC NET Computer Science

6:44 mins

9

Numericals on DFA part 3 - NTA UGC NET Computer Science

11:42 mins

10

Solution to practice question 1- NTA UGC NET Computer Science

12:15 mins

11

Solution to practice question 2

11:25 mins

12

Solution to practice question 3- NTA UGC NET Computer Science

7:02 mins

13

Union of DFA in TOC- NTA UGC NET Computer Science

6:24 mins

14

Concatenation of DFA - NTA UGC NET Computer Science

5:20 mins

15

Complementation of DFA in TOC - NTA UGC NET Computer Science

7:02 mins

16

Reversal of DFA in TOC- NTA UGC NET Computer Science

6:04 mins

17

Introduction to NFA in TOC- NTA UGC NET Computer Science

11:05 mins

18

How to convert NFA into DFA in TOC- NTA UGC NET Computer Science and GATE CSE

14:00 mins

19

Example NFA to DFA part 2- NTA UGC NET Computer Science and GATE CSE

10:44 mins

20

Introduction to the epsilon- NFA.

11:05 mins

21

How to convert epsilon- NFA to NFA in TOC- NTA UGC NET Computer Science.

13:37 mins

22

Minimization of DFA in TOC- NTA UGC NET Computer Science and GATE CSE

10:26 mins

23

Example of minimization of DFA in TOC- NTA UGC NET computer science

11:52 mins

24

Example of Minimization of DFA in TOC- NTA UGC NET Computer Science.

9:08 mins

25

Introduction to the Finite State Machine - Moore and Mealy machine

15:00 mins

26

Introduction to Finite State Machine - Moore and Mealy Machine pàrt 2

10:14 mins

27

Conversion of Moore to Mealy Machine in TOC for NTA UGC NET Computer Science

7:31 mins

28

Conversion of Mealy to Moore Machine in TOC for NTA UGC NET Computer Science

11:54 mins

29

Solution to previous years questions based on Finite automata

12:53 mins

30

Solution to previous years questions based on Finite Automata part 2

8:44 mins

31

Solution to previous years questions of Theory of Computation

15:00 mins

32

Solution to previous years questions based on Theory of Computation

12:15 mins