Design and Analysis of Algorithms

3 credits · Graduate

Design and analysis of efficient algorithms. Algorithmic paradigms. Applications include sorting, searching, dynamic structures, graph algorithms, randomized algorithms. Computationally hard problems. NP completeness. Prerequisites: Computer Science 201 and 330 or equivalent.