06:47

Ensemble Methods

22:35

Regularization Techniques

36:19

Optimization Techniques

17:28

Practical Challenges in Neural Network Training- Overfitting, Vanishing & exploding gradients & more

15:17

Introduction to Deep Learning

25:08

Decision Tree Algorithm _ Iterative Dichotomiser -3 (ID3) with examples

09:57

Naive Bayes Classifier With Examples

12:00

Logistic Regression Classifier with examples

28:30

Back Propagation in Feed Forward Neural Networks

22:23

Multi Layer Perceptron (MLP) / Feed Forward Neural Networks

21:56

Linear Regression - Part 2: Gradient Descent and Matrix Solutions

17:12

Linear Regression-Part 1

15:10

Interactive Proof Systems and class IP

07:12

Approximation Algorithm for Vertex Cover

09:26

Approximation Algorithms for Bin Packing Problem

04:57

Approximation Algorithms for Minimum Partitioning

12:09

Approximation Algorithm for Travelling Salesman Problem

07:41

THEORY OF COMPUTATION- LECTURE #40- Variants of Turing Machines- Non deterministic & Enumerator TMs

36:57

THEORY OF COMPUTATION-LECTURE #39-Designing Turing Machine as Transducers

07:46

THEORY OF COMPUTATION -LECTURE # 43 - Recursive and Recursively enumerable languages

01:07:25

THEORY OF COMPUTATION-Lecture-#38- Turing Machine as acceptors - Designing Examples

12:22

Computation Complexity- Proof that PRIMES is in class CoRP

14:04

Computational Complexity- Randomized algorithms&Probabilistic Complexity classes - RP, CoRP, BPP&ZPP

17:55

THEORY OF COMPUTATION- Lecture #36- Context Sensitive Grammar (CSG) and Linear Bounded Automata(LBA)

06:57

THEORY OF COMPUTATON- Lecture- #35- Pumping Lemma for Context Free Languages (CFL) with examples

26:58

THEORY OF COMPUTATION-LECTURE #34- pumping Lemma for CFL- The Proof

31:52

GATE/NET -Frequently asked questions- Data Structures- Part 3- Linked Lists

17:25

NL=coNL : Proof with examples

33:03

PSAPACE COMPLETENESS OF TRUE QUANTIFIED BOOLEAN FORMULA (TQBF)

20:02

L, NL and NL COMPLETE Space complexity classes with examples

24:38

THEORY OF COMPUTATION-LECTURE #32- Converting CFG to Greiback Normal Form(GNF)

29:49

THEORY OF COMPUTATION- LECTURE #33- Proof of Equivalence of CFG and NPDA

28:55

THEORY OF COMPUTATION- LECTURE #31 - Converting CFG to CNF ( Chomsky Normal Form)

14:40

SAVITCH's THEOREM

17:17

SPACE COMPLEXITY - DSPACE, NSPACE, PSPACE, NPSPACE

36:14

THEORY OF COMPUTATION- LECTURE #30- Simplification of Context Free Grammars( CFG)

30:27

THEORY OF COMPUTATION - LECTURE #29- Writing Context Free grammars

17:54

THEORY OF COMPUTATION-LECTURE #28 -Context Free Grammar

55:20

CSE GATE/NET Previous year solved questions- Data structures-#2 - Stacks and Queues

22:36

THEORY OF COMPUTATION- LECTURE-#27- Acceptance of a PDA by Final State and Empty Stack

20:28

THEORY OF COMPUTATION- Lecture-#26- Designing Push Down Automata - Part2

15:03

NP Completeness of Knapsack Problem

26:56

NP COMPLETENESS OF HAMILTONIAN CYCLE DECISION PROBLEM

45:28

Theory of Computation- Lecture #25- Designing Push Down Automata

23:49

Theory of Computation- Lecture #24- Push Down Automata

15:32

NP COMPLETENESS OF 3-COLOURABILITY

18:54

CLIQUE IS NP-COMPLETE : The Proof

22:58

COOK LEVIN THEOREM

18:18

THEORY OF COMPUTATION-LECTURE-#23-Pumping Lemma for regular grammar - examples

17:33

THEORY OF COMPUTATION- LECTURE #22- Pumping Lemma for regular grammar - the proof

52:43

CS GATE/NET- Frequently asked questions and solutions-#1 - Data Structures- Part-1 - Arrays

23:18

THEORY OF COMPUTATION-LECTURE 21- Equivalence of Regular Expressions and Finite Automata

24:38

THEORY OF COMPUTATION- LECTURE 20- DFA to Regular Expressions

26:19

THEORY OF COMPUTATION-LECTURE 18 - Regular Expressions

15:40

THEORY OF COMPUTATION-LECTURE17- Regular grammar & conversion of finite automata to regular grammar

30:16

THEORY OF COMPUTATION - Lecture 16- Two Way Finite Automata

34:21

THEORY OF COMPUTATION- LECTURE 14 - Myhill Nerode Theorem and Minimization of DFA

29:28

THEORY OF COMPUTATION- LECTURE 4- Union,Concatenation,Cross Product, Complement and Reversal of DFAs

18:25

THEORY OF COMPUTATION- LECTURE 15 - Finite State Machines with output- Moore and Mealy Machines

10:57

THEORY OF COMPUTATION - LECTURE 13 - Equivalence of NFA with and without epsilon Transitions