MSCS 502L - Advanced Data Structures

4 Credits

Linear and non-linear data structures will be discussed and implemented including dynamic lists, linked lists, stacks, queues, trees, heaps, and hashing. Complexity will be considered and efficient structures will be covered including balanced binary search trees and priority queues. Advanced Java topics will be covered including abstract classes, interfaces, and iterators. Students will be expected to construct and/or use generic data structure classes.