Learn the characteristics of algorithms that lead to efficient computer solutions for discrete problems. Explore a variety of different algorithm classes and design techniques, including divide and conquer, greedy, dynamic programming, and backtracking, are introduced and compared. Gain an understanding of design and analysis of randomized algorithms is introduced, along with strategies for dealing with computationally hard problems. Normally, discuss one or more models of parallel algorithms.