Skip to main content

Ctrl+K

Introduction to Computer Science, part 1

00 Accessibility Statement

A Free, Open, and Accessible Computer Science Text

01 Getting a Start

A Course in Computational Thinking
Installing Python and IDLE
Python Programming Kickstart
Project

02 Writing Functions

Designing and Building Functions in Python
Binding: Functions and Scope
Function Hygiene in Python
Review of terms
Exercises
Projects

03 Collections and Loops

Collections and Loops
Exercises
Project

Graphic Interlude

Interlude: Conquering Harder Problems with Abstraction

04 More Loops and Collections

Loops and more loops
Parallel Lists
Indefinite loops
Successive approximation
Exercises
Project

05 Recursion

Recursive Functions
Exercises
Project

06 Binding and Scope

Binding and scope
Aliasing
Scopes
Imported and Qualified Names
Binding in Recursive Functions
Exercises

07 Efficiency

Efficiency
Binary Search
Exercises
Project

08 Loop Forms and Idioms

Loops Again
What for?
More on Lists, Indexes, and Slices
Exercises
Project

09 Recursive Data

Recursive Data Structures
Other Nested Structures
Treemap Visualization of Recursive Data
Addendum: The Shape of Data
Exercises

Appendices

Style Guide for Python Programs

Binder

Repository
Open issue

.ipynb
.md

Interlude: Conquering Harder Problems with Abstraction

Interlude: Conquering Harder Problems with Abstraction#

by Audra McNamee with Michal Young
PDF version

previous

Project

next

Loops and more loops

By Michal Young

© Copyright 2022-2024 Michal Young and University of Oregon. Creative Commons Share-Alike Attribution license.