Detailed Course Information |
Fall 2019
Apr 19, 2024 |
|
 |
||
 | Select the desired Level or Schedule Type to find available classes for the course. |
| CSCI 0302 - Algorithms and Complexity |
|
*Algorithms and Complexity*
This course focuses on the development of correct and efficient algorithmic solutions to computational problems, and on the underlying data structures to support these algorithms. Topics include computational complexity, analysis of algorithms, proof of algorithm correctness, advanced data structures such as balanced search trees, and also important algorithmic techniques including greedy and dynamic programming. The course complements the treatment of NP-completeness in CSCI 0301. (CSCI 0200 and CSCI 0201) 3 hrs. lect./disc.
0.000 OR 1.000 Credit hours 0.000 OR 1.000 Lecture hours 0.000 TO 2.000 Other hours Levels: Undergraduate Schedule Types: Lab, Lecture Natural Sciences Division Computer Science Department Course Attributes: DED Restrictions: Must be enrolled in one of the following Colleges: Undergraduate Must be enrolled in one of the following Majors: Computer Science Prerequisites: Undergraduate level CSCI 0200 Minimum Grade of D and Undergraduate level CSCI 0201 Minimum Grade of D |
| Return to Previous | New Search |
|