03:51

DMS Unit 1 : Second Order Linear Homogeneous Recurrence Relation-Real and Repeated Roots

11:05

DMS Unit 1 : Second order Linear Homogeneous Recurrence Relation-Roots are Complex

07:22

DMS Unit 1 : Second Order Linear Homogeneous Recurrence Relation-Real and distinct roots

08:06

DMS Unit 1 : first Order Linar Homogeneous Recurrence Relation Examples

04:24

Unit 1: First Order Homogeneous Recurrence Relation

07:00

Unit 1 : Recurrence Relation

06:08

Removal of Unit Production | FAFL | TOC

06:28

Removal of Useless Symbol | FAFL | TOC

08:24

Removal of Null Production from CFG

13:21

CFG Construction Example

05:55

Conversion of Finite Automata to Left Linear Regular Grammar

05:42

Construction of DPDA Example 3

06:59

Construction of DPDA Example 2

07:02

Left Linear Grammar to Finite Automata

02:18

Finite Automata to Right Linear Regular Grammar

05:02

DMS UNIT 2 : Lecture 8| Logical Implication using Rules of Inference

06:14

DMS UNIT 2: Lecture 7 | Inference Rule

05:54

DMS Unit 1: Combinations

06:53

DMS Unit 1: Binomial Theorem

11:38

DMS UNIT 1: Permutaions

04:08

DMS Unit 2 : Lecture 6 | Converse, Inverse and Contrapositive of a Logical Implication

12:48

DMS Unit 2 : Lecture 5 | Logical equivalence without truth table

07:12

DMS Unit 2 : Lecture 4 | Laws of Logic

09:49

DMS Unit 2: Lecture 3 | Logical Equivalence

05:41

DMS Unit 2: Lecture 2 | Tautology, Contingency and Contradiction

07:53

DMS Unit-2: Lecture 1 | Propositions, Basic Connectives and Truth Tables

12:37

Turing machine Construction

13:18

Turing Machine Introduction | FAFL |Theory of Computation

05:17

Right Linear Grammar to Finite Automata

07:27

Regular Grammar

07:22

LMD,RMD and Parse Tree of CFG

06:17

CFG Construction

09:19

CFG

08:56

Lecture 24: Construction of a Pushdown Automata | PDA Construction | Theory of Computation | FAFL

05:16

Lecture 23: Acceptance of a language by a PDA.

04:21

Lecture 22: ID of PDA | Theory of Computation | FAFL

09:21

Lecture 21: PDA | Definition and Representation of PDA | Theory of Computation | FAFL

12:05

Lecture 20: Introduction -Push Down Automata | Theory of Computation | FAFL

13:20

Lecture 19:DFA Construction Example #2 | Theory of Computation | FAFL

12:06

Lecture 18:Regular and Non Regular Language | Theory of Computation | FAFL

14:09

Lecture 17:Relationship between Regular Expression and Finite Automata | Theory of Computation |FAFL

11:21

Lecture 16:Regular Expression Example 2 | Theory of Computation | FAFL

04:44

Lecture 15: Regular Expression Example 1 | Theory of Computation | FAFL

08:30

Lecture 14: Regular Expression | Theory of Computation | FAFL

09:15

lecture 13: Epsilon NFA to NFA Conversion

05:16

Lecture 12: Epsilon NFA | Theory of Computation |FAFL

05:27

Prime No Program in C

10:11

Decimal to Binary Conversion Program in C.

13:15

C program to Calculate the Roots of the quadratic equation

13:06

lecture 10:NFA to DFA Conversion ITheory of Computation |FAFL

10:30

Lecture 9: NFA Construction| Theory of Computation | FAFL

12:58

Lecture 7 :General procedure to design a Finite Automata | Theory of Computation | FAFL

11:12

Lecture 6:Properties of transition Function| Extended Transition Function|Theory of Computation|FAFL

05:55

Lecture 5:Language accepted by a DFA | Theory of Computation | FAFL

07:15

Lecture 4:DFA Definition & Its Transition Table & Graph Representation |Theory of Computation | FAFL

13:04

Lecture 2: Finite Automata and Types of Fine automata | Theory of Computation | FAFL

13:29

Lecture 3:Concept of Alphabet, String and Language | Basic Terminologies|Theory of Computation| FAFL

13:36

C Program to Compute average marks of ‘n’ students & search a particular record based on ‘Roll_No’.

09:24

C program using pointers to function to find given two strings are equal or not.

09:04

Pointers with 1-Dimensional Array