This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for computational geometry. We will discuss how to use these techniques ...

Greedy Algorithms; Dynamic Programming Algorithms; Algorithms for the following primitives: Sorting: bubblesort, mergesort, heapsort, quicksort. Searching; Graph Algorithms: Depth/Breadth First Search ...

Introduction to programming in Java. Introduction to the theory of algorithms: running time and correctness of an algorithm. Recursion. Data structures: arrays, linked lists, stacks, queues, binary ...

Brief Description of Course Content. Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and ...

The main goal is to learn dynamic programming and how to apply it to a variety of problems. The course covers both theoretical and computational aspects. Learning Objectives. Being able to identify ...

Most beautiful algorithm: Dynamic programming (e.g., Viterbi, forward-backward, variable elimination & belief propagation algorithms). Dynamic programming is one of the most elegant algorithmic ...