Asymptotic notation. Divide and conquer: Strassen's algorithm for matrix multiplication, quicksort. Solving recurrences: substitution method, master method. Bounding summations. Randomized quicksort: analysis. Medians and order statistics. Heaps: heapsort, priority queues. Sorting in linear time. Dynamic programming: matrix-chain multiplication, longest common subsequence, O/1 Knapsack problem, resource allocation problem. Greedy algorithms: activity selection problem, Hufmann codes, task scheduling problem. Amortized analysis: aggregate, accounting and potential methods, dynamic tables.
İlk dosyayı sen ekleyebilirsin — notlar, geçmiş finaller, çözümler, cheat-sheet, ne varsa. Drive linki / PDF / ZIP / fotoğraf, hepsi olur.
Şu an: mail at, ben düzenleyip yayına alayım. Form/upload UX yakında geliyor (Kimya tasarlıyor).
| Dönem | Course CPA | |
|---|---|---|
| 2024-2025 Fall | 2.69 | 2 sec · 11 öğr |
| 2024-2025 Spring | 2.88 | 3 sec · 7 öğr |
| 2023-2024 Fall | 2.80 | 3 sec · 11 öğr |
| 2023-2024 Spring | 1.53 | 3 sec · 9 öğr |
| 2022-2023 Spring | 1.35 | 1 sec · 3 öğr |
| 2021-2022 Spring | 3.00 | 2 sec · 10 öğr |
| 2020-2021 Fall | 2.63 | 2 sec · 9 öğr |
| 2020-2021 Spring | 2.81 | 2 sec · 7 öğr |
| 2019-2020 Fall | 2.69 | 2 sec · 11 öğr |
| 2019-2020 Spring | 3.23 | 2 sec · 3 öğr |
Aggregate course GPA — Bilkent STARS'tan public data. Hoca-bazlı per-section detayı için STARS evaluation report →. Öğrenci anket cevapları KVKK kapsamında defter'de tutulmaz.
Obtain 20 points out of 75 points until final exam.
Introduction: analysing algorithms, designing algorithms. Asymptotic notation. Divide and conquer: Strassen Randomized quicksort: analysis. Medians and order statistics. Heaps: heapsort, priority queues. Sorting in linear time. Dynamic programming: matrix-chain multiplication, longest common subsequence. Dynamic programming: 0/1 Knapsack problem, resource allocation problem. Greedy algorithms: activity selection problem, Hufmann codes. Greedy algorithms: task scheduling problem. Amortized analysis: aggregate, accounting and potential methods. Dynamic tables Review ECTS - Workload Table: Activities Number Hours Workload Preparation for Midterm exam 6 5 30 Individual or group work 14 2 28 Project (including preparation and presentation if applicable) 1 20 20 Midterm exam 6 2 12 Preparation for Final exam 1 10 10 Final exam 1 2 2 Course hours 14 3 42 Total Workload: 144 Total Workload / 30: 144 / 30 4.8 ECTS Credits of the Course: 5 Type of Course: Lecture Course Material: Written - PP Teaching Methods: Assignment - Exercises - Lecture - Presentations