CSCI 4350: Design/Analysis of Algorithms (3)
Lecture: 3, Lab: 0, Other: 0
Techniques for designing efficient algorithms; analysis of time- and space- complexity of algorithms; lower bound arguments; algorithms for sorting, selection, graphs and string matching. An examination of various algorithmic designs, such as greedy algorithms, divide-and-conquer algorithms and dynamic programming algorithms. Pre-requisite: CSCI 3200