CSCI 312 - Data Structures and Algorithms

3 Credits
This course is a continuation of object-oriented programming that investigates advanced topics in technically oriented programming. Algorithmic analysis using computational complexity and big-O notation will be applied to classic data structures, including but not limited to arrays, vectors, linked lists, stacks, queues, trees, binary trees, binary search trees, and graphs. The computational complexity of classic searching and sorting algorithms will also be investigated.

Prerequisite(s): CSCI 232, CSCI 234, or CSCI 239