CSE ACADEMY

Optimal Binary Search Tree - Dynamic Programming |OBST|Algorithms|DAA|Short Tricks

Amortized Analysis || design and analysis of algorithms (DAA)

Akermann Function | TOC | Primitive Recursive Function | Short Tricks

Design a Turing Machine (TM) to convert 111 into 101| Theory of Computation (TOC) | example

Design DFA binary Numbers Divisible by 5 |DFA | Finte Automat(FA) |TOC| FLAT|Shortcut Tricks

Fuzzy set Operations|Set Theory|Relation|Cartesian product |Composition|Discrete Mathematics

Macro processor | system programming|solved program 1

Fuzzy set operations|union| intersection|Cartesian product|discrete Mathematics

Draw Binary Tree from Algebraic Expression|Discrete Mathematics and Graph Theory (DMGT) | Example -1

Find Alpha cut|support and height in fuzzy set |operations on fuzzy|Discrete Mathematics

Node Base in Graph Theory| Directed Graph | Reachability Set | Discreet Mathematics

Macro in System Programming| find MDT , MNT , ALA and Expanded Source Program fragment -2

Loader ||System Programming| examples#2|problem based on Direct Linking Loader|linker and loader

PDA to CFG Conversion | Equivalence of PDA and CFG | Automata Theory| TOC | TAFL | FLAT

Conversion of Finite Automata to Regular Expression in TOC ⚡

Construct DFA from Right Linear Grammar| Regular Grammar To Finite Automata| TOC|FLAT

Removing useless symbols| Simplification|Reduction of cfg in TOC | TOC | FLAT

Macro in System Programming|Macro processor | Definition| Solved example

CFG to PDA conversion | Equivalence of CFG and PDA |Construct PDA |Pushdown Automata | TOC | FLAT

💥Obtain Left most and Right most derivation and Parse Tree|CFG|TOC|FLAT | Ex -3

Ambiguous Grammar | Ambiguity in CFG with Example | TOC | FLAT | TAFL | COMPILER

Chomsky Normal Form | CNF | Normal form of CFG | Conversion of CFG to CNF | TOC | FLAT | Automata

Design Context Free Grammar(CFG) in Automata |Language L= a^nb^mc^md^n | Example | TOC | FLAT

Follow set in Compiler design|calculation of first() and follow () | Parser design

LL(1) Parser in Compiler design | LL(1) Parsing Table | Check whether a Grammar is LL(1) or Not

Pumping lemma for Regular Language| Prove Language a^nb^n is not Regular|TOC

Ambiguous Grammar | Remove Ambiguity | Conversion of Ambiguous to Unambiguous Grammar with Example

LL(1) Parsing Table | Check Whether Grammar is LL(1) or Not (Step-by-Step)

✴️Design Context Free Grammar(CFG) in Automata ⚡ L= a^nb^nc^md^m 🔥

Conversion from Right Linear to Left Linear Grammar | Regular Grammar | TOC |FLAT

Chomsky Normal Form | CNF | Normal form of CFG | Conversion of CFG to CNF | TOC | FLAT | TAFL

Epsilon NFA in TOC |Definition|Non Deterministic Finite Automata with Epsilon moves with example

Conversion from Right Linear to Left Linear Grammar | Regular Grammar |TOC |FLAT | P-2

Turing Machine for a^nb^nc^n | Design Turing Machine | Short Tricks with solved Examples| TOC | FLAT

Left Factoring in Compiler design| Elimination of LF | Context Free Grammar| CFG | LL(1) Parser

Elimination of Left Recursion|Compiler Design | CFG | LL(1) Parse

Minimization of CFG in TOC| Simplification of cfg| Removal of Null Productions|TOC | FLAT

Pushdown Automata for L = a^nb^n | PDA for a^nb^n | Theory of Computation |TOC |FLAT

Introduction to System Programming | components of System Software

Design Context Free Grammar(CFG) in Automata |Language L= a^ib^jc^k | Example | TOC | FLAT

Conversion from Left Linear to Right Linear Grammar | Regular Grammar |TOC |FLAT

4 Queen's problem using backtracking| design and analysis of algorithms (DAA)

Reduction of CFG| Removing null Productions | unit productions| Useless Productions

CFG to PDA Conversion | Equivalence of CFG and PDA | Construct PDA | Pushdown Automata | TOC | TAFL

Removal of Unit Production | Simplification of context Free Grammar| Reduction of CFG | TOC |FLAT

Write Possible Assembly language program | Macro in System Programming| MNT | MDT

Loader ||System Programming| examples#3 |problem based on Direct Linking Loader|linker and loader

Context Free Grammar(CFG) in Automata |Formal definition | Example | TOC | FLAT

Regular Grammar | Types of Regular Grammar | Right Linear & Left Linear Grammar | TOC |TAFL | FLAT

PDA for even length Palindrome |L = ww^r | Pushdown Automata | TOC | TAFL | FLAT

Pushdown Automata for L = a^2nb^n | PDA for a^2nb^n | Theory of Computation |TOC |FLAT