CSCI 232 - Intermediate Data Structures and Algorithms

Credit(s): 4

Prerequisite(s): CSCI 132.
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 Outcomes: Upon completion of the course, students will be able to

Explain and implement recursive algorithms.
Perform algorithmic time and space complexity analysis using Big-O notation.
Compare and implement standard sorting and searching techniques.
Design and implement data structures such as trees, balanced trees, hash tables, heaps, and graphs.
Evaluate and select optimal data structures and algorithms for a given computational problem.