CS 350 Data Structures

Fall Semester

This course is an in-depth examination of important data structures, their algorithms, and implementation techniques. Both abstract and concrete data structures are discussed including sequences, stacks, queues, maps, sets, graphs, array lists, linked lists, skip lists, search trees, heaps, and hash tables. Students will implement and apply the data structures through a series of programming assignments. Prerequisite: CS 201 with a grade of 2.0 or higher.

3 credit hours