Loading course details…
Loading course details…
Arkansas State University · 3 credits · UGRD

Sem. Hrs: 3 Analysis of space and time requirements of algorithms. Worst case and average case studies. Greedy algorithms and divide and conquer algorithms. Tractable and intractable algorithms. Fall. Prerequisites: CPSI 33103 and MATH 25004. Dual Listed/Cross Listed: CS 5713.
Fall 2026 · 2 sections
Aug 19 – Dec 11
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 001Class #60481 | Tu Th · 3:30 – 4:45 PM | Computer Sci-Math 211 | Qualls, Jake |
| H01Class #65540 |
| Not published |
| Qualls, Jake |