This document outlines the course schedule for a Computer Science course on Analysis and Design of Algorithms being held at Nahda University in Beni Suef, Egypt in the Spring 2023-2024 semester. The course will cover topics like algorithm complexity analysis, common design methods like divide-and-conquer, greedy algorithms, and dynamic programming. It will also discuss NP-hard and NP-complete problems. The schedule lists the topics to be covered in each week along with any important notes like exam dates or religious holidays.
This document outlines the course schedule for a Computer Science course on Analysis and Design of Algorithms being held at Nahda University in Beni Suef, Egypt in the Spring 2023-2024 semester. The course will cover topics like algorithm complexity analysis, common design methods like divide-and-conquer, greedy algorithms, and dynamic programming. It will also discuss NP-hard and NP-complete problems. The schedule lists the topics to be covered in each week along with any important notes like exam dates or religious holidays.
This document outlines the course schedule for a Computer Science course on Analysis and Design of Algorithms being held at Nahda University in Beni Suef, Egypt in the Spring 2023-2024 semester. The course will cover topics like algorithm complexity analysis, common design methods like divide-and-conquer, greedy algorithms, and dynamic programming. It will also discuss NP-hard and NP-complete problems. The schedule lists the topics to be covered in each week along with any important notes like exam dates or religious holidays.
Ministry of Higher Education جامعة النهضة Nahda University in Beni Suef كـــلية علــوم الحــاسب Faculty of Computer Science
Faculty: Computer Science
Department:Computer Science Academic Semester: Spring 2023-2024
Course: Analysis & Design of Algorithms Code: CS203
Week Date (2024) Lecture Content Assessments Notes
1 10 Feb: 15 Feb Revision
17 Feb: 22 Feb Algorithm concept, Analysis and
2 complexity 24 Feb: 29 Feb Design methods: Divide and 3 conquer: The general method, binary 2 Mar: 7 Mar search, merge sort, quick sort, 4 selection, and matrix multiplication Greedy method: The general 5 9 Mar: 14 Mar method, minimum spanning Trees. Dynamic programming: The 16 Mar: 21 Mar general method, shortest paths, 6 optimal search trees, and the traveling salesman problem. Dynamic programming: The 23 Mar: 28 Mar general method, shortest paths, 7 optimal search trees, and the traveling salesman problem.
8 30 Mar: 4 Apr
اجازه عيدالفطر المبارك و حتي4/01 من االربعاء
Ministry of Higher Education جامعة النهضة Nahda University in Beni Suef كـــلية علــوم الحــاسب Faculty of Computer Science
أحد الشعانين4/12 االحد
)(اجازة خاصة بالمسيحين 12 27 Apr: 2 May عيد العمال2/0 االربعاء خميس العهد2/1 الخميس )(اجازة خاصة بالمسيحين سبت النور (اجازة2/4 السبت )خاصة بالمسيحين 13 4 May: 9 May احد عيد القيامة2/2 االحد )(اجازة خاصة بالمسيحين شم النسيم2/6 االثنين Backtracking: The general method, the 8-queens problem. 14 11 May: 16 May NP-hard and NP-complete problems: Cook's theorem, NP- hard graph problems. Backtracking: The general method, the 8-queens problem. 15 18 May: 23 May NP-hard and NP-complete problems: Cook's theorem, NP- hard graph problems. 16 25 May: 30 May Revsion امتحانات ابتيك
17 30 May: 6 Jun
18 8 Jun: 13 Jun
Final Exams و حتي6/02 من السبت
19 15 Jun: 20 Jun عيد االضحي6/01 االربعاء المبارك 20 22 Jun: 27 Jun