Difference between revisions of "IB Computer Science 1"
From WLCS
Line 1: | Line 1: | ||
+ | == Tuesday (2/14/12) == | ||
+ | '''Warmup:''' | ||
+ | * Assume you are given the following code: | ||
+ | |||
+ | <syntaxhighlight lang="Python"> | ||
+ | a = ??? | ||
+ | b = ??? | ||
+ | |||
+ | #Using an additional variable, swap the values in a and b (even though you don't know what they are) | ||
+ | </syntaxhighlight> | ||
+ | |||
+ | '''Agenda:''' | ||
+ | * Complete [[Advanced Python List Exercises]] | ||
+ | * Introduction to Nested Lists | ||
+ | ** Nested List Practice | ||
+ | ** Application in matrices | ||
+ | ** Other applications | ||
+ | |||
== Wednesday - Friday (2/8/12 - 2/10/12) == | == Wednesday - Friday (2/8/12 - 2/10/12) == | ||
'''Warmup:''' | '''Warmup:''' | ||
Line 8: | Line 26: | ||
* Complete [[Advanced Python List Exercises]] | * Complete [[Advanced Python List Exercises]] | ||
* For loop | * For loop | ||
− | |||
− | |||
− | |||
− | |||
== Monday (2/6/12) == | == Monday (2/6/12) == |
Revision as of 09:18, 14 February 2012
Contents
Tuesday (2/14/12)
Warmup:
- Assume you are given the following code:
a = ???
b = ???
#Using an additional variable, swap the values in a and b (even though you don't know what they are)
Agenda:
- Complete Advanced Python List Exercises
- Introduction to Nested Lists
- Nested List Practice
- Application in matrices
- Other applications
Wednesday - Friday (2/8/12 - 2/10/12)
Warmup:
Agenda:
- Demo Advanced Python List Exercises through Min/Max
- Demo Turtle - List Assignment
- Complete Advanced Python List Exercises
- For loop
Monday (2/6/12)
Warmup:
- On a separate sheet of paper, write out the algorithm to find the minimum number in a list of numbers
Agenda:
- Advanced Python List Exercises
- You should be completed through Min/Max
- Turtle - List Assignment
Tuesday - Thursday (1/31/12 - 2/2/12)
Warmup:
- Create a Python Turtle program that tells the turtle to move forward 100
- Don't forget about exitonclick()
Agenda:
- Advanced Python List Exercises
- You should be completed through Min/Max
- Turtle - List Assignment