CS 38100 - Introduction To The Analysis Of Algorithms

Credit Hours: 3.00. Techniques for analyzing the time and space requirements of algorithms. Application of these techniques to sorting, searching, pattern-matching, graph problems, and other selected problems. Brief introduction to the intractable (NP-hard) problems.

Learning Outcomes
1. Use big O-notation to give asymptotic time and space bounds of algorithms.
2. Explain the use of big-Omega, big-Theta, and little-o notations.
3. Use recurrence relations to determine the time complexity of recursive algorithms.
4. Solve recurrence relations commonly arising in algorithm design.
5. Give examples that illustrate time-space trade-offs of algorithms.

Credits: 3.00

Communication

Campus

Services

Other

CS 38100 - Introduction To The Analysis Of Algorithms