Computer Science 385
Design and Analysis of Algorithms
Spring 2026, Siena University
Lecture 6: Asymptotic Analysis
Date: Monday, February 2, 2026
Agenda
- Announcements
- Problem Set 1: [PDF]
- due Wednesday
- hard copy submission only: typeset or handwritten or a
combination but must be legible
- procedures for submission: drop off at RB 308, if I am not
there, email me a photo of the submission for time stamp
purposes and slide it under the door
- Bring computers to lab tomorrow if you can. Siena laptops
will be available on request.
- More on getting help from the Math Center
- Asymptotic analysis
- Big O,
Big Ω, Big Θvisually
- Using limits to prove membership in efficiency classes
- Analyzing non-recursive algorithms
Links