COSC 300
Algorithms
Duquesne University · UGRD · Fall 2026
1 section
Catalog description
Algorithm design: divide-and-conquer, greedy algorithms, dynamic programming, reductions; algorithm analysis: asymptotic analysis (big-O), amortized analysis; graph algorithms; complexity classes: NP-completeness, Cook's theorem, NP-complete problems. Prerequisite: grade of "C" or better in COSC 215.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #duquesne-COSC300Fall 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?