12:38

THEORY OF COMPUTATION- LECTURE 12 - Equivalence of DFA and NFA - Proof

11:22

THEORY OF COMPUTATION- LECTURE 11 - Extended Transition Functions & Language Accepted by Epsilon NFA

09:06

THEORY OF COMPUTATION - Lecture-8 - Extended Transition Functions and Language Acceptability of NFA

11:29

THEORY OF COMPUTATION-Lecture 5 - Extended Transition Functions and Language acceptability of DFA

06:52

COMPUTATIONAL COMPLEXITY - TAPE REDUCTION

06:39

COMPUTATIONAL COMPLEXITY LECTURE - Rice's Theorem

07:40

COMPUTATIONAL COMPLEXITY LECTURE- Polynomial Reductions

10:05

COMPUTATIONAL COMPLEXITY LECTURE- Linear Speed Up Theorem

17:49

THEORY OF COMPUTATION- LECTURE # 44- Halting Problem and undecidability of halting

25:55

MULTI TAPE TURING MACHINES WITH EXAMPLES

15:54

UNIVERSAL TURING MACHINES

17:37

BOOLEAN SATISFIABILITY AND 2 SATISFIABILITY

09:48

COUNTING AND DIAGONALISATION

07:12

GRAPH COLORING AND 2 COLOURABILITY

20:54

THEORY OF COMPUTATION-LECTURE-#2 DETERMINISTIC FINITE AUTOMATA ( DFA)

15:00

THEORY OF COMPUTATION-Lecture #37- Introduction to Turing Machine

16:21

COMPUTATIONAL COMPLEXITY - Lecture-1

04:22

COMPUTATIONAL COMPLEXITY- Lecture

06:17

THEORY OF COMPUTATION-LECTURE-#1 INTRODUCTION TO FINITE AUTOMATA

30:57

THEORY OF COMPUTATION-LECTURE-#3 DESIGNING DFAs

26:54

THEORY OF COMPUTATION-LECTURE-#9 NFA WITH EPSILON TRANSITIONS

25:43

THEORY OF COMPUTATION-LECTURE 6- NON DETERMINISTIC FINITE AUTOMATA

32:42

DESIGN AND ANALYSIS OF ALGORITHMS- LECTURE-#8 MASTERS THEOREM

22:06

THEORY OF COMPUTATION-LECTURE-#7 NFA TO DFA CONVERSION

18:33

THEORY OF COMPUTATION-LECTURE-#10 CONVERTING EPSILON NFA TO NFA WITHOUT EPSILON TRANSITIONS

37:49

DESIGN AND ANALYSIS OF ALGORITHMS, LECTURE - #7, Recursion tree method to solve recurrence relations

37:55

DESIGN AND ANALYSIS OF ALGORITHMS, LECTURE-#6, Iterative approach to Solve recurrence relations

12:32

DESIGN AND ANALYSIS OF ALGORITHMS, LECTURE #5, RECURRENCE RELATIONS

07:07

DESIGN AND ANALYSIS OF ALGORITHMS, LECTURE #2, Complexity analysis of algorithms

18:58

DESIGN AND ANALYSIS OF ALGORITHMS, LECTURE #4, Asymptotic Notations

08:57

DESIGN AND ANALYSIS OF ALGORITHMS, LECTURE #3, Best, worst and average case complexity of algorithms

29:16

DESIGN AND ANALYSIS OF ALGORITHMS, LECTURE #1, Introduction to complexity analysis

15:02

COMPILER DESIGN LECTURE-31, Intermediate Languages & representation, Part-3, Three Adress Code

09:05

COMPILER DESIGN LECTURE -16, Construction of Predictive Parsing Table

09:25

COMPILER DESIGN LECTURE -22, LR parsing Algorithm

26:25

COMPILER DESIGN LECTURE -29, Intermediate Languages and Representations, Part 1 - Syntax Tree

24:32

COMPILER DESIGN LECTURE - 20, Construction of SLR Parsing table

08:19

COMPILER DESIGN LECTURE - 18, Shift Reduce Parsers

06:10

COMPILER DESIGN LECTURE -14, Classification of Parsers and Recursive Descent Parser

08:27

COMPILER DESIGN LECTURE - 17, Algorithm for Predictive Parsing - LL(1) Parsing

05:15

COMPILER DESIGN LECTURE-30, Intermediate Languages and Representation - Part2, Postfix Notation

11:47

COMPILER DESIGN LECTURE-19, Operator Precedence Parser

07:14

COMPILER DESIGN LECTURE - 37, Optimisation Part-4, Peephole Optimisation

22:01

COMPILER DESIGN LECTURE- 21, Construction of LALR(1) and CLR(1) parsing tables

18:35

COMPILER DESIGN LECTURE - 12, Left recursion and its elimination

21:26

COMPILER DESIGN LECTURE-38, A simple Code Generation Algorithm

08:10

COMPILER DESIGN LECTURE - 13, Left Factoring

20:06

COMPILER DESIGN LECTURE - 32, Translation Scheme for converting Assignment statements into 3AC

24:51

COMPILER DESIGN LECTURE- 15, FIRST() AND FOLLOW()

31:54

COMPILER DESIGN LECTURE -33, Translation Schemes for conversion of Boolean expressions into 3AC

06:32

COMPILER DESIGN LECTURE- 28, Bottom Up Evaluation of Inherited attributes

18:53

COMPILER DESIGN LECTURE- 25, Annotated Parse trees and Dependancy Graphs.

12:30

COMPILER DESIGN LECTURE - 27, Bottom Up evaluation of S- attributed definitions

05:42

COMPILER DESIGN LECTURE- 26, Translation Schemes

22:58

COMPILER DESIGN LECTURE-24,Synthesised Attributes, Inherited Attributes, L & S attributed Definition

09:49

COMPILER DESIGN LECTURE- 23, Syntax Directed Definition and Syntax Directed Translation

20:31

COMPILER DESIGN LECTURE- 34, Code Optimisation Part-1, Basic Blocks and Flow graphs

10:16

COMPILER DESIGN LECTURE - 36, Code Optimisation Part-3, Global Optimisation

09:30

COMPILER DESIGN LECTURE- 35, Code Optimisation Part-2, Local Optimisation

18:03

COMPILER DESIGN-LECTURE 11, Elimination of Ambiguity