CSCI 356
Advanced Algorithms
Fall 2016
Division III
Quantitative/Formal Reasoning
This is not the current course catalog
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
Limit: 10
Expected: 10
Class#: 1659
Grading: no pass/fail option, no fifth course option
Limit: 10
Expected: 10
Class#: 1659
Grading: no pass/fail option, no fifth course option
Requirements/Evaluation:
evaluation is based on weekly problem sets, several small programming projects, weekly paper summaries, and a small, final project
Extra Info:
may not be taken on a pass/fail basis; not available for the fifth course option
Prerequisites:
CSCI 256; CSCI 361 is recommended but not required
Enrollment Preferences:
current or expected Computer Science majors
Distributions:
Division III
Quantitative/Formal Reasoning
Class Grid
-
HEADERS
Column header 1
CLASSESColumn header 2DREQColumn header 3INSTRUCTORSColumn header 4TIMESColumn header 5CLASS#
-
CSCI 356 - T1 (F) TUT Advanced Algorithms
CSCI 356 - T1 (F) TUT Advanced AlgorithmsDivision III Quantitative/Formal ReasoningCancelled1659
Megamenu Social