Foundations of Computing

Course Description:

Computational aspects of engineering problems. Topics include machine models and computability, classification, and performance analysis of algorithms, advanced data structures, approximation algorithms, introduction to complexity theory and complexity classes.

Textbook:

T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, Second Edition, ISBN 0-262-03293-7, MIT Press, 2001.

Prerequisite:

EECE 331

Coordinator:

David A. Bader

Topics:

• Proof Techniques
• Introduction to Models of Computation
• Solution of Recurrence Relations
• Algorithmic Analysis
• Graph Algorithms
• Complexity Theory
• Approximation Algorithms