Course Information


The subject matter of this course concerns fundamental algorithms in computer science. The course is structured around key topics including analysis of algorithms, sorting, searching, graph algorithms, string processing, dynamic programming, combinatorial search and NP-completeness.

The goal of this course is to teach students how to develop algorithms in order to solve the complex problems in the most efficient way. The students are expected to develop a foundational understanding and knowledge of key concepts that underlies important algorithms in use on computers today. The students will also be expected to gain hand-on experience via a set of programming assignments supplied in the complementary BBM 204 Software Practicum.

Time and Location


Section 1: Wednesday at 12:40-15:30@D8
Section 2: Wednesday at 12:40-15:30@D9
Section 3: Wednesday at 12:40-15:30@D10


Friday at 16:40-18:30@D1-D2



Adnan Ozsoy (Section 1) ·
Erkut Erdem (Section 2) ·
Hacer Yalim Keles (Section 3) ·

Teaching Assistants


Alperen Cakin ·

Selma Dilek ·

Student Assistants


Emirhan Yalcin ·

Mehmet Berat Ersari ·

Sura Nur Erturkmen ·


The course webpage will be updated regularly throughout the semester with lecture notes, programming and reading assignments and important deadlines. All other course related communications will be carried out through Piazza. Please enroll it by following the link:

Course Requirements and Grading

Grading for BBM202 will be based on

In BBM204, the grading will be based on


A student must submit at least three (3) non-zero assignments not to fail from BBM204 with an F1 grade. You are responsible for all material presented in lectures. Some of the course material might not be covered in the textbook.

All work on assignments must be done individually unless stated otherwise. You are encouraged to discuss with your classmates about the given assignments, but these discussions should be carried out in an abstract way. That is, discussions related to a particular solution to a specific problem (either in actual code or in the pseudocode) will not be tolerated.

In short, turning in someone else’s work, in whole or in part, as your own will be considered as a violation of academic integrity. Please note that the former condition also holds for the material found on the web as everything on the web has been written by someone else.

Text Books

Schedule (Tentative)

Week Date Topic Notes
1 Feb 21 Course Introduction, Undecidability, Analysis of Algorithms Reading: SW 1.4
Reading: Turing Machines, Universality, Halting Problem
2 Feb 28 Elementary Sorting Algorithms,

Reading: SW 2.1, 2.2
3 Mar 6 Quicksort, Heapsort Reading: SW 2.3, 2.4
PA1 out
4 Mar 13 Dynamic Programming Reading: KT 6.1-6.7
5 Mar 20 Greedy Programming Reading: KT 4.1-4.3
PA1 due
6 Mar 27 Undirected Graphs, Directed Graphs Reading: SW 4.1, 4.2
7 Apr 3 Minimum Spanning Trees Reading: SW 4.3
PA2 out
8 Apr 10 No class - national holiday
9 Apr 17 Shortest Path Reading: SW 4.4
PA2 due, PA3 out
10 Apr 24 Midterm Exam
11 May 1 No class - national holiday PA3 due, PA4 out
12 May 8 Substring Search, Regular Expressions Reading: SW 5.3, 5.4
13 May 15 String Sorting Reading: SW 5.1
PA4 due
14 May 22 Data Compression Reading: SW 5.5

Previous editions