Think Python: How to Think Like a Computer Scientist

Week 1

Topics

python & unix
types
variables
calling simple functions
raw_input()
print(), print formatting
learn editor, write and run simple programs

Readings

Chapter 1

* 1.1 python, interactive mode
* 1.2 programs (input, output, etc)
* 1.3 debugging
* 1.4 formal and natural languages
* 1.5 first program; print()
* 1.6 debugging

Chapter 2

* 2.1 values and types: int,str,float
* 2.2 variables, assignment
* 2.3 variable names
* 2.4 operators: +,-,*,/,**
* 2.5 expressions and statements
* 2.6 interavtive vs script mode
* 2.7 order of operations
* 2.8 string operations: +, *
* 2.9 comments
* 2.10 debugging (basics)

Chapter 5
```
* 5.11 keyboard input: raw_input()
```

Chapter 14

* 14.3 format operator (print formatting)

Week 2

Topics

writing simple functions
arguments, return values
type conversions
import statement, math library
simple for loop, range()
create your own simple functions
first look at stack diagrams

Readings

Chapter 3
- 3.1 functions calls: args, return values
- 3.2 type conversion
- 3.3 import, math functions
- 3.4 composition
- 3.5 write your own functions
- 3.6 definitions
- 3.7 flow of execution
- 3.8 parameters and arguments
- 3.9 variables and parameters are local
- 3.10 stack diagrams
- 3.11 fruitful functions and void functions
- 3.12 why functions?
- 3.13 importing with from
- 3.14 debugging (spaces and tabs, print statements)
Chapter 4
- 4.2 simple repetition/for loops

Week 3

Topics

QUIZ 1 (week 1 and some of week 2: types, variables, simple programming)
turtle graphics
more practice with functions
comments
random numbers

Readings

Chapter 4
- 4.1 turtle world
- 4.2 simple repetition/for loops
- 4.3 turtle exercises to try
- 4.4 encapsulation: def square(t)
- 4.5 generalization: def square(t, sidelength)
- 4.6 interface design (clean use of parameters)
- 4.7 refactoring
- 4.8 development plan (start small, refactor, etc)
- 4.9 docstring ("""function comments""")
- 4.10 debugging (pre & postconditions)
Chapter 13
- 13.2 random numbers (random(), randint(), choice())

Week 4

Topics

mod operator (%)
booleans
logical operators (and, or, not)
conditionals (if\elif\else)
nesting

Readings

Chapter 5
- 5.1 % operator
- 5.2 boolean expressions
- 5.3 and, or, not
- 5.4 if
- 5.5 if/else
- 5.6 if/elif/else
- 5.7 nested conditionals
- 5.12 debugging (traceback)

Week 5

Topics

QUIZ 2 (weeks 2 & 3: for loops, simple functions)
more function practice
incremental development
boolean functions
more stack diagrams
try/except
while loops
random numbers

Readings

Chapter 6
- 6.1 return values
- 6.2 incremental development (TDD)
- 6.3 composition: call one function from another
- 6.4 boolean functions
- 6.8 checking types: isinstance(x, int), defensive programming
- 6.9 debugging (args, function, return, print statements)
Chapter 7
- 7.1 multiple assignment (b = a)
- 7.2 updating variables: x = x + 1
- 7.3 while loops
- 7.4 while True + break
- 7.5 square root (example of while loop)
- 7.6 algorithms (humans vs computers, designing algs)
- 7.7 debugging (bisection)
Chapter 13
- 13.2 random numbers (random(), randint(), choice())
Chapter 14
- 14.5 try/except

Week 6

Topics

lists and strings
sequences
slicing
mutable vs immutable
list and string methods
in operator
string comparison
passing lists to functions

Readings

Chapter 8
- 8.1 sequence
- 8.2 len()
- 8.3 for loop over chars
- 8.4 slicing
- 8.5 immutable
- 8.6 searching a string
- 8.7 looping and counting (accumulator)
- 8.8 string methods
- 8.9 in operator
- 8.10 string comparison
- 8.11 debugging (getting indices correct)
Chapter 10
- 10.1 sequence
- 10.2 mutable
- 10.3 traverse a list
- 10.4 list operations: +, *
- 10.5 slicing
- 10.6 methods
- 10.9 lists and strings (list(), split(), join())
- 10.10 objects and values (a = [1,2,3]; b = [1,2,3])
- 10.11 aliasing
- 10.12 passing lists to functions
- 10.13 debugging (common list problems, like L = L.sort())

FALL BREAK

Week 7

Topics

QUIZ 3 (weeks 4 & 5)
File I/O
Top-Down Design
looping with indices
list-of-lists

Readings

Chapter 9
- 9.1 file I/O (readlines())
- 9.2 examples of file I/O
- 9.3 search
- 9.4 looping with indices
- 9.5 debugging (testing special cases)
Chapter 13
- 13.1 word-freq analysis (read file, parse into words)

Week 8

Topics

searching: linear vs binary search
intro to analysis of algorithms

Readings

Appendix B: Analysis of Algorithms
- B.1 order of growth
- B.2 analysis of basic python ops
- B.3 analysis of search algs

Week 9

Topics

QUIZ 4 (weeks 6 & 7)
sorting
insertion, bubble, selection
merge sort, start of recursion

Readings

www.sorting-algorithms.com
looking for good source on sorting

Week 10

Topics

recursion
merge sort
graphics examples

Readings

Chapter 5
- 5.8 recursion
- 5.9 stack diagrams with recursive functions
- 5.10 infinite recursion
- 5.14 Koch curve
Chapter 6
- 6.5 more recursion
- 6.6 leap of faith
- 6.7 another recursion example

Week 11

Topics

QUIZ 5 (weeks 8 & 9)
classes

Readings

Chapter 15: classes and objects
- 15.1 user-defined types
- 15.2 attributes
- 15.3 rectangle example
- 15.4 instances and return values
- 15.5 mutable
Chapter 16: classes and functions
- 16.1 Time class example
- 16.2 pure functions (does not modify args, only returns value)
- 16.3 modifiers
- 16.4 prototype & patch vs TDD
- 16.5 Debugging (invariants, assert)
Chapter 17: classes and methods
- 17.1 OO features
- 17.2 printing
- 17.3 example
- 17.4 another example
- 17.5 init
- 17.6 str
- 17.10 debugging
- 17.11 interface/information hiding

Week 12

Topics

more classes
Thanksgiving Break

Readings

Chapter 18: inheritance
- 18.1 card objects
- 18.2 class attributes
- 18.3 comparing cards
- 18.4 Deck object
- 18.5 str for Deck
- 18.6 add, remove, shuffle, sort
- 18.8 class diagrams
- 18.9 Debugging
- 18.10 Data encapsulation

Week 13

Topics

QUIZ 6 (weeks 10 & 11)
Linked Lists
python list vs linked list
analysis of algorithms

Readings

Appendix B: Analysis of Algorithms
- B.1 order of growth
- B.2 analysis of basic python ops

Week 14

Topics

class wrap-up
survey