Anna Thomas
This channel is dedicated to learning and helping others learn, with a focus on engineering concepts (KTU). Lectures are delivered in Malayalam, to make complex topics more understandable.
Pass DMS the Easy Way: Focus on These! | PCCST205 | DMS | KTU 2024 Scheme | Anna Thomas
Randomized version of Quick Sort algorithm | CST306 | AAD MODULE 5 | KTU | Anna Thomas
Randomized Algorithms: Monte Carlo, Las Vegas Algorithms | CST306 | AAD MODULE 5 | KTU | Anna Thomas
Approximation Algorithm: Graph Coloring | CST306 | AAD MODULE 5 | KTU | Anna Thomas
Approximation Algorithms, Bin Packing | CST306 | AAD MODULE 5 | KTU | Anna Thomas
NP Completeness Proof of Vertex Cover Problem | CST306 | AAD MODULE 5 | KTU | Anna Thomas
NP Completeness Proof of Clique Problem | CST306 | AAD MODULE 5 | KTU | Anna Thomas
Complexity Classes: P, NP, NP-Hard and NP-Complete | CST306 | AAD MODULE 5 | KTU | Anna Thomas
Pass COA the Easy Way: Focus on These! | CST202 | COA | KTU 2019 Scheme | Anna Thomas
Branch & Bound Algorithm for Travelling Salesman Problem | CST306 | AAD MODULE 4 | KTU | Anna Thomas
Back Tracking, N Queen’s Problem | CST306 | AAD MODULE 4 | KTU | Anna Thomas
All Pairs Shortest Path: Floyd-Warshall Algorithm | CST306 | AAD MODULE 4 | KTU | Anna Thomas
Matrix Chain Multiplication | CST306 | AAD MODULE 4 | KTU | Anna Thomas
Dynamic Programming, The Optimality Principle | CST306 | AAD MODULE 4 | KTU | Anna Thomas
Solved Question Paper Module 4, 5: May 2024 (Part 5) | CST302 | CD | KTU 2019 Scheme | Anna Thomas
Solved Question Paper Module 3: May 2024 (Part 4) | CST302 | CD | KTU 2019 Scheme | Anna Thomas
Solved Question Paper Module 3: May 2024 (Part 3) | CST302 | CD | KTU 2019 Scheme | Anna Thomas
Solved Question Paper Module 2: May 2024 (Part 2) | CST302 | CD | KTU 2019 Scheme | Anna Thomas
Solved Question Paper Module 1, 2: May 2024 (Part 1) | CST302 | CD | KTU 2019 Scheme | Anna Thomas
Single Source Shortest Path, Dijkstra’s Algorithm | CST306 | AAD MODULE 3 | KTU | Anna Thomas
Minimum Cost Spanning Tree, Kruskal’s Algorithm | CST306 | AAD MODULE 3 | KTU | Anna Thomas
Greedy Strategy: Fractional Knapsack Problem, Examples | CST306 | AAD MODULE 3 | KTU | Anna Thomas
Strassen’s Algorithm for Matrix Multiplication | CST306 | AAD MODULE 3 | KTU | Anna Thomas
2-way Merge Sort: Algorithm, Examples | CST306 | AAD MODULE 3 | KTU | Anna Thomas
Control Abstraction of Divide and Conquer | CST306 | AAD MODULE 3 | KTU | Anna Thomas
Strongly Connected Components in DG, Topological Sorting | CST306 | AAD MODULE 2 | KTU | Anna Thomas
DFS and BFS Traversal: Analysis, Examples | CST306 | AAD MODULE 2 | KTU | Anna Thomas
Find and Collapsing Find: Algorithm and Example | CST306 | AAD MODULE 2 | KTU | Anna Thomas
Simple Union and Weighted Union: Algorithm and Example | CST306 | AAD MODULE 2 | KTU | Anna Thomas
Disjoint Sets: Operations and Representations | CST306 | AAD MODULE 2 | KTU | Anna Thomas