CS 245: Data Structures and Algorithms with Java

Upon successful completion of the course, students should be able to demonstrate the following knowledge or skills:

1. Apply data abstraction techniques to implement a variety of fundamental data structures.
2. Utilize unit testing features to test methods and reduce bugs and regression errors.
3. Analyze the time and space performance of algorithms using big O notation.
4. Construct and use sequential data structures, including lists, stacks, queues, deques, and sets.
5. Differentiate between array based and linked list-based implementations of sequential data structures.
6. Utilize generic programming when building data structures.
7. Utilize common interfaces such as Collection, List, Iterator, and Comparable.
8. Use common data structures from the Java Collections library.
9. Implement algorithms to define (construct, insert, delete, search, and traverse) binary search trees.
10. Analyze a scenario, select/design the appropriate data structure(s) to apply, and implement an efficient solution to solve the problem.