This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP ...

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 ...

Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: Lists, Stacks, Queues, Hashing. Breadth-first search, Depth-first search, Prim's algorithm, ...

This is a graduate course on algorithms. We will focus on studying basic algorithms at a finer level of detail and more advanced algorithms and data structures “Concrete” Mathematics: Solving ...