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

Making the student capable of writing efficient algorithms and thus efficient programs in terms of time and storage, where this is done by studying a set of standard strategies to design algorithms in addition to their analysis methods i.e determining time and space complexity.
أهداف المادة:
Algorithm, algorithm analysis, time and space complexity, recursive algorithms, asymptotic notations, performance measurement, divide & conquer, greedy method, dynamic programming, backtracking, branch & bound.
التفاصيل الاساسيه للمادة:
• Computer Algorithms, by Ellis Horowitz and at el, 1998
• Algorithms Design Techniques and Analysis, by M.H. Alsuwaivel, 2002. الكتب المنهجية:
Data Structures and Algorithms with Object-Oriented Design Patterns in C#,
By Bruno R. Preiss, 2001. المصادر الخارجية:
الامتحان النهائي السعي المختبرات النظري الفصل الدراسي
%50 %50 %32 %18 الاول
تقديرات الفصل:
معلومات اضافية:
























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

الأسبوع التاريخ المادة النظرية المادة العملية ملاحظات
1 25/ 9/2014 Introduction to algorithm and its characteristics.
Review of JAVA programming language
2 2/10/2014 Algorithm analysis (time and space complexities). Example in JAVA programming language
3 9/10 /2014 Practical examples Build a program to count the steps in iterative algorithms
4 16/10/2014 Recursive algorithms
Implement recursive algorithms
5 23/10/2014 Asymptotic notations Build a program to count the steps in recursive algorithms
6 30/10/2014 Best & worst & average cases Implementing Sequential Search Algorithm
7 6/11/2014
Performance measurement Computing the real time of sequential search algorithm