Brief review of computer representation and manipulation of
mathematical structures. Introduction to models of computations,
basic programming techniques for efficiency (recursion, balancing
back-tracking, etc. ), complexity theory, estimation and measurement
of efficiency of algorithms, and proving algorithms optimal.
Prereq:
Comp
2123
, Math
1023
,
2433
, each with C- or better