Algorithm Design and Analysis
Download as PDF
Overview
Subject area
CS
Catalog Number
351
Course Title
Algorithm Design and Analysis
Department(s)
Description
Fundamental principles of algorithm design and analysis. Topics include divide-and-conquer methods, backtracking, graph algorithms, practical data structures, randomized algorithms, greedy algorithms, recursive algorithms and dynamic programming. Asymptotic performance of algorithms will be used to identify the differences among best, average, and worst case behaviors. Algorithm analysis will be used to design and implement practical solutions using a high level programming language. Empirical measurement of performance of the solution will be compared with theoretical analysis. This course requires completion of several programming assignments and projects.
Typically Offered
Fall, Spring
Academic Career
Undergraduate
Liberal Arts
Yes
Credits
Minimum Units
4
Maximum Units
4
Academic Progress Units
4
Repeat For Credit
No
Components
Name
Lecture
Hours
4
Requisites
024916