CS 6003
Analysis of Algorithms
St. Francis College · UGRD · Fall 2026
Catalog description
This course introduces methods for the design and analysis of efficient algorithms emphasizing methods useful in practice. Different algorithms for a given computational task are presented and their relative merits are evaluated based on performance measures. The following computational problens are discussed: sorting, searching, elements of dynamic programming and greedy algorithms, advances data structures, graph algorithms (shortest path, spanning tress, tree traversals), string matching, elements of computational geometry, and NP-completeness.
Sections
Current meeting, instructor, credit, and enrollment details
7A01
35 openSeats: 3/38 seats Last recorded: Aug 14, 2026, 6:15 AM- Days & times
- Th · 12:00 – 8:00 PM
- Meeting dates
- Sep 9 – Dec 23
- Location
- ; ; ; ;
- Instructor
- Staff
Section notes
Hybrid. Meets asynchronous online and for Graduate Academic Residency (in-person)-10/22/26 - 10/25/26
7B01
37 openSeats: 1/38 seats Last recorded: Aug 14, 2026, 6:15 AM- Days & times
- Th · 12:00 – 8:00 PM
- Meeting dates
- Sep 9 – Dec 23
- Location
- ; ; ; ;
- Instructor
- Staff
Section notes
Hybrid. Meets asynchronous online and for Graduate Academic Residency (in-person)-12/17/26 - 12/20/26