CSC 560
Analysis of Algorithms
West Chester University of Pennsylvania · UGRD · Fall 2026
1 section
Catalog description
This course introduces the methods to analyze the efficiency of computer algorithms in terms of their use of both space and time. Algorithmic design techniques, such as divide and conquer, greedy methods, and dynamic programming are illustrated throughout the course. The theory of NP-completeness and tractability is introduced.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #west_chester_pennsylvania-CSC560Fall 2026UGRD3 credits
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?