Analysis of Algorithms
Semester: Summer 2025
Status: Completed
Course Information
- Start Date: May 30, 2025
- End Date: July 3, 2025
- Time Zone: America/Chicago
- Syllabus: View on Canvas
Description
Design and analysis of algorithms including complexity analysis, divide and conquer, dynamic programming, greedy algorithms, graph algorithms, and NP-completeness.
Topics
- Algorithm complexity analysis (Big-O, Big-Omega, Big-Theta)
- Divide and conquer strategies
- Dynamic programming
- Greedy algorithms
- Graph algorithms
- NP-completeness and computational intractability
Resources
- Course Blog Posts
- Canvas Course: Course ID 37735
Related Content
### Recent Drafts
### Recent Projects
### Recent Posts
Recent Drafts
No drafts available for this course.
Recent Projects
No projects available for this course.
Recent Posts
No posts available for this course.