CPSC 2150: Algorithms and Data Structures II

« Back to Course Listing

Course Format Lecture 4.0 h + Seminar 0.0 h + Lab. 2.0 h
Credits 3.0

Course Description

Linear and non-linear structures and their implementation using the object-oriented programming paradigm. Topics include algorithm analysis, algorithmic paradigms (divide and conquer, greedy heuristic, backtracking and dynamic programming), data representation, matrices, lists, stacks, queues, mappings, dictionaries, binary trees, balanced trees, B-trees, tree traversals, meta-languages, expression trees, prefix, infix and postfix expressions and conversions, priority queues and heaps, search trees, hashing, Huffman codes, graphs, and graph algorithms.

Prerequisite(s): A minimum "C" grade in CPSC 1160; or permission of department. CPSC 1181 is recommended. Prerequisites are valid for only three years.

Course Attributes (New Window)

Check course schedule availability » Check if this course is Transferable »
Check Bookstore for required textbooks »

Course Outline