Computer Science 385
Design and Analysis of Algorithms

Spring 2025, Siena College

Home     Syllabus     Schedule

Agenda

• Announcements
  • Problem Set 1: [PDF]
    • due Wednesday
  • Bring computers to lab this week if you can. Some Siena laptops will be available on request.
• Asymptotic analysis
  • Big O, Big Ω, Big Θvisually
  • Using limits to prove membership in efficiency classes
• Analyzing non-recursive algorithms

Links

• Difference between Big O, Big Ω, Big Θ Notations on Geeks for Geeks