CSC 2430 Design and Analysis of Algorithms
This course is a continuation of CSC 1200. Students will continue to develop their algorithmic problem solving skills while being made increasingly aware of efficiency and ethical considerations. Topics include recurrence relations, time and space complexity, divide and conquer algorithms, greedy algorithms, dynamic programming and data parallelization. Students will solve real-world problems in multiple ways, analyzing the space, time and sometimes ethical trade-offs associated with each approach.
Distribution
Mathematics/Computer StudiesOffered
Spring