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: 3 lecture hour(s) 3 laboratory hour(s) per week

Grading: ABCDF
Mode of Delivery: Face to Face
Campus: Main Campus
Prerequisite(s): CS 2013 and CS 2148, all graded C or better
Needs Permission to Enroll: No
Special Fee Applied: No

GE UD B* -* restricted to specific major
.

Print this Page

Quicklinks Search Form

Search form

University Catalog

CS 3112 - Analysis of Algorithms