Algoritmiek
Remix and Share
- Author:
- M. de Weerdt
- Subject:
- Science and Technology
- Institution Name:
- Delft University of Technology
- Collection:
- Delft University OpenCourseWare
- Grade Level:
- Post-secondary
- Abstract:
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. These general methods are explained by a number of concrete examples, such as simple scheduling algorithms, Dijkstra, Ford-Fulkerson, minimum spanning tree, closest-pair-of-points, knapsack, and Bellman-Ford. Throughout this course there is significant attention to proving the correctness of the discussed algorithms. All material for this course is in English. The recorded lectures, however, are in Dutch.
- Languages:
- English
- Material Type:
- Homework and Assignments, Lecture Notes, Readings, Teaching and Learning Strategies, Video Lectures
- Media Format:
- Downloadable docs, Video
- Conditions of Use:
- Creative Commons Attribution-Noncommercial-Share Alike 3.0
- Copyright Holder:
- Delft University of Technology
Comments