|
|
| IST1002 | Algorithm Design | 4+0+0 | ECTS:5 | | Year / Semester | Spring Semester | | Level of Course | First Cycle | | Status | Compulsory | | Department | DEPARTMENT of STATISTICS and COMPUTER SCIENCES | | Prerequisites and co-requisites | None | | Mode of Delivery | Face to face, Lab work , Practical | | Contact Hours | 14 weeks - 4 hours of lectures per week | | Lecturer | Dr. Öğr. Üyesi Halil İbrahim ŞAHİN | | Co-Lecturer | DOCTOR LECTURER Tolga BERBER | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | Understanding what algorithm is and using it in programming
|
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | Understand what an algorithm is | 5,9 | 1,3,4 | | LO - 2 : | Understand where to use algorithm | 5,8 | 1,3,4 | | LO - 3 : | Understand how to use algorithm in programming | 5,9 | 1,3,4 | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | | |
| Preparing algorithm, flow diagrams, algorithm about sets, number theory, algorithms about special numbers, golden rate, fibonacci numbers, graph theory, sorting algorithms
|
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Preparing Algorithm | | | Week 2 | Preparing Algorithm | | | Week 3 | Flow Charts | | | Week 4 | Flow Charts | | | Week 5 | Set Algorithms | | | Week 6 | Set Algorithms | | | Week 7 | Number Theory and its algorithms | | | Week 8 | Mid-term exam | | | Week 9 | Golden Rate and Fibonacci Numbers | | | Week 10 | Graph Theory and Algorithms about Graphs | | | Week 11 | Graph Theory and Algorithms about Graphs | | | Week 12 | Graph Theory and Algorithms about Graphs | | | Week 13 | Graph Theory and Algorithms about Graphs | | | Week 14 | Sorting Algorithms | | | Week 15 | Sorting Algorithms | | | Week 16 | End-of-term exam | | | |
| 1 | Nabiyev, Vasif V., 2007;Algoritmalar Teoriden Uygulamalara, Seçkin Yayınevi, Ankara | | | |
| 1 | Vatansever Fahri, 2007;Algoritma Geliştirme ve Programlamaya Giriş, Seçkin Yayınevi,Ankara | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | 11/04/2022 | 1 | 50 | | End-of-term exam | 15 | 30/05/2022 | 1 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 3 | 14 | 42 | | Sınıf dışı çalışma | 4 | 14 | 56 | | Arasınav için hazırlık | 10 | 1 | 10 | | Arasınav | 1.5 | 1 | 1.5 | | Proje | 2 | 14 | 28 | | Dönem sonu sınavı için hazırlık | 10 | 1 | 10 | | Dönem sonu sınavı | 1.5 | 1 | 1.5 | | Total work load | | | 149 |
|