|
| Course Information
|
| Time | 1:30-2:50 TR, 1-1:50 F | | Location | VanZoeren 142
|
| | Instructor | Charles Cusack | | Email | cusack@hope.edu | | Office | VWF 217B | | Phone | 395-7271 | | Office Hours | 4-5pm MW, 3-4pm F |
|
| Textbooks | |
| | Resources | |
| | 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.
|
|
|
|
|