|
Dec 04, 2024
|
|
|
|
CPSC 131 - Data Structures (3) Classical data structures: vector, linked list, stack, queue, binary search tree, and graph representations. Worst-case analysis, amortized analysis, and big-O notation. Object-oriented and recursive implementation of data structures. Self-resizing vectors and self-balancing trees. Empirical performance measurement.
Prerequisite: CPSC 121 or sufficient score on the Computer Science Placement Exam.
Undergraduate Course not available for Graduate Credit
Add to Portfolio (opens a new window)
|
|