CSCE 500Design&Analysis of Algorithms
University of Louisiana at Lafayette · 3 credits · GRAD

Catalog
This course provides a comprehensive coverage of modern computer algorithms, aiming at in-depth treatment of algorithmic design and analysis with elementary explanation while keeping mathematical rigor. Based on the textbook “Introduction to Algorithms”, this class covers the topics listed below in sequence. • Foundations. • Data Structures ‒ hash tables, binary search trees, red-black trees, B-trees. • Design and Analysis Techniques ‒ dynamic programming, greedy algorithms. • Graph Algorithms ‒ elementary graph algorithms, algorithms for shortest paths, maximum flows, minimum spanning trees. • Selected Topics ‒ NP-completeness, approximation algorithms, multithreaded algorithms. Each covered topic starts with the description of pertinent algorithms often in the pseudocode(s), followed by their careful complexity analyses.
Recent sections
Spring 2027 · 1 section
Jan 13 – May 7
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 001Class #43550 | Mo We · 10:00 – 11:15 AM | Oliver Hall 113 | Min Shi |
Fall 2026 · 1 section
Aug 24 – Dec 11
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 001Class #20207 | Mo We · 10:00 – 11:15 AM | Oliver Hall 113 | Nianfeng Tzeng |
| 001 notes: Instructional method: Standard 0-49 percent online | |||