الخطة التدريسية لمادة تحليل وتصميم خوارزميات

(( أستمارة الخطة التدريسية السنوية ))
Course Instructor Farah Mohammed Hassan Al-Sharefii
فرح محمد حسن الشريفي
E_mail Farahmh1982@yahoo.com
Title Algorithms Design and Analysis
Course Coordinator

Course Objective
1- تعلم كيفية كتابة خوارزمية متضمنة كل شروطها.
2- تعلم أهم أنواع الخوارزميات وكيفية التعبير عن الخوارزمية و فهم الفرق بين الخوارزمية والبرنامج.
3- تعلم كيفية حساب تعقيدات الخزن والوقت للخوارزميات التكرارية (Iterative Algorithms) وخوارزميات الاستدعاء الذاتي (Recursion Algorithms) وباستخدام طرق تخمين التعقيدات المختلفة.
4- تعلم كيفية حساب تعقيدات الوقت بالحالات الأفضل و الأسوأ والمتوسطة للخوارزميات.
5- معرفة كيفية قياس انجازية الخوارزميات.
6- التعرف على فكرة تصميم الخوارزميات مثل Divide-and-Conquer و Greedy Method و Dynamic Programming و Backtrackingو Branch-and-Bound وكيفية تطبيقها في حل المشاكل من خلال اخذ بعض أمثلة المشاكل وكيفية حلها بهذه الخوارزميات.
7- هم مفهوم تحليل استهلاك الدين واهم تقنياته وكيفية تطبيقه.
8- فهم الخوارزميات المتوازية مع أهم تطبيقاتها و تعلم متى التوازي يمكن أن يستخدم.
9- تعلم نماذج (PRAM ) التي سينفذ عليها الخوارزميات المتوازية المصممة و تعلم كيفية كتابة خوارزمية متوازية باخذ بعض الامثلة.


Course Description

Algorithms definition: it s conditions , types of algorithms, Algorithm analysis methods, The best, Average and worst case Analysis, and performance measurement with example, Divide-and-Conquer method, Greedy Method, Dynamic programming method, The Backtracking method, Branch and Bound method, Amortized Analysis, Introduction to Parallel Algorithms.


Textbook Horowitz, E., Sahni, S., and Rajasekaran, S. (1997).Computer Algorithms/C++, W.H.Freeman Press.
Neapolitan, R. and Naimipour, K.(2004). Foundations of Algorithms Using C++ Pseudocode, Third Edition, Jones and Bartlett Publishers.

References
Cormen,T. H., Leiserson,C. E., Rivest, R. L., and Stein, C.(2001). Introduction to Algorithms, Second Edition, MIT press.
Leiss , E. L.(2007). A Programmer’s Companion to Algorithm Analysis, Chapman & Hall/CRC.
Drozdek, A.(2001). data structures and algorithms in C++, 2nd Edition, Brokes/Cole.
parberry, I.(2001). Lecture notes on algorithm analysis and computational complexity, Fourth Edition, university of north texas.
parberry, I. and Gasarch, W.(2002). problems on algorithms, second Edition, I. parberry and W. Gasarch. Alsuwaiyel, M. H.(1999). Algorithms design techniques and analysis, world scientific publishing.
ATALLAH, M. J. (1999). Algorithms and theory of computation handbook, CRC Press.
Sahni, S.(1998). data structures, algorithms, and applications in c++, McGraw-Hill companies, Inc.
EDMONDS, J. (2008). HOW TO THINK ABOUT ALGORITHMS, Cambridge University Press.
McConnell, J. J.(2001). Analysis of Algorithms:An Active Learning Approach, Jones and Bartlett Publishers, Inc.
Miller, R. and Boxer, L. (2005).Algorithms Sequential and Parallel: A Unified Approach, 2nd Edition, Career & Professional Group, a division of Thomson Learning Inc.
Skiena, S. S.(2008). The Algorithm Design Manual, 2nd edition, Springer-Verlag London Limited
Kleinberg, J. and Tardos, E. (2006). Algorithm Design , 1st edition, Pearson Education, Inc..

Course Assessment Term Tests Laboratory Quizzes Project Final Exam
As (25%) As (10%) As (05%) ---- As (60%)


General Notes

Study system : yearly





جدول الدروس الاسبوعي – الفصل الدراسي الاول
الملاحظات الماده العملية الماده النظرية التاريخ الاسبوع
Getting Started with VB.NET 2008 Introduction to Algorithm Design and Analysis and reviewing the syllabus and study plan 1
Language Principles of VB.net 2008 Algorithms definition: it s conditions , Algorithm analysis methods : space and time complexity, Operations Count Method with examples 2
Simple Visual Basic Project step count method , Analysis of the recursion codes with step count method, some mathematical facts , summation formula and complexity analysis from pseudo-code 3
Writing and Using Procedures and functions . complexity analysis by Asymptotic Notations with Examples 4
Working with Forms The best, Average and worst case Analysis with examples 5
Basic Windows Controls performance measurement with examples 6
Basic Windows Controls Divide-and-Conquer method with binary search Example 7
First Exam First Exam 8
Printing with VB.NET Divide-and-Conquer method for Merge sort problem 9
The TreeView and ListView Controls Divide-and-Conquer method for Quick sort problem 10
Implement the performance measurement Greedy Method with knapsack problem example 11
Implement the Divide-and-Conquer method with binary search Greedy Method for optimal storage pattern, optimal merge pattern, single source shortest path problem ( Dijkstra Algorithm ) 12
Implement the Divide-and-Conquer method for Quick sort Greedy Method for scheduling problem 13
Implement the Greedy Method for optimal storage pattern, optimal merge pattern, single source shortest path problem ( Dijkstra Algorithm ) Dynamic programming method with multistage graph problem 14
Implement the Greedy Method for scheduling problem All pair paths and Belman-Ford Algorithm 15
Second Exam 16
عطلة نصف السنة عطلة نصف السنة 17


جدول الدروس الاسبوعي – الفصل الدراسي الثاني

الملاحظات الماده العملية الماده النظرية التاريخ الاسبوع
Implement the Dynamic programming method with multistage graph problem The Backtracking method with n-Queens problem Example 1
Implement the The Backtracking method with n-Queens problem The Backtracking method for the sum-of-subset problem 2
Implement the The Backtracking method for Graph coloring problem Branch and Bound method 3
Second Exam Branch and Bound for 0/1 knapsack problem 4
Implement the The Backtracking method for 0/1 knapsack problem Branch and Bound for travelling sale man problem 5
Implement the The Backtracking method for the sum-of-subset problem Amortized Analysis 6
Implement the Branch and Bound for 0/1 knapsack problem Amortized Analysis 7
Implement the Branch and Bound for travelling sale man problem Amortized Analysis 8
Third Exam Third Exam 9
Implement the Parallel Searching Introduction to Parallel Algorithms 10
Implement the Parallel Sorting Introduction to Parallel Algorithms 11
Implement the Amortized Analysis examples Introduction to Parallel Algorithms 12
Implement the Linear Network Sort Introduction to Parallel Algorithms 13
Implement the Odd-Even Swap Sort Introduction to Parallel Algorithms 14
Fourth Exam Fourth Exam 15

مدرس المادة وتوقيعه رئيس القسم وتوقيعه العميد وتوقيعه
مدرس مساعد/ فرح محمد حسن د. محمد عبد الله ناصر د. عبد الكريم البيرماني