CSCI 385 Fall 2015
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     1:30-2:50 (TR) and 1:00-1:50 (F)
Location     VNZORN 142 (TR) and VZORN 151 (F)

Instructor     Charles Cusack
Email     cusack@hope.edu
Office     VWF 233
Phone     395-7271
Office Hours       by appointment

Textbooks
  • Foundations of Algorithms, fifth edition (FA), Richard E. Neapolitan, Jones & Bartlett Learning, 2015
  • Nine Algorithms That Changed the Future (NATCF), John MacCormick, Princton University Press, 2013
  • A Sophomoric Introduction to Shared-Memory Parallelism and Concurrency (SIPC)
  • Brickficiency Algorithm Assignment

  • Topics This course presents some of the most important algorithms and algorithmic paradigms in use. Specific topics include:
    • A review of the basics of algorithm analysis including asymptotic notation, complexity classes, analyzing recursive algorithms, including creating and solving recurrence relations.
    • 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
      • Backtracking
      • Branch-and-Bound
      • Space-Time Tradeoffs
      • Approximation Algorithms
      • Distributed/Parallel Algorithms
      • Algorithms for Data Mining
      • Genetic Algorithms/Genetic Programming
    See the Schedule for a more detailed description of what we will do when.