Prof. Burt Rosenberg              Mth220/317-981
Ungar 523                         Section S: TR 3:05-4:20
burt@cs.miami.edu                 MM 306
                                  3 credits, lab, no W credit

This is a second course in computer programming with emphasis on the major algorithms and data structures encountered in practice.

Note: Class is held in the Indy Lab, Ungar 423, on every Tuesday. On Thursdays we are in Memorial 306.

Algorithms
There are three goals for this course: algorithms, data structures and programming. We will study algorithms from Algorithms in C++ by Robert Sedgewick. A summary of this portion of the course follows:

• the tree data structure
• sorting and searching
• fundamentals of algorithm analysis
• self-balancing trees
• hashing
• string and pattern matching
• elementary cryptography and number theory
• algorithms for mathematical and science

Programming
Programming exercises will be in C++. Students will have Card-Key access to SGI Indy Workstations in Ungar room 426. Students should have some familiarity with C, Pascal or Java.