Loading course details…
Loading course details…
Bradley University · 3 credits · UGRD

Design and analysis of algorithms. Dynamic structures maintenance and hashing. Searching, sorting, and traversal. Time and space requirements; simplification; computational complexity; proof theory and testing; NP-hard and NP-complete problems.
Fall 2026 · 1 section
Aug 26 – Dec 19
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 02Class #26FA-CS-514-02 | Tu · 9:00 – 10:15 AM | BR 290 | Saifuddin Mahmud |