This course studies advanced abstract data types, such as sets, maps, and graphs, and their implementation using arrays and dynamically allocated nodes in an object-oriented language. The course also studies the performance of the data structures built-in operations and related algorithms such as sorting, searching, and traversing.
Prerequisite: COMP 271 and (COMP 163 or MATH 201) and (MATH 131 or MATH 161).
Outcomes: Students learn non-linear data structures and runtime performance of their operations, solve computational problems by choosing suitable data structures, and implement algorithms within the object-oriented paradigm.
Prerequisite: COMP 271 and (COMP 163 or MATH 201) and (MATH 131 or MATH 161).
Outcomes: Students learn non-linear data structures and runtime performance of their operations, solve computational problems by choosing suitable data structures, and implement algorithms within the object-oriented paradigm.