The course covers data structures and associated algorithms. Relationships among data structures, their utility in various situations, and factorsaffecting their performance in algorithms will be considered. You will learn to analyze the demands of algorithms, how to choose appropriate data structures, and how to integrate data structures into algorithms.
| Project | Description |
| Priority Based Service Queue (C++) | The main class is an adapter class for a LinkedList implementation to simulate a priority based service queue. The project description can be found here. |
| Weight Balancing Binary Search Trees (C++) | This is a Binary Search Tree implementation that creates a weight balanced BST. The weight being the number nodes contained in each left and right subtree. The project description can be found here. |
| Quadratic Probing Hashtable versus Binary Search Tree (C++) | This is a performance comparison for hashtables using quadratic probing and binary search trees. Although far from a benchmark, this code could be used to make generalized statements with regards to building the structures, find, and insert operations. The project description can be found here. |
| Interval Heap Implementation (C++) | Actually it’s simple, implement a heap data structure to optimize certain operations. These operations are findMin and findMax which will need to be done in O(1). Other operations can be performed in O(n). The project description can be found here. |
| An index of all cs341 files can be found here. | |
