16:38
Characteristics of Algorithms | PCCST502 | CST306 | MODULE 1 | KTU | Anna Thomas
10:24
Criteria for Analyzing Algorithms | PCCST502 | CST306 | MODULE 1 | KTU | Anna Thomas
14:33
Time & Space Complexity: Best, Worst, Average Case | PCCST502 | CST306 | MODULE 1 | KTU |Anna Thomas
21:54
Time & Space Complexity: Solved Questions | PCCST502 | CST306 | MODULE 1 | KTU | Anna Thomas
18:38
Asymptotic Notation: Big-Oh, Big-Omega, Big-Theta | PCCST502 | CST306 | MODULE 1 | KTU | Anna Thomas
11:37
Asymptotic Notations and their properties | PCCST502 | CST306 | MODULE 1 | KTU | Anna Thomas
19:17
Solution of Recurrence Eqn: Substitution Method | PCCST502 | CST306 | MODULE 1 | KTU | Anna Thomas
14:58
Solving by Recursive Tree Method | PCCST502 | CST306 | MODULE 1 | KTU | Anna Thomas
10:59
Iteration Method, Master’s Theorem | PCCST502 | CST306 | MODULE 1 | KTU | Anna Thomas
17:28
BST, Self Balancing Tree: AVL Trees | PCCST502 | CST306 | MODULE 1,2 | KTU | Anna Thomas
13:11
AVL Trees: Insertion of Elements | PCCST502 | CST306 | MODULE 1,2 | KTU | Anna Thomas
12:14
AVL Trees: Deletion of Elements | PCCST502 | CST306 | MODULE 1,2 | KTU | Anna Thomas
13:41
Disjoint Sets: Operations and Representations | PCCST502 | CST306 | MODULE 2 | KTU | Anna Thomas
8:07
Simple Union and Weighted Union: Algorithms | PCCST502 | CST306 | MODULE 2 | KTU | Anna Thomas
12:44
Find and Collapsing Find: Algorithm and Example | PCCST502 | CST306 | MODULE 2 | KTU | Anna Thomas
13:42
DFS and BFS Traversal: Analysis, Examples | PCCST502 | CST306 | MODULE 2 | KTU | Anna Thomas
20:18
Strongly Connected Components in DG, Topological Sorting | PCCST502 | CST306 | KTU | Anna Thomas
4:18
Control Abstraction of Divide and Conquer | PCCST502 | CST306 | MODULE 2,3 | KTU | Anna Thomas
27:05
2-way Merge Sort: Algorithm, Examples | PCCST502 | CST306 | MODULE 2,3 | KTU | Anna Thomas
13:20
Strassen’s Algorithm for Matrix Multiplication | PCCST502 | CST306 | MODULE 2,3 | KTU | Anna Thomas
19:12
Greedy Strategy: Fractional Knapsack Problem | PCCST502 | CST306 | MODULE 3 | KTU | Anna Thomas
9:56
Minimum Cost Spanning Tree, Kruskal’s Algorithm | PCCST502 | CST306 | MODULE 3 | KTU | Anna Thomas
16:12
Single Source Shortest Path, Dijkstra’s Algorithm | PCCST502 | CST306 | MODULE 3 | KTU | Anna Thomas
21:42
Dynamic Programming, The Optimality Principle | PCCST502 | CST306 | MODULE 3,4 | KTU | Anna Thomas
23:43
Matrix Chain Multiplication | PCCST502 | CST306 | MODULE 3,4 | KTU | Anna Thomas
22:27
All Pairs Shortest Path: Floyd-Warshall Algorithm | PCCST502 | CST306 | MODULE 3,4 |KTU| Anna Thomas
15:21
Back Tracking, N Queen’s Problem | PCCST502 | CST306 | MODULE 3,4 | KTU | Anna Thomas
Branch & Bound: Travelling Salesman Problem | PCCST502 | CST306 | MODULE 4 | KTU | Anna Thomas
15:25
Complexity Class: P, NP, NP-Hard & NP-Complete | PCCST502 | CST306 | MODULE 4,5 | KTU | Anna Thomas
13:56
NP Completeness Proof of Clique Problem | PCCST502 | CST306 | MODULE 4,5 | KTU | Anna Thomas
10:14
NP Completeness Proof of Vertex Cover Problem | PCCST502 | CST306 | MODULE 4,5 | KTU | Anna Thomas
21:59
Approximation Algorithms, Bin Packing | PCCST502 | CST306 | MODULE 4,5 | KTU | Anna Thomas
5:50
Randomized Algorithms: Monte Carlo, Las Vegas | PCCST502 | CST306 | MODULE 4,5 | KTU | Anna Thomas
6:22
Randomized version of Quick Sort algorithm | PCCST502 | CST306 | MODULE 4,5 | KTU | Anna Thomas
