Course Information


Textbooks	(IDAA) Introduction to the Design and Analysis of Algorithms, 3rd edition, Anany Levitin, Pearson, 2012. A Sophomoric Introduction to Shared-Memory Parallelism and Concurrency (SIPC)

Resources	Hints in the back of the book IDAA has hints for the exercises in the back of the book. Reading Questions Solutions Here are Solutions to the Reading Questions from IDAA. You should verify your answers before class.

Description	See the Catalog description

Topics	This course presents some of the most important algorithms and algorithmic paradigms in use. Specific topics include things like: A review of algorithmic techniques from 255 such as brute force, divide-and-conquer, decrease-and-conquer, transform-and-conquer, dynamic programming, and greedy techniques. Introduction to advanced algorithmic techniques such as Approximation Algorithms and Linear Programming Distributed/Parallel Algorithms (OpenMP, Java threads, etc.) Quantum Algorithms (maybe) See the Schedule for a more detailed description of what we will do when.