Algoritmiek

About this course

This course treats various methods to design and analyze datastructures and algorithms for a wide range of problems. The most important new datastructure treated is the graph, and the general methods introduced are: greedy algorithms, divide and conquer, dynamic programming and network flow algorithms.

Description from TU Delft OpenCourseWare.

Where to take this course

• TU Delft OpenCourseWare · Archived course

  Course materialsFreeAssignments, Video, Slides, Exams, Readings~125 hours
  Open TU Delft OpenCourseWare (new tab)

Related courses

• A Gentle Introduction to Programming Using PythonMassachusetts Institute of Technology · English
• Advanced AlgorithmsMassachusetts Institute of Technology · English
• Algorithmic Aspects of Machine LearningMassachusetts Institute of Technology · English
• Algorithms for Computational BiologyMassachusetts Institute of Technology · English