Go to Main Content

UNBC Direct Access Web

 

HELP | EXIT

Catalog Entries

 

2019 September Semester
Jul 16, 2019
Transparent Image
Information Select the Course Number to get further detail on the course. Select the desired 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


Return to Previous New Search XML Extract
Transparent Image
Skip to top of page
Release: 8.7.2