CPSC 281 — Data Structures I — Winter 2015

course outline (printable pdf version).

Topics

from (not necessarily in the order listed)
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.

More generally, a student who successfully completes CPSC 281 will be able to select appropriate data structures from standard libraries and/or implement specific-purpose data structures as part of their general programming skills.

General

• Assignments are late if they are not received at the beginning of the lecture at which they are due. See the late policy for further information.
• There will be between 4 and 8 programming assignments, the assignments being given out approximately bi-weekly.
• Discussion of assignment topic is encouraged but all assignments must be done independently. Copied assignments are considered as “Academic Dishonesty.” Responses to academic dishonesty include assigning a mark of -100% and written notification of the Dean. Again, see the policies link for more details and other policies.