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

In this course, students will learn to design and analyze efficient algorithms for sorting, searching, graphs, sets, matrices, and other applications. Students will also learn to recognize and prove NP-Completeness.
Fall 2026 · 3 sections
Sep 1 – Dec 17
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 1Class #42101 | Mo We · 9:30 – 10:45 AM | Robinson Hall 323 | Hristescu, Gabriela |
| 2Class #42103 |
| Robinson Hall 302 |
| Lobo, Andrea |
| 3Class #42105 | Tu Th · 2:00 – 3:15 PM | Robinson Hall 302 | Lobo, Andrea |
|---|