Design and Analysis of Algorithms Course Overview
"Explore the fundamentals of algorithm efficiency, design paradigms, and NP-completeness in this introductory graduate course. Dive into analysis, comparison, and efficient algorithm design. Recommended textbooks, grading details, and communication notes included."
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
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 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, 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.
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 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
