Introduction to data structures and algorithm analysis. Time complexity, space complexity, and related trade-offs. Dynamic memory management. Sorting algorithms. Implementation and analysis of abstract data types: lists, stacks, and queues. C++ Standard Template Library.
İ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 | |
|---|---|---|
| 2025-2026 Fall | 2.58 | 3 sec · 169 öğr |
| 2024-2025 Fall | 2.45 | 3 sec · 196 öğr |
| 2024-2025 Spring | 2.12 | 2 sec · 109 öğr |
| 2023-2024 Fall | 2.46 | 3 sec · 178 öğr |
| 2023-2024 Spring | 2.35 | 2 sec · 118 öğr |
| 2022-2023 Fall | 2.42 | 3 sec · 183 öğr |
| 2022-2023 Spring | 2.49 | 2 sec · 102 öğr |
| 2021-2022 Fall | 2.46 | 3 sec · 165 öğr |
| 2021-2022 Summer | 2.30 | 1 sec · 26 öğr |
| 2021-2022 Spring | 2.35 | 2 sec · 83 öğ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.
In order to be able to take the final exam, a student must collect at least 30% of EACH of the first three homework grades, AND collect at least 30% of the midterm grade. Otherwise, the student will receive the FZ grade.
Introduction, case study Functions Arrays Pointers Pointers Pointers Pointers Case study Recursion, Algorithm analysis Lists Lists Lists Stacks Queues ECTS - Workload Table: Activities Number Hours Workload Homework 4 8 32 Course hours 14 3 42 Midterm exam 1 3 3 Preparation for Final exam 1 25 25 Preparation for Midterm exam 1 20 20 Individual or group work 14 2 28 Final exam 1 3 3 Total Workload: 153 Total Workload / 30: 153 / 30 5.1 ECTS Credits of the Course: 5 Type of Course: Lecture Teaching Methods: Assignment - Case studies - Exercises - Lecture - Practical session