ECE 60800: Computational Models And Methods
3 Credits
Fall 2025LectureDistance LearningComputation models and techniques for the analysis of algorithm complexity. The design and complexity analysis of recursive and non-recursive algorithms for searching, sorting, set operations, graph algorithms, matrix multiplication, polynomial evaluation and FFT calculations. NP-complete problems. Prerequisite: Master's student standing or higher.
Select an instructor to view metrics
Add instructors using the search bar above or the list on this page
No data available
No instructors selected
Select instructors to compare their GPAs.