CSE ACADEMY
Welcome to CSE ACADEMY
I'm a passionate Computer Science and Engineering educator dedicated to making complex topics easy to understand. On this channel, you'll find tutorials, deep dives, short tricks and explanations of subjects like Theory of computation, programming, algorithms, data structures, operating systems, Compiler design, and more. Whether you're a student preparing for exams like semester exam, GATE ,UGC NET or a professional looking to sharpen your skills, there's something here for you.
Subscribe and stay updated with the latest in technology and computer science!
Pushdown Automata for L = a^2nb^n | PDA for a^2nb^n | Theory of Computation |TOC |FLAT
Regular Grammar | Types of Regular Grammar | Right Linear & Left Linear Grammar | TOC |TAFL | FLAT
Chomsky Hierarchy | Identification of Grammars Explained with Examples | TOC | Automata Theory
if else Ladder in C | write C program to print grade of students | CPP | Logic Building
C Program to Check whether the number is even or odd | CCP | logic Building
Knapsack Problem with Example | Greedy Algorithms in DAA | Fractional Knapsack
Kruskal’s Algorithm | Minimum Spanning Tree using | Step-by-Step Example | DAA
Kruskal Algorithm for Minimum Spanning Tree | MCST |MST|Example | Graph Theory | DAA | Algorithm
Spanning Tree with Example | Minimum Spanning Tree | Algorithm
CFG to PDA Conversion | Equivalence of CFG and PDA | Construct PDA | Pushdown Automata | TOC | TAFL
NFA for Third Symbol from Right End is Always 'a' | Finite Automata | Regular Expression | DFA
Ambiguous Grammar | Remove Ambiguity | Conversion of Ambiguous to Unambiguous Grammar with Example
Chomsky Normal Form | CNF | Normal form of CFG | Conversion of CFG to CNF | TOC | FLAT | TAFL
Greibach Normal Form (GNF)| CFG normal form | TOC | FLAT | Solved Example-5
PushDown Automata (PDA) Model | Structure|Types of PDA with example
PDA for even length Palindrome |L = ww^r | Pushdown Automata | TOC | TAFL | FLAT
Turing Machine for Odd or Even Palindrome | ww^r | wcw^r | TOC | FLAT | TAFL
Design DFA for Number of 0's Not Divisible by 3 | TOC | FLAT | TAFL
PDA to CFG Conversion | Equivalence of PDA and CFG | Automata Theory| TOC | TAFL | FLAT
Ambiguous Grammar | Ambiguity in CFG with Example | TOC | FLAT | TAFL | COMPILER
Two Stack PDA | 2 Stack PDA for a^nb^mc^nd^m| Automata Theory | TOC | TAFL | FLAT
Two Stack PDA | 2 Stack PDA for a^nb^nc^nd^n | Automata Theory | TOC | TAFL | FLAT
Two Stack PDA | 2 Stack PDA for a^nb^nc^n | Automata Theory | TOC | TAFL | FLAT
Conversion of Finite Automata to Regular Expression | Arden's Theorem | TOC|TAFL|Short tricks 🔥P-5
Determine FA accepted by the Regular Expression | (0+1)*0(0+1)*0(0+1)* | TOC | TAFL | COMPILER
Construct DFA for Ternary Number Divisible by 4 | Finite Automata | TOC | TAFL
Turing Machine for a^2n b^n | Design Turing Machine | Automata Theory | TOC | FLAT | TAFL
Conversion from Left Linear to Right Linear Grammar | Regular Grammar |TOC | TAFL | P-2
Epsilon ε-NFA to DFA Conversion with Example | Eliminate Epsilon ε Moves | TOC | Automata | TAFL
Conversion of Finite Automata to Regular Expression | Arden's Theorem | TOC|TAFL|Short tricks 🔥P-4