ECE 60800 - Computational Models and MethodsCredits: 3
Areas of Specialization(s):VLSI and Circuit Design
Normally Offered: Each Fall, Spring
Computation 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.
- Introduction to Algorithms, 3rd Edition, T. Cormen, C. Leiserson and R. Rivest, MIT Press, 2009, ISBN No. 0262033844.
Recommended Text(s): None.
|1||Time and space complexity; analysis methods|
|2.5||Models of computation Turing machine|
|2.5||Recurrence formulas, discrete mathematics|
|1.5||Search; Set Operations|
|1||Polynomial, matrix and FFT algorithms|