Python Lessons
Learn Python step by step, from your first variable to measuring how fast an algorithm runs. The lessons follow AP Computer Science Principles Big Idea 3 and show College Board pseudocode next to Python.
Start with Intro to Python if you are new to the language, then work through the topics in order. Back to all lessons
Getting Started
| Lesson | What you will learn |
|---|---|
| Intro to Python | Python basics - primitive and reference data types, dictionaries, classes and objects. |
Big Idea 3 - Algorithms and Programming
| Lesson | What you will learn |
|---|---|
| 3.01 Variables and Assignments | Store values in variables, pick fitting data types, and update values with assignment. |
| 3.02 Data Abstraction | Use lists and dictionaries to group related data and manage complexity. |
| 3.03 Mathematical Expressions | Arithmetic operators, operator precedence, modulus, and sequencing in Python and pseudocode. |
| 3.04 Strings | Index, slice, concatenate, and search strings, then split structured text. |
| 3.05 Boolean Expressions | Relational and logical operators that evaluate to True or False. |
| 3.06 Conditionals | Make decisions with if, elif, and else, and trace which branch runs. |
| 3.07 Nested Conditionals | Put decisions inside decisions and trace multi-level logic. |
| 3.08 Iteration | Repeat code with for and while loops, and control loops with conditions. |
| 3.09 Developing Algorithms | Compare, trace, modify, and combine algorithms in Python and College Board pseudocode. |
| 3.10 Lists | Create, index, update, and traverse lists; common list algorithms. |
| 3.12 Calling Procedures | Define procedures with parameters, pass arguments, and decompose a task into helper procedures. |
| 3.13 Developing Procedures | Design your own procedures with parameters and return values. |
| 3.14 Libraries | Import and use library procedures and APIs instead of writing everything yourself. |
| 3.16 Simulations | What simulations are, why their results differ from reality, and an interactive event-planning simulation. |
| 3.17 Algorithmic Efficiency | Compare how running time grows, and recognise reasonable versus unreasonable time. |
| 3.18 Undecidable Problems | Decidable versus undecidable problems and the halting problem, with practice questions. |
17 pages in this section.