575 тысяч подписчиков
498 видео
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
109 Data Structures | Introduction to Queues | Queue Operations Part 1
71 | SYNTAX DIRECTED TRANSLATION SDT part 3 | Compiler Design
011 Programming Part 5 | Pointer to an Array | Array Pointer
Compiler Introduction | Difference between Compiler, Interpreter, Assembler | 02
Removing Ambiguity From Grammar Examples | Eliminating Ambiguity | Concepts, Tricks & ShortCut | 39
DBMS | Concurrency Control | Two Phase Locking (2PL) Protocol Examples | DBMS | Part 11 | 312
Context Sensitive Language Identification CSL | Theory of Computation | 102
Absolute Direct and Memory indirect Addressing Modes | Computer Organization | 05
Compiler Design Lecture | Inherently Ambiguous Language Example Ambiguous Grammar Example | 35
017 Programming Part 11 | Structure and Pointer | Pointer to Structure
Grammars, Derivation, Parsing, Parse tree, LMD & RMD, Leftmost and Rightmost Derivation | 25
Data Structure | Array | Row Major Order | Column Major Order | 08
Context free Grammar | Context free Language Type: equal number of a's and b's Examples | 112
PC Relative addressing modes, Base addressing modes, Indexed addressing modes | 06
C Programming | Difference Between Array and Pointer Variable Size with Example | 04
Non Trivial Functional Dependency Example | Database Management System | 15
Theory Of Computation | Minimization of DFA | 058
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
