- Schedule of Classes - June 2, 2019 7:14PM EDT
- Course Catalog - June 2, 2019 7:15PM EDT
Course information provided by the Courses of Study 2018-2019.
Seminar will focus on advanced algorithms and their implementations related to programming contests. Course will emphasize on problem-solving skills so students learn how those algorithms can be applied to solve abstract programming contest/technical interview problems. Every week the seminar will feature a presentation by either a faculty member or a student on related topics. Potential topics include: advanced data structures (i.e. union-find set, segment tree), advanced graph algorithms (i.e. connectivity algorithms), applied number theory and combinatorics, dynamic programming algorithms, stringology (i.e. Knuth–Morris–Pratt algorithm, suffix tree), computational geometry (i.e. convex hull, half-plane intersection), constructive algorithms, and exponential algorithms.
When Offered Fall, Spring.
Prerequisites/Corequisites Prerequisite: CS 2110.
Regular Academic Session.
Credits and Grading Basis
1 Credit Sat/Unsat(Satisfactory/Unsatisfactory)
Class Number & Section Details
- T Phillips Hall 213
Van Renesse, R
Disabled for this roster.