CS 311 - Data Structures and Analysis of Algorithms

Credits: 3

This course introduces students to data structures such as lists, trees (including binary and multi-way trees), heaps, stacks, queues, and graphs. Students will learn concepts of algorithmic complexity, time and space analysis of recursive and non-recursive algorithms, including graph and sorting algorithms, and different algorithm design techniques. The course also introduces concepts of NP-completeness.

Prerequisite(s): CS 215 and either CS 301 or CS 358

Term(s) Offered: Fall

Search the USI Class Schedule for course availability