CSCI 356
Advanced Algorithms
Last Offered Fall 2019
Division III Quantative/Formal Reasoning
This course is not offered in the current catalog or this is a previous listing for a current course.

Class Details

This course explores advanced concepts in algorithm design, algorithm analysis and data structures. Areas of focus will include algorithmic complexity, randomized and approximation algorithms, geometric algorithms, and advanced data structures. Topics will include combinatorial algorithms for packing, and covering problems, algorithms for proximity and visibility problems , linear programming algorithms, approximation schemes, hardness of approximation, search, and hashing.
The Class: Format: tutorial; this class will follow the meeting structure of a tutorial, with groups of three or four
Limit: 10
Expected: 10
Class#: 1657
Grading: no pass/fail option, no fifth course option
Requirements/Evaluation: weekly problem sets, several small programming projects, weekly paper summaries, and a small, final project
Prerequisites: CSCI 256; CSCI 361 is recommended but not required
Enrollment Preferences: current or expected Computer Science majors
Distributions: Division III Quantative/Formal Reasoning
QFR Notes: This class has regular and substantial problem sets in which quantitative/formal reasoning skills are practiced and evaluated.

Class Grid

Updated 3:31 pm

Course Catalog Search

(searches Title and Course Description only)



Start Time
End Time