Marcin Sydow - Selected Topics in Algorithms - Course Web Page
Studies: Graduate, Computer Science, Polish-Japanese Institute of Information Technology, fall 2010
Lectures: 8 (double lectures) --- Passing: Colloquium + Entry Tests --- Exam: Written/Oral
Textbooks:
- (KT) J.Kleinberg, E.Tardos "Algorithm Design", Pearson/Addison Wesley, 2006
- (CLRS) T.Cormen et al. "Introduction to Algorithms", 3rd edition, MIT Press, 2009
Slides:
In addition to some slides provided below, there are slides publicly available in the Web that (are recommended and) acompany the (KT) textbook.
Lectures:
- "Correctness and Complexity of Algorithms" - basic definitions
- "Divide and Conquer" - recursion, reminder of basic searching and sorting algorithms, methods for solving recursive equations
- "Divide and Conquer (cont.)" (examples from ch. 5 of (KT)) + "Graphs" (reminder of basic concepts, ch. 3 of (KT))
- "Greedy Algorithms" (based on chapter 4 of (KT)) + Priority Queues (implemented with binary heap)
- "Dynamic Programming" (based on chapter 6 of (KT)) + Binomial Heaps
- "Maximum Flow" (based on chapter 7 of (KT), sections 7.1 and 7.2) + Dictionaries (hashtables, bst and avl) and Huffman Coding
back to: Marcin Sydow - home page
Last updated: 10.01.2011