Algorithms
Download as PDF
Overview
Subject area
CSC
Catalog Number
22000
Course Title
Algorithms
Department(s)
Description
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, probabilistic, etc. Computational complexity; the classes P and NP.
Academic Career
Undergraduate
Liberal Arts
Yes
Credits
Minimum Units
3
Maximum Units
3
Academic Progress Units
3
Repeat For Credit
No
Components
Name
Lecture
Hours
3
Requisites
019276