CSCI 5110 — Data Structure and Algorithms Transition

Introduction to efficient data structure and algorithm design. Order notation and asymptotic run-time of algorithms. Recurrence relations and solutions. Abstract data type dynamic set and data structures based on trees. Classic algorithm design paradigms: divide-and-conquer, dynamic programming, greedy algorithms. For Computer Science graduate students only. Taught with CSCI 3720 .

Part of

• Common Course Numbering Crosswalk
• CSCI-COMPUTER SCIENCE

Source ↗

← back to donaana catalog