Lesson 1.1: Introduction
Class Meeting:
| Section | Slides | Annotated Slides | Video |
| 12–1PM | 1.1-intro-analysis-203-1221.pdf Download 1.1-intro-analysis-203-1221.pdf | coming after class! |
see "cloud recordings" in Zoom |
| 1–2PM | 1.1-intro-analysis-raw.pdf Download 1.1-intro-analysis-raw.pdf | 1.1-intro-analysis-201-1pm.pdf Download 1.1-intro-analysis-201-1pm.pdf |
see "cloud recordings" in Zoom |
| 4–5PM | 1.1-intro-analysis-raw.pdf Download 1.1-intro-analysis-raw.pdf | 1.1-intro-analysis-202-4pm.pdf Download 1.1-intro-analysis-202-4pm.pdf |
see "cloud recordings" in Zoom |
Readings:
- Carrano & Henry : Chapter 10
- Epp : Chapter 11.2 - 11.3
- Zych C++ intro.pdf
Summary:
Welcome to CPSC221 -- Data Structures and Algorithms! In this course we will learn to design and evaluate programmatic approaches to problem solving. The course has 3 main units. Though they overlap and influence one another, we will address the units in roughly this order:
- reasoning about code
- classic data structures
- graph algorithms
Today's lesson is an introduction to the context in which we evaluate our code, and the issues we consider when we do so.
Learning Outcomes:
Upon completion off this lesson, students will be able to:
- give an overview of the course goals
- motivate the tradeoff between order and chaos in data
- discuss the metrics used to evaluate an algorithm
- explain why running time functions are non-decreasing