Go to Main Content

Purdue Self-Service



Syllabus Information


Spring 2024
May 28, 2024
Transparent Image
Information Use this page to maintain syllabus information, learning objectives, required materials, and technical requirements for the course.

Syllabus Information
CS 38100 - Introduction To The Analysis Of Algorithms
Associated Term: Spring 2024
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.
Required Materials:
Technical Requirements:

Return to Previous New Search
Transparent Image
Skip to top of page