CPSC
2150
Algrthms & Data Strctrs II
Lecture Hours
4.0
Seminar Hours
0.0
Lab Hours
2.0
Credits
3.0
Regular Studies
Description
Students build on the foundational concepts learned in CPSC 1160 and expand their skills to include non-linear data structures and hashing. Topics include algorithm analysis, non-comparative sorting, algorithmic paradigms (divide and conquer, greedy, heuristic, backtracking, and dynamic programming), binary search trees, balanced trees, tree traversals, priority queues and heaps, Huffman codes, graphs, and graph algorithms. Students implement solutions using an object-oriented programming language.
Prerequisite(s): A minimum "C" grade in CPSC 1160; or permission of department. CPSC 1181 is recommended. Prerequisites are valid for only three years.
Prerequisite(s): A minimum "C" grade in CPSC 1160; or permission of department. CPSC 1181 is recommended. Prerequisites are valid for only three years.
