DFA Minimization using MNT | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET

Applications of MNT | CST301 | FLAT MODULE 3 | KTU | Anna Thomas | SJCET

Formal Languages and Automata Theory (FLAT) | S5 | CST301 | KTU | 2019 Scheme

Algorithm Analysis And Design (AAD) | S6 | CST306 | KTU | 2019 Scheme

Solved Model Question Paper: Module 1 | PCCST302 | TOC | KTU 2024 Scheme | Anna Thomas | SJCET

Basics: Symbols, Alphabets, String, Language | CST301 | FLAT MODULE 1 | KTU | Anna Thomas | SJCET

Introduction to DBMS, Data Models, Schemas and Instances | PCCST402 | KTU 2024 Scheme | Anna Thomas

Inherent Ambiguity, CFG & Prog Languages | PCCST302 | TOC MODULE 2 | KTU | 2024 Scheme | Anna Thomas

Solved Model Question Paper: Module 2 | PCCST302 | TOC | KTU 2024 Scheme | Anna Thomas | SJCET

Decision Property: Context-Free Language | PCCST302 | TOC MODULE 3 | KTU | 2024 Scheme | Anna Thomas

Solved Model Question Paper: Module 4 | PCCST302 | TOC | KTU 2024 Scheme | Anna Thomas | SJCET

Database Languages and Interfaces | PCCST402 | KTU 2024 Scheme | Anna Thomas

Easy Pass & Exam Preparation Guide | CST301 | FLAT | KTU 2019 Scheme | Anna Thomas

Detailed Explanation Recurrence Eqn: Substitution Method | CST306 | AAD MODULE 1 | KTU | Anna Thomas

Centralized and Client/Server Architectures for DBMS | PCCST402 | KTU 2024 Scheme | Anna Thomas

Solved Model Question Paper: Module 3 | PCCST302 | TOC | KTU 2024 Scheme | Anna Thomas | SJCET

Resolving Ambiguity | PCCST302 | TOC MODULE 2 | KTU | 2024 Scheme | Anna Thomas

Application of FA: Keyword Recognition | PCCST302 | TOC MODULE 1 | KTU | 2024 Scheme | Anna Thomas

Detailed Explanation: Solving by Recursive Tree Method | CST306 | AAD MODULE 1 | KTU | Anna Thomas

Theory of Computation | S3 | PCCST302 | KTU | 2024 Scheme

Three-Schema Architecture, Data Independence | PCCST402 | KTU 2024 Scheme | Anna Thomas