CSCI 232 - Intermediate Data Structures and Algorithms

Credit(s): 4

Prerequisite(s): CSCI 132.
This course covers advanced data structures and programming techniques and their application. Topics include trees, balanced trees, graphs, dictionaries, hash tables, and heaps. The efficiency and correctness of algorithms are examined. Projects are coded in JAVA. (Spring Semester)

Course Learning Outcomes: Upon completion of the course, students will be able to

Explain and implement recursive algorithms.
Perform time-complexity analysis of algorithms.
Compare and implement several standard sorting techniques.
Implement basic ADTs, including vectors, lists, sorted lists, stacks, and queues.
Explain the concepts and algorithms for general trees, binary trees, binary search trees, balanced search trees, tables/dictionaries, hash tables, priority queues, heaps, and graphs.
Evaluate and select the appropriate data structure for a given problem.