CSCV445
Download as PDF
CSCV445 - Algorithms
Course Description
Introduction to the design and analysis of algorithms: basic analysis techniques (asymptotics, sums, recurrences); basic design techniques (divide and conquer, dynamic programming, greedy, amortization); acquiring an algorithm repertoire (sorting, median finding, strong components, spanning trees, shortest paths, maximum flow, string matching); and handling intractability (approximation algorithms, branch and bound).
Min Units
3
Max Units
3
Repeatable for Credit
No
Grading Basis
GRD - Regular Grades A, B, C, D, E
Career
Undergraduate
Course Attributes
WE - WEC (Writing Emphasis Course)
Enrollment Requirements
017109
Name
Lecture
Workload Hours
3
Optional Component
No
Typically Offered Main Campus
Not Offered
Typically Offered Distance Campus
Fall
Typically Offered UA Online Campus
Not Offered
Typically Offered Phoenix Campus
Not Offered
Typically Offered South Campus
Fall
Typically Offered Community Campus
Not Offered