CS 300 Data Structures and Algorithms

This course is a continuation of CS 180 and is an advanced study of data structures such as stacks, queues, trees, and graphs. File access methods and powerful search and sort algorithms will also be discussed. Algorithms studied will also be analyzed for efficiency. 

Credits

3

Prerequisite

CS 180

Offered

Fall

Student Learning Outcomes

1. Understand and use various data structures including vectors, linked vectors, linked lists, stacks, queues and binary trees
2. Understand and use various algorithms including several searching and sorting algorithms
3. Understand and use recursion in solving problems
4. Understand how to analyze the efficiency of algorithms and determine which is more efficient
5. Effectively use the object-oriented approach in solving problems