Prof. Burt Rosenberg              Mth220/317-971
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.

Algorithms
There are two goals for this course: algorithms and programming. There will be two course texts, reflecting the dual nature of the course. 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 technologies are advancing rapidly. Last semester, my Math 120 students learned C++. This semester, the language of choice is Java. The text Exploring Java by Patrick Niemeyer and Joshua Peck will introduce both the Java language and the conceptual framework of objects in a desktop world, including:

• Classes and Objects
• Window Environments: Painting, Events and Widgets
• Threads
• Synchronization
• Network programming