July 31, 2010, Saturday, 211

CS 4102

From Rodman Scholars Program

Jump to: navigation, search
Algorithms
Credits: 3
Semesters Offered: Fall
Cross-Listed As: None
Prerequisites: CS 2102, CS 2150
Corequisites: None

This finishes off the undergraduate theory sequence with a very widespread and useful application.

[edit] Description

From the Undergraduate Record:

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.


[edit] See Also

[edit] External Links

Computer Science Courses
CS 1010 - CS 1110 - CS 1111 - CS 1112 - CS 1120 - CS 2102 - CS 2110 - CS 2150 - CS 2190 - CS 2220 - CS 2330 - CS 3102 - CS 3205 - CS 3240 - CS 3330 - CS 4102 - CS 4240 - CS 4330 - CS 4414 - CS 4444 - CS 4457 - CS 4458 - CS 4610 - CS 4620 - CS 4630 - CS 4710 - CS 4750 - CS 4753 - CS 4810
Retrieved from "http://www.rodmanscholars.org/index.php/CS_4102"