Course Description
Course Aims and objectives
Course outlines
Text book and references
Prerequisite
Grading policy
Instructors and office hours
Syllabus
Time table
Lecture Notes
Attached Files
Previous Exams
Course Description
| The course covers: Asymptotic notation. Algorithm analysis methods. Greedy algorithms and divide-and-conquer algorithms. Dynamic programming. Probabilistic algorithms. Applications to sorting, scheduling, and graphs. Theoretical models for computing computational complexity. NP-complete and NP hard problems. Approximation algorithms |
Course Aims And Objective
| By the end of the semester, the student should be able to: (1) recognize the use of several design techniques (greedy, divide-and-conquer, dynamic programming) and use these methods to solve simple Problems. (2) Write and solve recurrence relations for recursive algorithms. (3) Determine asymptotic growth rates for algorithms. (4) Prove correctness of simple algorithms.(4) expose to advance topics in algorithm design and analysis; |
Course Outline
| 1. Introduction - Analysing algorithms and problems - Asymptotic analysis | |
| null | |
| 2. Algorithm techniques - Greedy method - Divide and conquer | |
| null | |
| 3. Amortized analysis methods -Aggregate Method -Accounting Method -Potential method | |
| null | |
| Dynamic Programming | |
| null |
Text book and references
| The Main Book | |
| Title | Introduction to Algorithms |
| Author(s) | |
| Edition | 8th Edition |
| Publisher | McGraw-Hill Book Company |
| The References Book | |
| Title | Computer Algorithms: Introduction to Design and Analysis |
| Author(s) | |
| Edition | 3rd Edition |
| Publisher | Sara Baase |
Grading Policy
| Activity | Weight |
| Midterm Exam | 30 |
| Research paper | 30 |
| Final Exam | 40 |
Instructors And Office Hours
| The Instructors of the Course | |
| Name: | جهاد قبيل عوده النهود |
| Office Hours: | Sunday10:00-11:00, Monday and Wdnesday 10:00-11:00, Tuesday 12:00-1:00 |
| Office Phone: | 3362 |
| Instrcutor Mail: | jehad@aabu.edu.jo |
Miscellaneous
Time Table
| Subject | Hours |
Lecture Notes
| Lecture Notes | ||
| L1-Algorithm review.ppt | View | |
| Attachment Files |
Previous Exams
| Previous Exams |