CS 201 is where you stop thinking about C++ as a language and start thinking about how the choice of data structure determines whether your program runs in seconds or hours — it's the first real exposure to algorithmic thinking, built around time and space trade-offs. You'll spend the semester implementing lists, stacks, and queues from scratch in C++ (wrestling with pointers and dynamic memory along the way), analyzing their complexity, and turning in four programming homeworks plus a written midterm and final. Everything downstream — CS 202, algorithms, systems courses — assumes you came out of here fluent in pointers, recursion, and Big-O reasoning, so this is the gate course that actually separates "can code" from "can engineer software."
→ STARS müfredatı (resmi syllabus)
İlk dosyayı sen atarsan — not, slayt, geçmiş sınav, çözüm, cheat-sheet, ne varsa — defter ekibi öğrenci paylaşımlarından bu dersin notlarını yazar. Drive linki / PDF / ZIP, hepsi olur.
| 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.