CMSI 282 - Data Structures and Algorithms II

Institution:

Loyola Marymount University

Subject:

Description:

3 Semester Hours Algorithm paradigms, with an emphasis on combinatorial search. Topics include: generating combinatorial objects; greedy methods; dynamic programming; randomized algorithms; modern heuristics such as genetic programs and simulated annealing; advanced sorts and order statistics; cake-cutting and fair division; graph algorithms; computational geometry. Lecture, 3 hours. Prerequisite: CMSI 281.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.lmu.edu

Phone Number:

(310) 338-2700

Regional Accreditation:

Western Association of Schools and Colleges

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.