Show sidebar

Lecture-25-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-25-Discrete Fourier TransformIII, by Shashank K. Mehta

,

Lecture-25-Elimination of Unit productions. Converting a Cfg into Chomsky Normal form. towards Pumping Lemma for Cfls, by Somenath Biswas

,

Lecture-25, by Tapan K. Sengupta

,

Lecture-26-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-26-Pumping Lemma for cfls. Adversarial paradigm., by Somenath Biswas

,

Lecture-26-Schonhage Strassen Algo, by Shashank K. Mehta

,

Lecture-26, by Tapan K. Sengupta

,

Lecture-27-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-27-Completion of Pumping Lemma proof. Examples of Use of Pumping lemma. Converse of Lemma does not hold. Closure Properties of cfls., by Somenath Biswas

,

Lecture-27-Linear ProgrammingI, by Shashank K. Mehta

,

Lecture-27, by Tapan K. Sengupta

,

Lecture-28-Closure Properties continued. Cfls not Closed under complementation., by Somenath Biswas

,

Lecture-28-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-28-Linear ProgrammingII, by Shashank K. Mehta

,

Lecture-28, by Tapan K. Sengupta

,

Lecture-29-Another Example of a Cfl whose Complement is not a cfl. Decision Problems for cfls., by Somenath Biswas

,

Lecture-29-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-29-Geometryi, by Shashank K. Mehta

,

Lecture-29, by Tapan K. Sengupta

,

Lecture-30-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-30-Geometryii, by Shashank K. Mehta

,

Lecture-30-More Decision problems. CYK Algorithm for Membership decision., by Somenath Biswas

,

Lecture-31-Geometryiii, by Shashank K. Mehta

,

Lecture-31-Introduction to Pushdown Automata (Pda) ., by Somenath Biswas

,

Lecture-31, by Tapan K. Sengupta

,

Lecture-32-Approximation AlgoI, by Shashank K. Mehta

,

Lecture-32-Pda Configurations, Acceptance Notions for pdas. Transition Diagrams for Pdas, by Somenath Biswas

,

Lecture-32, by Tapan K. Sengupta

,

Lecture-33-Approximation AlgoII, by Shashank K. Mehta

,

Lecture-33-Equivalence of Acceptance by Empty Stack and Acceptance by Final state., by Somenath Biswas

,

Lecture-33, by Tapan K. Sengupta

,

Lecture-34-Approximation AlgoIII, by Shashank K. Mehta

,

Lecture-35-General: Dynamic Programming, by Shashank K. Mehta

,

Lecture-35, by Tapan K. Sengupta

,

Lecture-36, by Tapan K. Sengupta

,

Lecture-38, by Tapan K. Sengupta

,

Lecture-39, by Tapan K. Sengupta

,

Lecture13: Computational Geometry, by Sourav Mukhopadhyay

,

LeD 1.1 E Learning in STEM, by Prof.Sahana Murthy

,

LeD 1.2 Challenges in E Learning, by Prof.Sahana Murthy

,

LeD 1.3 what is Learner Centric Approach, by Prof.Sahana Murthy

,

LeD 1.4 Instructional Design in E Learning, by Prof.Sahana Murthy

,

LeD 2.2: Promoting Learner Engagement with Content, by Prof.Sahana Murthy

,

LeD 2.3A: Interactive Video, by Prof.Sahana Murthy

,

LeD 2.3B: Learning by Doing (LbD), by Prof.Sahana Murthy

,

LeD 2.4: Articulation and Reflection, by Prof.Sahana Murthy

,

LeD 3.1: Construct your own Understanding, by Prof.Sahana Murthy

,

LeD 3.2: Contextualized Learning, by Prof.Sahana Murthy

,

LeD 3.3: Feedback, by Prof.Sahana Murthy

,