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 13:00-15:50@D8
Section 2: Wednesday at 13:00-15:50@D9
Section 3: Wednesday at 13:00-15:50@D10


Wednesday at 16:00-18:00@Zoom



Erkut Erdem (Section 1) ·
Adnan Ozsoy (Section 2) ·
Suat Ozdemir (Section 3) ·

Teaching Assistants


Alperen Cakin ·

Selma Dilek ·

Student Assistants


Desmin Alpaslan ·

Kaan Tuncer ·

Vedat Baday ·


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 who do not submit more than 2 assignments will fail BBM204 directly 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

  • Algorithms, 4th Edition, R. Sedgewick and K. Wayne, Addison-Wesley Professional, 2011

  • Algorithm Design, Jon Kleinberg and Eva Tardos, Addison-Wesley Professional, 2005

Schedule (Tentative)

Week Date Topic Notes
1 Feb 9 Course Introduction [slides],
Undecidability [slides],
Analysis of Algorithms [slides]
Reading: SW 1.4
Reading: Turing Machines, Universality, Halting Problem
2 Feb 16 Elementary Sorting Algorithms [slides]
Mergesort [slides]
Reading: SW 2.1, 2.2
3 Feb 23 Quicksort [slides]
Reading: SW 2.3, 2.4
PA1 out
4 Mar 2 Hashing, Search Applications [slides] Reading: SW 3.4, 3.5
5 Mar 9 Dynamic Programming [slides] Reading: KT 6.1-6.7
PA1 due
6 Mar 16 Greedy Programming [slides] Reading: KT 4.1-4.3
PA2 out
7 Mar 23 Undirected Graphs [slides]
Directed Graphs [slides]
Reading: SW 4.1, 4.2
8 Mar 30 Minimum Spanning Trees [slides] Reading: SW 4.3
PA2 due
9 Apr 6 Midterm Review Midterm Exam
PA3 out
10 Apr 13 Shortest Path [slides] Reading: SW 4.4
11 Apr 20 Substring Search [slides]
Regular Expressions [slides]
Reading: SW 5.3, 5.4
PA3 due
12 Apr 27 String Sorting [slides] Reading: SW 5.1
PA4 out
13 May 4 Data Compression [slides] Reading: SW 5.5
14 May 11 Reductions, Intractability [slides] Reading: SW 6
PA4 due

Previous editions