Complexity measures of algorithms; searching, sorting, string matching and graph algorithms; design and analysis of greedy algorithms, backtracking, divide and conquer approach, dynamic programming; NP-complete and NP-hard problems are studied.
Credit 3 hrs May not be repeated for additional credit Grade Mode Normal (A-F) Course Rotation