CPSC 281-3
Data Structures I
I taught this course for the first time
in Winter 2015.
[2009-07-30]: The calendar says:
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, Hoffman
codes, graphs, graph algorithms, (weighted and unweighted
shortest-path, Dijkstra’s algorithm, critical paths), minimum-cost
spanning trees (Prim’s, Kruskal’s, and Sollin’s
algorithms). Implementation of various data structures using object-
oriented programming language.
…which only goes to show that the calendar is out of date.
Links
- Outlines
-
- Pages
-
- I didn't teach CPSC 281 until Winter 2015.
- 2015
CPSC 281