CSP 201 Data Structures and Algorithms

3 Credits

This course covers the key concepts involved in designing algorithms to solve computer related problems. Algorithms are closely tied to the data structures they will use . Some structures and algorithms are more efficient than others for the same task. The course will cover some basic tasks, such as storing, sorting and searching data that are applicable in most programming languages. Data structures covered will include arrays, lists, queues, stacks and trees. These will be examined in the context of their use in a number of different searching and sorting algorithms. Efficiency considerations will be examined. Pseudocode will be used to illustrate examples of algorithms.

Prerequisite(s): CIS 201 and CIS 350