Analysis of Algorithms
Download as PDF
Overview
Subject area
CS
Catalog Number
312
Course Title
Analysis of Algorithms
Department(s)
Description
This course covers measuring algorithmic complexity (O-Notation); searching and sorting algorithms and their complexity; tree and graph algorithms and their complexity; classes of algorithms, such as divide-and-conquer, backtracking, greedy, probablistic, etc. Computational complexity; the classes P and NP.
Typically Offered
Fall, Spring
Academic Career
Undergraduate
Liberal Arts
No
Credits
Minimum Units
3
Maximum Units
3
Academic Progress Units
4
Repeat For Credit
No
Components
Name
Lecture
Hours
4
Requisites
019650
Course Schedule
Schedule
Expand all No Sections Found