CS 333 - Data Structures and Algorithms I

Credits: 5
Variable Credit Course: No

Lecture Hours: 55
Lab Hours: 0
Worksite/Clinical Hours: 0
Other Hours (LIA/Internships): 0

Course Description: Explore and implement different methods of data storage and recommend which to use based on time and space performance. Evaluate commonly used data structures and their associated algorithms.

Prerequisite: CS 123 with a grade of C or higher; and CS 202 with a grade of C or higher or concurrent enrollment. Admission to BSCS program and Dept. Chair permission.
Meets FQE Requirement: No
Integrative Experience Requirement: No

Student Learning Outcomes

Apply principles of algorithm complexity analysis, using common notation, and apply to the data structures in this course.
Implement various types of linked list.
Implement a stack and a queue data structure including traversal, insertion, and deletion.
Implement tree structures including traversal and balancing techniques.
Implement a priority queue and heap data structures using appropriate algorithms.
Recommend and implement appropriate sorting and searching algorithms for a given real-world problem.
Create a hash table design with collision handling strategies.

Course Contents

Bags, queues, and stacks.
Sorting, priority queues, and symbol tables.
Binary search trees, balanced binary search trees, and hash tables.

Instructional Units: 5