1 / 7

Course overview

Course overview. Course title: Design and Analysis of Algorithms Instructors: Dr. Abdelouahid Derhab ( abderhab@ksu.edu.sa ) Credit hours: 7/week. Prerequisite . Discrete Mathematics. Computer programming Data structure. Goals of the course.

jude
Download Presentation

Course overview

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Course overview • Course title: Design and Analysis of Algorithms • Instructors: • Dr. AbdelouahidDerhab (abderhab@ksu.edu.sa) • Credit hours: 7/week

  2. Prerequisite • Discrete Mathematics. • Computer programming • Data structure

  3. 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.

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

  5. 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

  6. Grading • Home work: 30 points • Exercises and problems • Programming assignments • 3Quizes: 30 points • Exam: 40 points

  7. Notes for email communication • Your email header must start with [CSC311] • Send your email to abderhab@KSU.edu.sa email address. • Please write your name and your ID at the end of the email

More Related