| |
Dec 22, 2025
|
|
|
|
|
CS 3112 - Analysis of Algorithms [3]
This course is repeatable: No
Total # of units allowed for credit: 3
Max times this course can be taken for credit: 1
Max # of units may be repeated: 0
Course Description: Methods for the design and analysis of correct and efficient computer algorithms; applications to classical problems of searching, sorting, graph optimization and combinatorial optimization.
Credit Hours Per Week: 3 lecture hour(s) 3 laboratory hour(s)
Grading: ABCDF
Mode of Delivery: Face to Face
Campus: Main Campus
Cross-Listing and/or Equivalent Course(s): None
Prerequisite(s): CS 2013 and CS 2148 , all graded C or better
Needs Permission to Enroll: No
GE until Summer 2025: UD Block B - Natural Science and Quantitative Reasoning*
GE effective Fall 2025: Area 2 or 5 - UD Mathematical Concepts & Quantitative Reasoning or Physical & Biological Sciences
* GE designation is restricted to specific major
.
Add to Portfolio (opens a new window)
|
|
