CS 3112 - Analysis of Algorithms

(3)

This course is repeatable: No
Max # of units may be repeated: 0
Total # of units allowed for credit: 3
Max times this course can be taken for credit: 1

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. Lecture 2 hours, laboratory 3 hour.

Grading: ABCDF
Mode of Delivery: Face to Face
Campus: Main Campus

Prerequisite(s): CS 2013, CS 2148
Needs Permission to Enroll: No
Special Fee Applied: No

GE UD B (restricted to specific majors)
.

Quicklinks Search Form

Search form

University Catalog

CS 3112 - Analysis of Algorithms