Loading course details…
Loading course details…
University of Indianapolis · 4 credits · UGRD

This course will teach the student to use the classical abstract data structures (including linked lists, stacks, queues, and trees). These tend to play important roles in almost all large and important software systems. The student also will study sophisticated algorithms, many of which rely heavily on recursion, and learn how to measure and compare their computational complexity. These include, for instance, advanced searching and sorting techniques.
Fall 2026 · 1 section
Aug 31 – Dec 19
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 02Class #14285 | Th · 1:00 – 2:50 PMMo We · 2:00 – 2:50 PM | Online Course INTERNET | Stanley, Chris |
| 02 notes: Instructional method: Online (Synchronous) | |||