CENG315 Algorithms (Fall 2019)

Instructors: Gokberk Cinbis (Section 1), Ismail Hakki Toroslu (Section 2-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.

Weekly schedule

You can access the slides on the CENGClass page of the course.
Week Lectures Required readings
Lecture:
  • Introduction, course logistics
  • Algorithms, Analysis and Design
 Chapter 1, 2.
Lecture:
  • Growth of Functions
  • Summations
  • Recurrences
 Chapter 3, 4.
Lecture:
  • Asymp. complexity, continued.
Lecture:
  • Comparison-Based Sorting
  • Sorting Algorithms in Linear Time
 Chapter 7, 8.
Sorting Algorithms
Lecture:
  • Sorting, continued.
Lecture:
  • Dynamic Programming
 Chapter 15.
Lecture:
  • Elementary Graph Algorithms (Graph Representations, BFS, DFS)
 Chapter 22.
Lecture:
  • Elementary Graph Algorithms Cont. (Topological Sort, Strongly Connected Comp)
Lecture:
  • Minimum Spanning Trees
Chapter 23.
Lecture:
  • Single-Source Shortest Paths
 Chapter 24, 25.
Lecture:
  • All-Pairs Shortest Paths
 Chapter 26.
Lecture:
  • Network Flow
  • String matching
 Chapter 32.
Lecture:
  • Huffman codes
  • NP-Completeness
 Chapter 16.3, 34.
Lecture:
  • NP-Completeness, continued

   We reserve the right to make changes in the course content.
License