CS 469 Data Structures and Algorithms in Computing *

This course offers an introduction to essential data structures and the design and analysis of algorithms. Topics include algorithms, data structures, sorting, recursion, stacks, hash tables, searching, and the principles of algorithm design and analysis. These subjects are fundamental to computer science, improve software application performance, and cultivate critical and analytical thinking skills. A solid understanding of these concepts equips students with the necessary tools to solve computing problems efficiently.

Credits

5

Prerequisite

For students to succeed in this course, CS 351 and IS 201 are required pre-requisites.

Outcomes

1. As a result of this course, students will know or be able to do the following:
2. 1. Understand the principles behind various data structures and algorithms, including their use cases and performance characteristics.
3. 2. Apply data structures and algorithms in a programming language to solve specific problems.
4. 3. Analyze the efficiency of different data structures and algorithms using Big O notation.
5. 4. Evaluate the suitability of different data structures and algorithms for specific problems.
6. 5. Create new algorithms or modify existing ones to address unique problems using custom data structures tailored to specific application needs.