Analysis and Design of Algorithms
download syllabus
خطة المساق  
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
This course applies design and analysis techniques to numeric and nonnumeric algorithms which act on data structures. Design is emphasized so that the student will be able to develop new algorithms. Analysis of algorithms is concerned with the resources an algorithm must use to reach a solution. Only theoretical techniques of analysis are covered. Topics include introduction to algorithm, asymptotic complexity, sorting and searching, divide and conquer, greedy graph algorithms, dynamic programming, data compression, backtracking, branch and bound.
Course Aims And Objective
The main objective of this course is to make the student familiar with subjects concerning algorithm complexity. 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.;
Course Outline
Text book and references
 
The Main Book
Title Introduction to Algorithms
Author(s) Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest
Edition 3rd
Publisher MIT Press
 
 
The References Book
Title The design and Analysis of Computer Algorithms
Author(s) Aho, Hopcroft and Ullman
Edition null
Publisher Pearson education.
 
Title
Author(s) Sara Baase
Edition 3rd, 2000
Publisher Addison-Wesley Publishing Company
 
Title
Author(s) Horowitz, Sahni, Rajasekaran
Edition 1999
Publisher Galgotia Publications Pvt. Ltd
 
901240
Grading Policy
 
Activity Weight
الاختبار الاول 20
الاختبار الثاني 20
الاعمال الفصلية 10
الاختبار النهائي 50
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
 
Name: عامر عمر محمد ابو سالم
Office Hours:
Office Phone:
Instrcutor Mail:
 
Miscellaneous
 
Time Table
Subject Hours
Lecture Notes
 
Lecture Notes
ch4-divide and Conquer.ppt View
Ch-8DataCompression.ppt View
Ch-7 Dynamic Programming.ppt View
Introduction.ppt View
Ch-9binomail heap.ppt View
Ch-6-Greedy-Graph-Algorithms.ppt View
Ch3-Sorting-Algorithms.ppt View
ch2-recurrences.ppt View
Ch5 Binary Search.ppt View
Attachment Files
Previous Exams
 
Previous Exams
prev
exam.doc View