Analysis of Algorithms

Robert Pitts

Spring Semester 2025 | 3 Credit Hours

Course Description

This course explores the application and efficiency of algorithms. Topics include dynamic programming, balanced trees, graph and sort algorithms, and Big-O notation.

To Begin This Course...

Review the Course Syllabus on the Syllabus tab.
Click the Next or Previous buttons to navigate through the course modules.
Watch the QC Canvas Navigation Video for a brief overview of Canvas.
Click the Modules tab to access course content and assignments/assessments.
Click the Start Here button below to continue.

Canvas Accessibility | Canvas Privacy