CSCI 385 Spring 2019
Advanced Data Structures and Algorithms
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

CSCI 112
CSCI 125
Others

Admin

Course Information


Time     2-3:20 MW, 2-2:50 F
Location     VNZORN 142

Instructor     Charles Cusack
Email     cusack@hope.edu
Office     VWF 233
Phone     395-7271
Office Hours       1-2 pm Monday and Wednesday, 3-3:30 Tuesday and Friday, or by appointment

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, CUDA, etc.)
  • Quantum Algorithms
See the Schedule for a more detailed description of what we will do when.