CENG315 Algorithms (Fall 2017, go to here for more recent semesters.)

Instructors: Ismail Hakki Toroslu (Section 1-2), Gokberk Cinbis (Section 3)
Syllabus:  Link
Office hour:  By appointment, please email.
Textbook:  Introduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Mc Graw-Hill.

Syllabus

You can access the slides on the COW page of the course.
Week Lectures and presentations Resources
W1
Lecture:
  • Introduction, course logistics
  • Algorithms, Analysis and Design
 Chapter 1, 2.
W2-W3
Lecture:
  • Growth of Functions
  • Summations
  • Recurrences
 Chapter 3, 4.
W4-W5
Lecture:
  • Comparison-Based Sorting
  • Sorting Algorithms in Linear Time
 Chapter 7, 8.
W6
Lecture:
  • Hashing
 Chapter 11.
W7-W10
Lecture:
  • Elementary Graph Algorithms (BFS, DFS, Top. Sort, Strongly Con. Comp, etc.)
  • Minimum Spanning Trees
  • Single-Source Shortest Paths
  • All-Pairs Shortest Paths
  • Maximum Flow
Chapter 22, 23, 24, 25, 26.
W11-W12
Lecture:
  • String matching
  • Huffman codes
 Chapter 32, 16.3.
W13-W14
Lecture:
  • NP-Completeness
 Chapter 34.
We reserve the right to make changes in the course content.
License