Csc 220-E: Computer Programming II
Prof. B. Rosenberg
burt@cs.miami.edu
Summer Semester, 2004 (043)
MTWRF 2:50-4:15,
MWF 2:45-5:50
Ungar 426
Textbook
Lectures
- Review of programming
- Loop Invariants
- Assertions, Preconditions, Postconditions
- Data Structure Invariants
- Test suites
- Review of Java.
- Short overview of I/O
- Useful classes
- Graphical user interfaces
- Linked Lists
- Trees
- Data Structure Invariants for Search Trees.
- Insert, traversal (pre, in, post-order), deletion
- TreeOne
- TreeTwo
- TreeThree
- Self-Balancing Trees
- Priority Queues and Heaps
- Sorting
- Selection Sort and O(n2)
- Merge Sort and O(n log n)
- Insertion Sort and Heap Sort
- Quick lesson in Sockets.
- Hashing
- Hash functions, hash codes, collisions.
- Open chaining
- Linear
probing, double hashing
- Deletion
in hash tables, dynamic resize of hash tables
- Text Issues
- Review for final exam
Homeworks
- Homework 0:
Review of Java,
- Project to capitalize some characters in a string
- Project to do a transposition cipher
- Project to do a simple graphics/GUI
- Homework 1:
TurtleOneStep:
Introduces GUI's
- Homework 2:
Space Wars:
More work with GUI's; introduces threads
- Homework 2-EC:
Koch snowflake:
Even more work with GUI's; review recursion
- Homework 3:
Tree
project:
Perfection in our work with GUI's; programming the tree data structure.
- Homework 4:
Remote file copy:
Exercise in sockets.
- Homework 5: Network Mancala.
Resources
All materials on this and subordinate pages are
(c) 2004 Burton Rosenberg. All rights reserved.