CPSC 041. Algorithms

The study of algorithms is useful in many diverse areas. As algorithms are studied, considerable attention is devoted to analyzing formally their time and space requirements and proving their correctness. Topics covered include abstract data types, trees (including balanced trees), graphs, searching, sorting, NP complete optimization problems, and the impact of several models of parallel computation on the design of algorithms and data structures.
Group 1 course.
Prerequisite: CPSC 035  required. Mathematics background at the level of Linear Algebra or higher is required (may be taken concurrently).
Natural science and engineering.
Lab work required.
1 credit.
Eligible for DGHU
Fall 2023. Fontes.
Catalog chapter: Computer Science  
Department website: https://www.swarthmore.edu/computer-science

Access the class schedule to search for sections.

Print-Friendly Page (opens a new window)