Data Structures II
This course explores advanced abstract data types in depth, such as sets, maps, and graphs, and reproduces their implementation using arrays and dynamically allocated nodes in an object-oriented language. The course also analyzes the performance of the data structures' built-in operations and related algorithms such as sorting, searching, and traversing.
Prerequisite: COMP 400B and COMP 400D.
Outcomes: Students describe non-linear data structures and analyze the runtime performance of their operations, solve computational problems by synthesizing and integrating suitable data structures, and implement algorithms within the object-oriented paradigm.
Prerequisite: COMP 400B and COMP 400D.
Outcomes: Students describe non-linear data structures and analyze the runtime performance of their operations, solve computational problems by synthesizing and integrating suitable data structures, and implement algorithms within the object-oriented paradigm.