| 1 | Course Title: | ANALYSIS OF ALGORITHMS |
| 2 | Course Code: | BMB3003 |
| 3 | Type of Course: | Compulsory |
| 4 | Level of Course: | First Cycle |
| 5 | Year of Study: | 3 |
| 6 | Semester: | 5 |
| 7 | ECTS Credits Allocated: | 6 |
| 8 | Theoretical (hour/week): | 4 |
| 9 | Practice (hour/week) : | 0 |
| 10 | Laboratory (hour/week) : | 0 |
| 11 | Prerequisites: | |
| 12 | Recommended optional programme components: | None |
| 13 | Language: | Turkish |
| 14 | Mode of Delivery: | Face to face |
| 15 | Course Coordinator: | Dr. Ögr. Üyesi Metin BİLGİN |
| 16 | Course Lecturers: | |
| 17 | Contactinformation of the Course Coordinator: |
Bilgisayar Müh. Bölüm Binası, 1. kat, oda 3 Tel.:+90 (224) 275 52 63 email: metinbilgin at uludag.edu.tr |
| 18 | Website: | |
| 19 | Objective of the Course: | The necessary information is taught to recommend mathematical models to these derste computation problems. Algorithms, paradigms and data structures for solving computational problems are described. |
| 20 | Contribution of the Course to Professional Development |
| 21 | Learning Outcomes: |
|
| 22 | Course Content: |
| Week | Theoretical | Practical |
| 1 | Introduction | |
| 2 | Asymptotic Complexity | |
| 3 | Brute Force Algorthms | |
| 4 | Divide and Conquer | |
| 5 | Recurrence Equations | |
| 6 | Sorting Algorithms | |
| 7 | Sorting Algorithms | |
| 8 | Dynamic Programming | |
| 9 | Dynamic Programming | |
| 10 | Greedy Algortihm | |
| 11 | Graphs | |
| 12 | Searching Algortihms | |
| 13 | Data Compression | |
| 14 | NP Theory |
| 23 | Textbooks, References and/or Other Materials: |
Cormen, Thomas, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms. 3rd ed. MIT Press, 2009. ISBN: 9780262033848. Miller, Bradley, and David Ranum. Problem Solving with Algorithms and Data Structures Using Python. 2nd ed. Franklin, Beedle & Associates, 2011. ISBN: 9781590282571. |
| 24 | Assesment |
| TERM LEARNING ACTIVITIES | NUMBER | PERCENT |
| Midterm Exam | 1 | 25 |
| Quiz | 0 | 0 |
| Homeworks, Performances | 2 | 15 |
| Final Exam | 1 | 60 |
| Total | 4 | 100 |
| Contribution of Term (Year) Learning Activities to Success Grade | 40 | |
| Contribution of Final Exam to Success Grade | 60 | |
| Total | 100 | |
| Measurement and Evaluation Techniques Used in the Course | ||
| Information | ||
| 25 | ECTS / WORK LOAD TABLE |
| Activites | NUMBER | TIME [Hour] | Total WorkLoad [Hour] |
| Theoretical | 14 | 4 | 56 |
| Practicals/Labs | 0 | 0 | 0 |
| Self Study and Preparation | 14 | 5 | 70 |
| Homeworks, Performances | 2 | 24 | 48 |
| Projects | 0 | 0 | 0 |
| Field Studies | 0 | 0 | 0 |
| Midtermexams | 1 | 2 | 2 |
| Others | 0 | 0 | 0 |
| Final Exams | 1 | 2 | 2 |
| Total WorkLoad | 178 | ||
| Total workload/ 30 hr | 5,93 | ||
| ECTS Credit of the Course | 6 |
| 26 | CONTRIBUTION OF LEARNING OUTCOMES TO PROGRAMME QUALIFICATIONS | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| LO: Learning Objectives | PQ: Program Qualifications |
| Contribution Level: | 1 Very Low | 2 Low | 3 Medium | 4 High | 5 Very High |