شرح مقرر تحليل وتصميم الخوارزميات لجامعة الأميره نوره - PNU كلية علوم الحاسب.
This course is a study of algorithm design, algorithm complexity analysis, and problem complexity analysis. Design techniques analyzed will include divide-and-conquer, dynamic programming, greedy algorithms, backtracking, and branch-and-bound. The course - Covers the common algorithms, algorithmic paradigms, and data structures utilized to resolve problems . Introduces basic algorithm performance measures and analysis techniques - Teaches techniques of design and analysis of algorithms. -Uses, Compares, and analyzes the primary sorting and searching algorithms. -Identifies and applies the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods. - Identifies differences among best, average, and worst case running times. - Explains time and space tradeoff.