Credit Hours: 3Covers time and space complexity of algorithms. Analyzes algorithms for sorting, searching, string processing and graph problems. Presents strategies such as divide-and-conquer, and greedy and dynamic programming as problem-solution techniques. Prerequisite: CSE 2010 or ECE 2552, ECE 3541
