CS4713 — Analysis of Algorithms

CS 4713 - Analysis of Algorithms CS 4713 - Analysis of Algorithms Sem. Hrs: 3 Analysis of space and time requirements of algorithms. Worst case and average case studies. Greedy algorithms and divide and conquer algorithms. Tractable and intractable algorithms. Fall. Dual Listed/Cross Listed: CS 5713.

Prerequisites: CS3113, MATH2214, CS5713

Part of

• Computer Science, BS
• Data Science and Data Analytics, Emphasis in Data Science, Domain in Computer Science, BS

Source ↗

← back to astate catalog