| |
May 05, 2024
|
|
|
|
|
ARCHIVED 2014-2015 Undergraduate Catalog [ARCHIVED CATALOG]
|
CSC 340 - Algorithms3.00 credit hours
Design and analysis of algorithms. Classification of algorithms by time and space complexity. Algorithm design techniques such as divide and conquer, the greedy method and dynamic programming. NP-complete problems and approximation algorithms. Introduction to parallel algorithms. Programming may be required. Not available for credit to students who have previous credit for CSC 440.
Prerequisite(s): CSC 210 ; CSC 230 ; Junior standing or instructor consent.
Click here for the schedule of classes.
|
|
