-
Lecture Notes
Dear Students the Lecture Notes has been uploaded for the following topics:Introduction, Notion of an Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem Types, Fundamentals of the Analysis of Algorithm Efficiency, Asymptotic Notations and its properties, Mathematical Analysis for Recursive Algorithm, Mathematical Analysis for Non-recursive Algorithms, Brute Force: Selection Sort , Bubble Sort, Sequential Search and Closest Pair Problem, Traveling Salesman Problem, Knapsack Problem, Assignment Problem, Divide and Conquer Methodology: Merge Sort, Quick Sort , Multiplication of Large Integers and Strassen’s Matrix Multiplication, Dynamic Programming: Computing a Binomial Coefficient, Warshall’s Algorithm- Floyd’s Algorithm, Optimal Binary Search Trees, Knapsack Problem and Memory Functions, Limitations of Algorithm, Lower-Bound Arguments, Decision Trees , P, NP and NP-Complete Problems, Coping with the Limitations- Backtracking: n-Queens problem, Hamiltonian Circuit Problem, Subset Sum Problem, Branch and Bound: Assignment Problem, Knapsack Problem, Approximation Algorithms for NP Hard Problems, Ford Fulkerson Method, Naive String Matching Algorithm, Knuth Morris Pratt Algorithm- Analysis
-
Question Bank
Dear Students the Question Bank has been uploaded for the following topics:Traveling Salesman Problem
-
Resource Link
Dear Students the Resource Link has been uploaded for the following topics:All 5 units
-
Assignment
Assignment topic is Assignment I and due date is 28-03-2024.
-
Youtube Video
Dear Students the Youtube Video has been uploaded for the following topics:KMP algorithm0/1 Knapsack using Branch and Boundsubset sum problem using branch nad bound
-
Assignment
Assignment topic is Assignment II and due date is 31-05-2024.