Search Constraints

Number of results to display per page
Results for: Creator / Instructor Weerdt, Mathijs de Remove constraint Creator / Instructor: Weerdt, Mathijs de Keywords Data structures (Computer science) Remove constraint Keywords: Data structures (Computer science) Language Dutch Remove constraint Language: Dutch Polyu oer sim No Remove constraint Polyu oer sim: No Year 2016 Remove constraint Year: 2016

Search Results

  • Courseware 
    Algoritmiek

    Algoritmiek

    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.

    Subjects:
    Computing
    Keywords:
    Algorithms Data structures (Computer science)
    Resource Type:
    Courseware