Computer Science 210
Data Structures
Fall 2018, Siena College
Lecture 12: Complexity and Asymptotic Analysis
Date: Monday, October 1, 2018
Agenda
- Announcements
- Problem Set 2 and Lab 3: ArrayList Practice due today
- Don't forget to work through J+DS zyBook Ch. 10
- Don't forget to come to the exam tomorrow night
- Don't forget not to come to lab on Wednesday
- Next reading/zyBook assignment, due Monday, October 8
Read and complete any participation activities you wish in
J+DS zyBook Ch. 11.
Please complete the "Challenge Activities" in
Chapter 11 (there are only a few but are a bit challenging). This will be
worth a total of 20 "Assignment" points, with your score based on the
percentage of tests your responses pass.
- Problem Set 1 recap
- Complexity and asymptotic analysis
- Exam review
Terminology
- computational cost
- basic operation
- space cost
- trends
- asymptotic analysis
- Big O
- relative rates of growth
- order of growth/complexity
- constant, logarithmic, linear, quadratic, cubic, polynomial, exponential, factorial
- best/worst/average case complexity