CSCI 356 Spring 2015 Advanced Algorithms (Q)

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.
Class Format: tutorial
Requirements/Evaluation: evaluation is based on weekly problem sets, several small programming projects, weekly paper summaries, and a small, final project
Additional Info: may not be taken on a pass/fail basis
Additional Info2:
Prerequisites: CSCI 256; CSCI 361 is recommended but not required
Enrollment Preference: current or expected Computer Science majors
Department Notes:
Material and Lab Fees:
Distribution Notes:
Divisional Attributes: Division III,Quantitative and Formal Reasoning
Other Attributes:
Enrollment Limit: 10
Expected Enrollment: 10
Class Number: 3403
CLASSES ATTR INSTRUCTORS TIMES CLASS NUMBER ENRL CONSENT
CSCI 356 - T1 (S) TUT Advanced Algorithms (Q) Division 3: Science and MathematicsQuantitative and Formal Reasoning William J. Lenhart
TBA 3403
Course Search
Term:
Subject:
Catalog Number:
Division:
Distribution:
Subject Attributes:
Enrollment Limit:
Course Type:
Start Time: End Time:
Day(s):
Instructor First Name:
Instructor Last Name:
Keyword Search: