Common Course: Data Structures
This common course, Data Structures, was created by looking at the Data Structures and Algorithms Courses of the participating two- and four-year colleges present: Eastern Washington University, Seattle University, Pacific Lutheran University, and the Western Governors University represented the four-year high education institutions. Bellevue, Cascadia Colleges, and Green River, Highline, Shoreline Community Colleges, and Bates Technical College represented the two-year high education institutions.
- File and stream I/O, exception handling
- Data structures
- array-based list
- linked list
- Algorithm Analysis
- Analyze the runtime performance of code segments using big-O notation
- Analyze the runtime performance of data structure operations using big-O notation.
- Binary Trees/Binary-search Trees
- Implement recursive and non-recursive algorithms to manipulate (construct, insert, delete, search, and traverse) binary search trees.
- Use binary search trees appropriately in solving problems.
- Demonstrate the operation of tree balancing (not necessary to implement in code).
- Hash Tables
- Describe different ways of resolving hash table collisions.
- Design and use hash tables appropriately in solving problems.
- Implement recursive and non-recursive algorithms to manipulate (construct, insert, delete, search, and traverse) heaps.
- Use heaps appropriately in solving problems.
- Describe the steps of quicksort, mergesort, heapsort algorithms.
- Compare and contrast sorting algorithms with respect to performance characteristics.
- Appropriate data structure use.
Note: To transfer this course for credit to a four-year Washington State college or university a final grade of a 2.5 (B) is required
More information about our Programs of Study for 2012-2013