|Select the desired Level or Schedule Type to find available classes for the course.|
|CPSC 281 - Data Structures I|
Topics include: Program performance, data representation, arrays and matrices, lists, stacks and queues, skip lists and hashing, binary trees, balanced and B-trees, AVL trees, splay trees, tree traversals using stacks, expression trees, prefix, infix, and postfix expressions and conversions, priority queues and heaps, search trees, Huffman codes, graphs, graph algorithms (weighted and unweighted shortest-path, Dijkstra's algorithm, critical paths), minimum-cost spanning trees (Prim's, Kruskal's, and Solin's algorithms). Implementation of various data structures using object-oriented programming language.
Schedule Types: Lecture, Final Exam, Laboratory
CPSC 200 Minimum Grade of C-
|Return to Previous||New Search|