Go to Main Content

UNBC Direct Access Web

 

HELP | EXIT

Detailed Course Information

 

2022 September Semester
Jul 05, 2022
Transparent Image
Information 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.
Credits: 3.000

Levels: Undergraduate
Schedule Types: Lecture, Final Exam, Laboratory


Information

Green prerequisites must be completed before registering in this course

Red prerequisites can be taken concurrently with this course

Magenta co-requisites must be taken at the same time as this course

Prerequisites:
CPSC 200 Minimum Grade of C-

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.2.4