Difference between revisions of "IB Computer Science 1"
From WLCS
| Line 1: | Line 1: | ||
| + | == Monday (6/3/13) == | ||
| + | * Receive IBCS2 Textbooks | ||
| + | * [[IBCS2 Summer Assignment]] | ||
| + | * Complete [[Python - Maze Generation Assignment]] today! | ||
| + | |||
== Wednesday - Friday (5/29/13 - 5/31/13) == | == Wednesday - Friday (5/29/13 - 5/31/13) == | ||
* Complete [[Python - Maze Generation Assignment]] today! | * Complete [[Python - Maze Generation Assignment]] today! | ||
Revision as of 13:07, 3 June 2013
Contents
Monday (6/3/13)
- Receive IBCS2 Textbooks
- IBCS2 Summer Assignment
- Complete Python - Maze Generation Assignment today!
Wednesday - Friday (5/29/13 - 5/31/13)
- Complete Python - Maze Generation Assignment today!
Wednesday - Friday (5/15/13 - 5/23/13)
Warmup:
- All students, please complete the following survey:
- If you are a senior, please complete the following surveys
Agenda:
- Demo a working RoomTest.py
- Introduction to Stacks
- Media:Stacks.ppt
- Stack - CS Animated
- Stack backtracker practice
- Maze Generation
- Read Depth-first Search Be sure to watch the video.
- Walk-through Recursive backtracker.
- Use the maze generation algorithm to draw a maze here: Maze Designer
- Save your maze's code (the 1s and 0s)
- Practice it again and imagine how a stack would be used to backtrack
- Python - Maze Generation Assignment
Monday - Monday (5/6/13 - 5/13/13)
- Demo missing CombatSimulation.py
- Review class construction & using objects
- Introduction to the for loop
- Python - Creature Combat Game
- Demo a working RoomTest.py
Wednesday - Friday (5/1/13 - 5/3/13)
- Demo missing CombatSimulation.py
- Review class construction & using objects
- Introduction to the for loop
- Introduction to nested lists
- Review HTTLACS: Ch 9
- Read specifically and pay close attention to section 9.17 and 9.18
- Complete exercises #7, 8, 9 located at the bottom of HTTLACS: Ch 9
