CSCI 2270
Computer Science 2:
Data Structures
Fall 2003
Karl Winklmann
Fall 2003
| Program | Description |
|
| |
| MovingObjects | Sample solution for Assignment 1. |
| MovingObjects3D | Sample solution for Assignment 2. |
| Lists | Basics of linked lists. |
| CatalogBrowser | Sample data file only for Assignment 3. No sample solution provided. |
| DirectoryTrees | Sample solution for Assignment 4. |
| rBinSearchTrees | Demo of randomized binary search trees, showing how to use randomization and tree “rotations” to create pretty well balanced trees without spenind too much time. |
| StackTemplate | Basics of templates. |
| PolynomialsWithMenu | Demo of parse trees and recursion to differentiate and draw parse trees of polynomials. |
| LineIntersection | Computing whether or not two straight line segments have points in common. Useful for Assignment 5, depending on how one goes about it. |
| 3Coloring | Sample solution for Assignment 5. |
| Radix_Sort | Sorting integers in linear time. |
| Integers | Demo of binary integers, including shift and maskign operations. |
| APlus | Java classes for some demos used in class such as using breadth-first search for shortest path computation, tree layouts. Work in progress, lousy user interface. |
| RandomNumbers | A toy random number generator, illustrating the idea of “linear congruence&rdquo generators. |
| © 2003 Karl Winklmann | 3:08 PM, Tuesday, December 16, 2003 |