Information Package / Course Catalogue
| Course Code | : CSE464 |
| Course Type | : Area Elective |
| Couse Group | : First Cycle (Bachelor's Degree) |
| Education Language | : English |
| Work Placement | : N/A |
| Theory | : 2 |
| Prt. | : 2 |
| Credit | : 3 |
| Lab | : 0 |
| ECTS | : 6 |
The aim of the course is to give the students the ability to analyze algorithms accepted in the literature and to design new algorithms.
Algorithm design and analysis
| 1. | Gain the ability to use algorithm analysis methods and apply those methods on an algorithm given. |
| 2. | Be able to design algorithm. |
| 3. | To be able to calculate time and place complexity of algorithms. |
| 4. | Define the class of a given problem (like P, NP). |
| 5. | To be able to choose according to the problems encountered according to algorithms. |
| 1. | Introduction to the Design and Analysis of Algorithms (3rd ed.) by Anany Levitin, Pearson 978- 0-13-231681-1 |
| 2. | Introduction to Algorithms (3rd ed.) by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, The MIT Press 978-0-262-53305-8 |
| Type of Assessment | Count | Percent |
|---|---|---|
| Assignment | 5 | %20 |
| Project | 1 | %20 |
| Midterm Examination | 1 | %10 |
| Final Examination | 1 | %50 |
| Activities | Count | Preparation | Time | Total Work Load (hours) |
|---|---|---|---|---|
| Lecture - Theory | 14 | 1 | 2 | 42 |
| Lecture - Practice | 14 | 0 | 2 | 28 |
| Assignment | 5 | 0 | 3 | 15 |
| Project | 1 | 15 | 10 | 25 |
| Midterm Examination | 1 | 16 | 2 | 18 |
| Final Examination | 1 | 20 | 2 | 22 |
| TOTAL WORKLOAD (hours) | 150 | |||
PÇ-1 | PÇ-2 | PÇ-3 | PÇ-4 | PÇ-5 | PÇ-6 | PÇ-7 | PÇ-8 | PÇ-9 | PÇ-10 | PÇ-11 | |
OÇ-1 | 5 | 4 | 2 | 5 | 1 | ||||||
OÇ-2 | 4 | 3 | 5 | 4 | 2 | ||||||
OÇ-3 | 3 | 3 | 1 | 5 | 4 | ||||||
OÇ-4 | 3 | 2 | 1 | 3 | 1 | ||||||
OÇ-5 | 4 | 2 | 3 | 5 | 3 | ||||||