CSC545
Download as PDF
CSC545 - Design and Analysis of Algorithms
Course Description
Time, space complexity, recurrences, algorithm design techniques, lower bounds; graph, matrix, set algorithms; sorting, fast Fourier transform, arithmetic complexity, intractable problems.
Min Units
3
Max Units
3
Repeatable for Credit
No
Grading Basis
GRD - Regular Grades A, B, C, D, E
Career
Graduate
May be convened with
Name
Lecture
Workload Hours
3
Optional Component
No
Typically Offered Main Campus
Fall