1. Algorithms Design and Analysis CS 411 1

2. Course description / Algorithms Design and Analysis Course name and Number: Algorithms designs and analysis – CS 411 Number of credits: 3 (contact hours: lecture - 3, exercise – 1) Level or year in which the course is offered: Level 7 Pre-requisite course(s) : Data structures - CS 322 + Discrete structures – CS 310 2

3. Brief description Apply the basic techniques for algorithm analysis. Use, compare and analyze the primary sorting and searching algorithms. Use, compare and analyze the primary graph processing algorithms. Describe some of the algorithms used for mathematical applications. Describe and apply the divide-and-conquer, greedy, dynamic programming backtracking, and branch-and- bound methods. Describe lower bound theory. 3

4. 1- Topics to be discussed (theoretical content): Contact hours Number of weeks Topic 31  Introduction to the course content, text book(s), reference(s) and course plan.  Introduction to Algorithm, Study of Algorithms, Growth of Functions, Asymptotic notations, Turing Machine. 31 Recurrences Substitution Method, Recursion-tree method, Master method 31 Bubble sort, Insertion sort, Heap sort. Divide and Conquer Merge sort, Quick sort, 31 Divide and Conquer (contd.) Binary search, Strassen’s algorithm for Matrix multiplication. 31 Introduction to Graph Theory Graph categorization, Graph terminology, Representation of graphs 4

5. 31 Greedy Graph Algorithms Depth-First Search (DFS), Breadth-First Search (BFS) Greedy method, Kruskal algorithm. 31 Greedy Graph Algorithms (contd.) Prim's algorithm, Dijkstra’s Algorithm. 31 Greedy Graph Algorithms (contd.)  Fractional knapsack problem, Task scheduling problem  Dynamic Programming  Elements of dynamic programming, divide- and-conquer vs. dynamic programming 31 Dynamic Programming (contd.) Matrix chain multiplication problem, 0-1 knapsack problem, etc. 5 31 Data Compression Lossy and lossless compression, fixed length coding, variable length coding.

6. 31 Data Compression (contd.) Entropy, Huffman coding etc. Backtracking Methods 31 Branch and Bound method Assignment problem, Travelling saleman problem, graph coloring problem. 31 NP-Completeness Polynomial-time Reductions 62 Cook's Theorem 6

7. 4 - Schedule of Assessment Tasks according to which the students are evaluated during the Semester Assessment weight (%) Due week The nature of the evaluation function (e.g.: article, quiz, group project, etc.) index 15%Week 7First exam1 20%Week 12Second exam2 5%Weeks 5 & 10Theoretical assignments3 60%After Week 15Final exam (Theory)4 100%Total: 7

8. The principal book(s) requested: “INTRODUCTION TO ALGORITHMS”, by Cormen, Leiserson, Rivest and Stein, latest Edition, MIT Press. 8