CSCI4230 - Algorithms Design and Analysis

The CSCI 4230 Algorithm Design and Analysis course teaches students the principles and techniques for designing, analyzing, and implementing efficient algorithms. It covers topics such as algorithms for advanced data structures, search algorithms, graph algorithms, NP-completeness and approximation algorithms. Students learn to think algorithmically, develop problem-solving skills, and study algorithm design and analysis techniques such as divide and conquer, dynamic programming, greedy algorithms, backtracking, heuristic approach, amortized analysis, and randomized algorithms. The course may also cover additional practical issues related to algorithm implementation and optimization, including caching, memoization, and parallelization.
Prerequisites CSCI3210 or ENGR3440
3 Credits