Learn IT easy with Mehbooba

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

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

THEORY OF COMPUTATION-LECTURE #28 -Context Free Grammar

Regularization Techniques

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

SPACE COMPLEXITY - DSPACE, NSPACE, PSPACE, NPSPACE

Linear Regression - Part 2: Gradient Descent and Matrix Solutions

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

COMPUTATIONAL COMPLEXITY LECTURE - Rice's Theorem

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

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

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

Introduction to Deep Learning

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

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

CLIQUE IS NP-COMPLETE : The Proof

Back Propagation in Feed Forward Neural Networks

Approximation Algorithm for Travelling Salesman Problem

Optimization Techniques

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

COMPILER DESIGN LECTURE-19, Operator Precedence Parser

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

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

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

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

Approximation Algorithm for Vertex Cover

COMPILER DESIGN LECTURE-38, A simple Code Generation Algorithm

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

Ensemble Methods

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

COMPILER DESIGN - LECTURE -9, Context Free Grammar (CFG)

COMPILER DESIGN LECTURE - 13, Left Factoring

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

Approximation Algorithms for Minimum Partitioning

Computation Complexity- Proof that PRIMES is in class CoRP

Approximation Algorithms for Bin Packing Problem

Logistic Regression Classifier with examples

Linear Regression-Part 1

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

Multi Layer Perceptron (MLP) / Feed Forward Neural Networks

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

Interactive Proof Systems and class IP

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

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