COMPSCI 532

Design and Analysis of Algorithms

Duke University · UGRD · Fall 2026

1 section

Catalog description

Design and analysis of efficient algorithms. Algorithmic paradigms. Applications include sorting, searching, dynamic structures, graph algorithms, randomized algorithms. Computationally hard problems. NP completeness. Prerequisites: Computer Science 201 and 330 or equivalent.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 4 hours ago

001

Availability not recently verified

Class #duke-COMPSCI532Fall 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?