Course overview Course title: Design and Analysis of Algorithms Instructors: Dr. Abdelouahid Derhab Credit hours: 7/week

Prerequisite Discrete Mathematics. Computer programming Data structure

Goals of the course This is an introductory level graduate course in the design and analysis of algorithms. The aim of the course is to provide a solid background in designing and analyzing algorithms. It is hoped that a student will be able to analyze and compare algorithms based on their efficiency, and also design efficient algorithms using several algorithm design paradigms.

Recommended textbooks Introduction to the Design & Analysis of Algorithms – 3rd Edition. A. Levitin, Pearson Addison-Wesley, Introduction to Algorithms 2 nd,Cormen, Leiserson, Rivest and Stein, The MIT Press, Introduction to Design & Analysis Computer Algorithm 3rd, Sara Baase, Allen Van Gelder, Adison-Wesley, 2000.

Course content Fundamentals of the Analysis of Algorithm Efficiency Brute Force and Exhaustive Search Decrease-and-Conquer Divide-and-Conquer Transform-and-Conquer Space and Time Trade-Offs Dynamic Programming Greedy Technique Introduction to NP-completeness

Grading Home work: 30 points –Exercises and problems –Programming assignments 3 Quizes: 30 points Exam: 40 points

Notes for communication Your header must start with [CSC311] Send your to address. Please write your name and your ID at the end of the