Loading course details…
CPSI 55703ANALYSIS OF ALGORITHMS
Arkansas State University · 3 credits · UGRD
Catalog
Sem. Hrs: 3 The analysis of space and time requirements of algorithms. Worst-case and average case studies. Greedy algorithms and divide-and-conquer algorithms examined. Tractable and intractable algorithms surveyed. Prerequisites: CS 3113 or "B" or better in CPSI 55032, and MATH 2214. Dual Listed/Cross Listed: Dual listed as CS 4713.
Recent sections
Fall 2026 · 1 section
Aug 19 – Dec 11
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 001Class #60482 | Tu Th · 3:30 – 4:45 PM | Computer Sci-Math 211 | Qualls, Jake |