CSCI232 — Intermediate Data Structures and Algorithms
This course provides an in-depth study of advanced data structures and algorithms with an emphasis on analysis, design, and implementation in Java. Topics include trees, balanced trees, graphs, hash tables, heaps, dictionaries, and related abstract data types (ADTs). Students evaluate algorithm efficiency using Big-O notation and explore recursion, searching, sorting, and graph algorithms. Emphasis is placed on selecting appropriate data structures for given problems, analyzing performance trade-offs, and developing efficient, maintainable code using object-oriented programming practices. (Spring Semester) Course Learning
Prerequisites: CSCI132