COSC40403

Download as PDF

Analysis of Algorithms

Computer Science Undergraduate SE - Collg of Science & Engineering

Department(s)

Computer Science

Long Description (Catalog Description)

Prerequisite: COSC 20803, Corequisite MATH 30123; all with C- or better, and a knowledge of probability and statistics. This course covers basic approaches for designing and analyzing for a variety of problems. Algorithm design techniques such as divide-and-conquer, greedy, dynamic programming will be covered. Other topics
include worst, best, and average case analysis, graph algorithms, string matching, and complexity.

Course Typically Offered

Contact Department For Details

Career

Undergraduate

Min Units

3

Max Units

3

Repeat for Credit

No

Number Of Repeats

1

Code

LEC

Name

Lecture