CSC 345 - Advanced Algorithms and Parallel Processing

Institution:

Rocky Mountain College

Subject:

Description:

Annually. 3 semester hours. Most programming problems encountered by undergraduate computer science students are solvable using straightforward approaches. There are a number of important and challenging problems whose efficient solutions demand more sophisticated techniques. This course presents an organized study of major algorithmic strategies (Divide and Conquer, Dynamic Programming, Backtracking, Greedy, Branch and Bound) and introduces students to advanced topics including computability, fixed-point algorithms, and NP-complete problems. Algorithms for parallel processing are explored through the use of a Beowulf processor cluster as a target platform for programming exercises. Prerequisites: CSC251, CSC354, and senior standing.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

rocky.edu

Phone Number:

(406) 657-1000

Regional Accreditation:

Northwest Commission on Colleges and Universities

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.