|
| Course Information
|
| Time | 1:30-2:50 TR, 1-1:50 F | | Location | In-person: VanZoeren 142
Online: Google Meet |
| | Instructor | Charles Cusack | | Email | cusack@hope.edu | | Office | VWF 233 | | Phone | 395-7271 | | Office Hours | 2:00-2:50 MWF |
|
| Textbooks | |
| | 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. |
| | Expectations | Because of a shortened semester, we need to make up some extra "instructional hours" this semester. This will be done when mostly during the section on OpenMP. You will watch 27 video lectures about OpenMP outside of class and we will spend class time clarifying what was presented in the videos as well as working through examples, etc. In addition, you will be asked to submit answers to a series of reading questions whenever there is a reading assignment. These will be due on the day that a reading assignment is listed on the schedule (and if I don't forget, I will include the due dates of the reading questions on the schedule as an added reminder). |
|
|
|
|