lacture plan

(CS 301: Algorithm Design)
(1 Unit, 45 lectures, Final exam: 60 marks, 3 credit hours, in course: 40 marks)
Lec: 1 – 4 Introduction:
What is an algorithm
Algorithm specification
Performance Algorithm
Randomized Algorithm
Lec: 5 – 10 Elementary Data Structure:
Stack and Queues
Trees
Dictionaries
Priority Queues
Sets and Disjoint set Union
Graphs
Lec: 11 – 16 Divide and conquer:
General method
Binary search
Finding the maximum and minimum
Quick Sort
Selection
Lec: 17 – 22 The Greedy method:
General method
Knapsack problem
Minimum cost spanning trees
Single source Shortest path
Lec: 23 – 30 Dynamic Programming:
General method
Multistage Graphs
All pairs shortest paths
Single source Shortest path general weights
Optimal binary search tree
Lec: 31 – 33 Basic Traversal &Search technique:
Techniques for Binary trees
Techniques for Graphs
Lec: 34 – 38 Backtracking:
General method
The 8 – Queens problem
Sum of subsets
Graph coloring
Lec: 39 – 42 Branch and Bound:
The method
0/1 Knapsack problem
Traveling salesperson
Lec: 43 – 45 Review Classes