Table of Contents 2336 Example Program Booklet Descriptive Files and Algorithms Foreman Page 2336 Course Calendar and Schedule 2336 General Information 2336 Course Topic Outline Departmental Policy on Academic Honesty Java Grading Guidelines for 2336 1 2 4 7 8 Program 1 Program 2 Program 3 Program 4 Program 5 Program 6 10 12 16 19 20 25 Sort letters using Stack and Deque Polynomial Arithmetic using DLLs Lattice Construction and Random Numbers Open Hashing with Static BSTs Event Driven Simulation using a Priority Queue Minimum Spanning Tree with Sets Language Primitive Data Structures Introduction to Algorithm Analysis Address Calculation Sorts Sort Summary 26 37 49 52 Hashing Algorithms (Open/Dynamic and Closed/Static) The Bin or Radix Sort Algorithm Priority Queue Tree and Graph Definitions What Is a Code? 61 66 70 72 78 Huffman Code Algorithm (Greedy) AVL trees (Height Balanced Binary Search Trees) Graph Classification and Implementation Schemes Kruskal’s Minimum Spanning tree Algorithm (Greedy) Dijkstra’s Single source Shortest Paths Graph Algorithm (Greedy) 82 84 86 91 93 All Pairs - Shortest Paths Graph Algorithm (Dynamic Programming) Optimal BST (Dynamic programming) How to Implement Sets in C++ and Java Introduction to Game Trees Practicums 1..4 95 98 103 105 112 Many other example programs can be found under my section of cs.lamar.edu. i Netbeans Example Projects (Most have a main driver. Some have I/O files) Page StackAO Postfix QueueAO PondsIslands Recursive Stack class using an array of objects An interesting example using StackAO Queue class using an array of objects Interesting example program using QueueAO Examples of Recursive Functions & exceptions 116 121 123 130 139 DllOfIntegers ArrayListDemo DllOfIntegersStatic DllComparable BstOfIntegers An Ordered Circular DLLof unique integers Shows some of the common methods Static version of the program above Ordered Circular DLL of any Comparable type Binary Search Tree of Integers 147 155 159 172 182 Utilities others included are: AtomicUtilities, Formats, IntArrayUtilities IntArraySorts 2 bubble, 3 insertion and 1 selection sort of int array IntArrayAsTree Display a tree stored in an integer array AOutilites Similar to intArrayUtilities but on arrays of objects ComparableSorts Simple sorts of any comparable type ComparableTree Builds a BST of any Comparable Type 195 199 202 204 208 SimpleSortsClient driver for IntArraySorts in Utilities Library SimpleSortsComparableClient driver for ComparableSorts in Utilities Library BstComparable Bst of Strings, but could be of anything Comparable BinarySearch.cpp Iterative and Recursive Binary Search of a Sorted Array QuickSort.cpp Simple version. A Divide & Conquer algorithm MergeSort.cpp Linked List version, another Divide and Conquer alg. HeapSort.cpp Standard version of the algorithm. Displays the tree 212 215 220 231 234 240 244 DepthFirst BreadthFirst SllGraphNode Queens DentalClinic 249 252 255 259 271 Depth First traversal of an SLL based Graph Breadth First Traversal of an SLL based Graph Node and Edge classes used by the graph traversals above Backtracking Solution to the Eight Queens Puzzle Stochastic (time) and Event Driven Simulation (partial) Data Files Int50.txt 294 ii