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.
Section 1: Tuesday at 13:00-15:50
Section 2: Tuesday at 13:00-15:50
Section 1: Wednesday at 16:00-18:00
Section 2: Wednesday at 16:00-18:00
Nebi Yilmaz · firstname.lastname@example.org
Alperen Cakir · email@example.com
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:
Grading for BBM202 will be based on
In BBM204, the grading will be based on
Attendance to lectures is mandatory. A student who do not attend the lectures more than 4 weeks will fail BBM202 directly with an F1 grade. 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.
Algorithms, 4th Edition, R. Sedgewick and K. Wayne, Addison-Wesley Professional, 2011
Course Introduction [slides],
Analysis of Algorithms [slides]
|Reading: SW 1.4|
|2||Mar 2||Elementary Sorting Algorithms [slides]
|Reading: SW 2.1, 2.2
|3||Mar 9||Quicksort [slides]
|Reading: SW 2.3, 2.4
|4||Mar 16||Hashing, Search Applications [slides]||Reading: SW 3.4, 3.5|
|5||Mar 23||Dynamic Programming [slides]||Reading:
|6||Mar 30||Greedy Programming [slides]||Reading:
|7||Apr 6||Undirected Graphs [slides]
Directed Graphs [slides]
| Reading: SW 4.1, 4.2
|8||Apr 13||Minimum Spanning Trees [slides]||Reading: SW 4.3
|9||Apr 20||Midterm Review||Midterm Exam
|10||Apr 27||Shortest Path [slides]||Reading: SW 4.4|
|11||May 4||Substring Search [slides]
Regular Expressions [slides]
|Reading: SW 5.3, 5.4
|12||May 11||String Sorting [slides]||Reading: SW 5.1
|13||May 18||Data Compression [slides]||Reading: SW 5.5|
|14||May 25||Reductions, Intractability [slides]||Reading: SW 6