Académique Documents
Professionnel Documents
Culture Documents
Lecture Schedule (weekly): WEEK# 1 TOPICS i. Introduction of the course, Objectives, Motivation, Course Overview ii. Analysis of Algorithms, Time Complexity Analysis, Space Complexity Analysis, Asymptotic Notations i. Mathematical Analysis of Non-Recursive Algorithms. ii. Analysis of recursive Algorithms i. Analysis of recursive Algorithms ii. Divide & Conquer i. Merge Sort Analysis. ii. Quick Sort Analysis i. Strassens Matrix Multiplication, ii. Multiplication of large Integers i. Class Test 1 ii. Sorting in Linear Time, Radix Sort i. Sorting in Linear Time, Radix Sort ii. Dynamic Programming i. Binomial Coefficient ii. Chained matrix Multiplications MidTerm i. Floyds Algorithm for Shortest Paths ii. Optimal Binary Search i. The Travelling Sales Person Problem ii. Introduction to Greedy Approach i. Minimum Spanning Trees ii. Dijkstras Algorthms i. Scheduling ii. Greedy Approach Versus Dynamic Programming i. Knapsack Problem ii. Backtracking Technique i. Class Test 2 ii. N-Queen Problem iii. N-Queen Problem iv. Graph Coloring i. The Hamiltonian Circuits Problem. ii. The Sum-of-Subsets Problem i. Introduction to Computational Complexity and Intractability ii. Theory of NP
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
Evaluation Criteria:
Mid term Class Tests Final Quizzes (unannounced) Project Lab Test (unannounced) Assignments (individual)