Algorithms are an essential part of any efficient solutions for computer applications that evolve with the development in computing technologies. Therefore it is imperative for any computing student to have sufficient knowledge of standard algorithm design techniques and analysis. In this unit the students will learn these standard techniques: divide and conquer, greedy, and dynamic programming. The unit shows how the techniques, among others, are used in sorting algorithms, graph algorithms, data compression, 0/1 knapsack, string searching, matrix-chain multiplication, longest common subsequence, and parallel and distributed algorithms. The students will also learn how to use... -- Course Website
Prerequisites: 1922 (v.8)<br/> Data Structures and Algorithms 120<br/> <br/> or any previous version
