Algorithms

Instructor
Nathan Brunelle
Course #
CS 4102
Credits
3
Online Course?
No
Engineering Course
Section
1
Days of the Week
MTWRF
Session
Session II
Course Dates
June 21 to July 16
Course Times
10:30 am to 12:45 pm

Introduces the analysis of algorithms and the effects of data structures on them. Algorithms selected from areas such as sorting, searching, shortest paths, greedy algorithms, backtracking, divide-and-conquer, and dynamic programming. Data structures include heaps and search, splay, and spanning trees. Analysis techniques include asymtotic worst case, expected time, amortized analysis, and reductions between problems. Prerequisite: CS 2102 and 2150 with grades of C- or higher, and APMA 1090 or MATH 1210 or MATH 1310.