Loading course details…
CSCI 3330ALGORITHMS
University of Central Arkansas · 3 credits · UGRD
Catalog
A required course for majors and minors that studies algorithmic development strategies including divide-and-conquer, greedy method, dynamic programming, search and traversal techniques, backtracking, and branch-and-bound. The theory of NP-Hard and NP-Complete problems is introduced. Analysis of algorithms is also included. Prerequisites: CSCI 2320 and 2330.
Recent sections
Fall 2026 · 2 sections
Aug 20 – Dec 11
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 0Class #22104 | Tu Th · 10:50 AM – 12:05 PM | Math, CSci &Tech 339 | Not published |
| 0Class #27014 |