| Course Unit Code | Course Unit Title | Type of Course Unit | Year of Study | Semester | Number of ECTS Credits | | Fİ122 | Advanced Algorithms | Elective | 1 | 2 | 6 |
|
| Level of Course Unit |
| Second Cycle |
| Objectives of the Course |
| The aim of this course can be stated as follows;
* The aim is to enable students to have knowledge about advanced algorithms and problem solving structures, and to design algorithms using these basic structures when faced with a problem, and to gain the ability to implement these algorithms with a structured programming language.
* Introduce algorithms by looking at real-life problems that motivate their use. |
| Name of Lecturer(s) |
| Dr. Öğr. Üyesi Murat KARAKUŞ |
| Learning Outcomes |
| 1 | Students will be able to classify different types of advanced algorithms and their uses. | | 2 | Students will be able to explain the time and space complexity of different types of advanced algorithms. | | 3 | Students will be able to create efficient "greedy" algorithms to solve specific computational problems. | | 4 | Students will be able to code efficient "divide and conquer" type algorithms to solve specific computational problems. | | 5 | Students will be able to formulate efficient "dynamic programming" algorithms to solve specific optimization problems. |
|
| Mode of Delivery |
| Normal Education |
| Prerequisites and co-requisities |
| There are no prerequisites. |
| Recommended Optional Programme Components |
| Not available. |
| Course Contents |
| Students will learn a range of design and analysis techniques with which they will be involved in computer applications. 'Greedy' algorithms, 'Divide and Fthet (Divide and Conquer)', 'Decrease and Conquer', 'Transform and Conquer', 'Brute Force' type algorithms and dynamic programming (Dynamic Programming) will be discussed with different sample applications. |
| Weekly Detailed Course Contents |
|
| 1 | Basic concepts | | | | 2 | Basic concepts | | | | 3 | Algorithm Concept | | | | 4 | Algorithm Concept | | | | 5 | Algorithm Analysis | | | | 6 | Algorithm Analysis | | | | 7 | Brute Force Algorithms | | | | 8 | Divide and Conquer Method | | | | 9 | Decrease and Conquer Method | | | | 10 | Transform and Conquer Method | | | | 11 | Dynamic Programming | | | | 12 | Greedy Algorithms | | | | 13 | Greedy Algorithms | | | | 14 | Overall Recap | | |
|
| Recommended or Required Reading |
| 1. Lecturer notes
2. Levitin, A. Introduction to the Design and Analysis of Algorithms. 3rd ed. Pearson International Edition
3. Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. 2nd ed. MIT Press. |
| Planned Learning Activities and Teaching Methods |
|
| Assessment Methods and Criteria | |
| Midterm Examination | 1 | 100 | | SUM | 100 | |
| Final Examination | 1 | 100 | | SUM | 100 | | Term (or Year) Learning Activities | 40 | | End Of Term (or Year) Learning Activities | 60 | | SUM | 100 |
| | Language of Instruction | | Turkish | | Work Placement(s) | | No |
|
| Workload Calculation |
|
| Midterm Examination | 1 | 1 | 1 |
| Final Examination | 1 | 2 | 2 |
| Attending Lectures | 14 | 3 | 42 |
| Self Study | 14 | 9 | 126 |
|
| Contribution of Learning Outcomes to Programme Outcomes |
| LO1 | 4 | 1 | 1 | 1 | 3 | 1 | 4 | 1 | 1 | 1 | | LO2 | 4 | 1 | 1 | 1 | 3 | 1 | 4 | 1 | 1 | 1 | | LO3 | 4 | 1 | 1 | 1 | 3 | 1 | 4 | 1 | 1 | 1 | | LO4 | 4 | 1 | 1 | 1 | 3 | 1 | 4 | 1 | 1 | 1 | | LO5 | 4 | 1 | 2 | 1 | 3 | 1 | 4 | 1 | 1 | 1 |
|
| * Contribution Level : 1 Very low 2 Low 3 Medium 4 High 5 Very High |
 |
| |