CS 333 - Data Structures and Algorithms I

5.0 Credits
Students will explore and implement several structures commonly used for data storage. They will analyze these structures and their associated algorithms in order to identify the right structure for a task based on time and space performance. Completion of CS 202 and CS 301 with a grade of 2.5 or higher or instructor permission.
Prerequisite Admission in the Computer Science Bachelors of Science program is required to take this course.
Course-level Learning Objectives (CLOs)
Upon successful completion of this course, students will be able to:

Apply the principles of algorithm complexity analysis, using common notation, to various data structures.
Explain the advantages and disadvantages of array based and linked based structures.
Explain the benefits of and implement various types of linear structures (linked lists, stacks, queues, priority queues, etc).
Design and implement hash tables including collision handling strategies.
Implement and compare multiple types of tree balancing techniques and identify where each is best used.
Implement trees with different storage rules such as heaps and binary search trees, and the algorithms used with them.
Evaluate, compare, and implement various sorting and searching algorithms for given real-world problems.

Course Typically Offered
Fall, Spring