|
|
|
Apr 18, 2024
|
|
2016-2017 Undergraduate Catalog [ARCHIVED CATALOG]
|
COM 300 - Advanced Algorithms
This course will present advanced algorithms and problem solving techniques. Topics included will be advanced application of recursion, greedy algorithms, backtracking, dynamic programming, graph connectivity algorithms, computational geometry in three-space, and parsing. The algorithms will be applied to the solution of classic problems in computer science such as the Knight’s Tour, Queens Eight, Soduko puzzles, Shortest Path, Transitive Closure, and the reduction of high computational complexity algorithms.
Prerequisite: Departmental approval.
1 semester 1 credit.
Fall, Spring. Offered when there is a sufficient student demand.
Course is repeatable, not repeatable in the same academic year.
|
|
|