CS 115 Data Structures & Algorithms

In this course the students will work with the common data structures or data abstractions, and how to implement them using object-oriented principles. The course will cover recursion, linked lists, queues, stacks, trees, graphs, hashing structures, and Big O notation for describing the performance or complexity of algorithms such as sorting and searching.
Skills gained: coding abstractions, working knowledge of the core existing algorithms and data structures; analysis of algorithms and critical thinking about implementations.

Credits

3

Prerequisite

CS 1B, MTH 120 or consent of the constructor

Distribution

CS