CE601 Advanced Algorithms

Instructor:Assoc.Prof.Dr. Yuriy Mishchenko
Link to the courses's webpage at IEU:CE601 webpage at IEU

Course objectives

The objective of this course is to provide a comprehensive and detailed study of the design and analysis of algorithms. The course aims at discussing state of the art algorithms and related data structures that are crucial to achieve satisfactory levels of performance in industry and research since the processor speed-ups we have been enjoying are coming to an end and better algorithms are needed in order to cope with the increasing demand of data processing.

Course program

  1. The role of algorithms in computing
  2. Master theorem
  3. Probabilistic analysis, randomized algorithms
  4. Median and order statistics
  5. Red-black trees
  6. Augmenting data structures
  7. Dynamic programming
  8. Greedy algorithms
  9. Amortized analysis
  10. Some number-theoretic algorithms
  11. String matching
  12. NP-complete problems
  13. Approximation algorithms
  14. Learning algorithms, decision trees

Other information

Past take-home midterm exams questions can be found here CE601 MIDTERM 2016.

Click here to go to homepage.