Gate Instructors

Ratio and Proportion - Concepts and Tricks - Part 1

Tricks and Shortcuts in Ratio and Proportions - Part 2

Problems on Ages - Concepts and Tricks - ShortCut Maths Tricks

Direct and Inverse Variation - Problems Definition & Examples

Time, Speed And Distance - Part 1 | Aptitude for GATE, Placements, CAT, Bank PO, Engineering

Time speed distance shortcuts - 2 | Aptitude for GATE, Placements, CAT, Bank PO, Engineering

Time, Speed and Distance - Shortcut Tricks and Techniques - Part 3

Time, Speed, Distance - Theory & Solved Examples - Part 4 | Aptitude for GATE, Placements

Time, Speed And Distance - Part 5 | Aptitude for GATE, Placements, CAT, Bank PO, Engineering

Time, Speed And Distance Part 6

Quantitative Aptitude Problems on Trains 1 | Aptitude for GATE, Placements, Engineering

Quantitative Aptitude Problems on Trains (Solution in Shortcut Method) Part 2

Input Size, Running time of an algorithm | Big oh Notation Asymptotic Notation Algorithm DAA | 02

Automata Theory | Non Regular Language Examples | 109

Compiler Design lecture: Code Optimization, Target Machine Code Generation | 17

008 Programming | String Character | Array and Pointers| Part 2

Third Normal Form | Database Management System | 3NF BCNF Example | Normalization in DBMS | 53

Universal Quantifier, Existential Quantifier, Inference Rule for Quantifiers, First Order Logic | 20

Determine Language CFL, Recursive, Context Free, Context Sensitive | Theory of Computation | 124

Context Sensitive, but not Context Free Languages a^nb^nc^n complement language | 123

007 Programming | Recursion Part 1

118 Data Structures | Doubly Circular Linked List Part 8

Difference between Regular Language and Context Free Language | Theory of Computation | 104

Context free Grammar | REG DCFL CFL CSL language Examples | 110

Context free Grammar | Language Identification | Regular Language | 115

Register Addressing Modes, Register indirect Addressing Modes | 03

70 | SYNTAX DIRECTED TRANSLATION SDT part 2 | Compiler Design

Examples of Regular Language and Regular Expressions in automata theory (Concepts, Tricks) | 065

Compiler Design Lecture: Introduction to Lexical Analyzer Tokens, Patterns, Lexemes | 23

First and Follow solved Examples Part 1 | Syntax Analysis LL(1) Parsing Table | 68

Prime Attribute and Non Prime Attribute Example | DBMS Databases | 20

Context free Grammar | Context Sensitive Language Type: equal number of a's, b's and c's | 113

Grammars ambiguity | Parse Tree | Ambiguous Grammars Example | Concepts, Tricks & ShortCut | 37

Big O, Big Omega, and Big Theta Notation | Omega Asymptotic Notation | 07

Theory of Computation TOC : Regular, Non Regular, Context free Language Identification | 126

Compiler Design | Ambiguous Grammars Example | Unambiguous Grammars Example | Parse Tree | 33

UPDATE, INSERTION, MODIFICATION, DELETION ANOMALY in DBMS Database | Database Management System | 29

Finite Automata DFA to Regular Expressions | 082

Theory of Computation | Context free Grammar | Regular Language Examples and Identification | 108

Compiler Design: Eliminating left recursion left factoring, Removing Ambiguity | 36 Grammar Example

55 | Operator Precedence Parser part 1 | Compiler Design

Normalization in Database DBMS 1NF 2NF 3NF with Example in hindi | Concepts, Tricks & ShortCut | 50

Eliminating Ambiguity | Convert Ambiguous Grammar to Unambiguous Grammar Examples | 38

69 | SYNTAX DIRECTED TRANSLATION SDT part 1 | Compiler Design

Conversion of Epsilon NFA to NFA Example | Automata Theory GATE Lectures TOC | 060

Functional Dependency (FD) in DBMS Databases with example | 12

DBMS Databases Lecture : Solutions for Update, Deletion and Insertion Anomalies | 30

Super Key and Candidate Key in DBMS | Database Management System | Super key Example | 04

Primary Key, Candidate Key, Super Key, Alternate Key, Composite Key in DBMS with Example | Database

Super Key, Candidate Key and Primary Key DBMS Database Design (Concepts, Tricks & ShortCut) | 03

Primary Key, Candidate Key, Alternate Key, Composite Key | DBMS Databases Lecture | 02

How to use Functional Dependencies to determine keys | Candidate Key from Functional Dependency | 19

Determine if a Language is Context free or not and Regular or not | Theory of Computation | 117

Language Associated with Regular Expression | Regular Expression Language Examples | 064

Lexical Analysis Lex Lexical Errors | Syntax Error on Token Examples | Recognition of Tokens | 24

71 | SYNTAX DIRECTED TRANSLATION SDT part 3 | Compiler Design