CS 215Adv Data Struct and Algorithms
Marshall University · 3 credits

Catalog
Advanced techniques for designing and analyzing algorithms, including asymptotic analysis; data structures; divide-and-conquer algorithms and recurrences; greedy algorithms; dynamic programming; graph algorithms; randomized algorithms; and NP-complete problems.
Recent sections
Spring 2027 · 1 section
Jan 11 – May 7
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 201Class #3045 | Tu Th · 9:30 – 10:45 AM | WAEC 1101 | Yousef Fazea Alnadesh |
| 201 notes: Source section title: Adv Data Struct and Algorithms PR : CS210 Minimum Grade D , and ( MTH229 Minimum Grade D , or MTH229H Minimum Grade D ) Concurrent PR : and MTH220 Minimum Grade D | |||