2021-2022 Graduate Catalogue Archived Catalogue
|
CSC 533 - Design and Analysis of Algorithms II
Course Description: Theory of the design of efficient computer algorithms. Amortized analysis, sorting networks, matrix operations. Polynomials and FFT, number-theoretic algorithms, and computational geometry.
Credit Hours: 3
Corequisite Courses: None
Prerequisite Courses: CSC 532 with minimum grade of C
Additional Restrictions/ Requirements: None
Course Repeatability: Course may not be repeated
ADDITIONAL COURSE INFORMATION
Equivalent Courses: None
Undergraduate Crosslisting: None
Additional Course Fees: None
Course Attribute: None
Click here for the Fall 2024 Class Schedule.
|
