Difference between revisions of "IB Computer Science II"
From WLCS
(→Tuesday (10/7/08)) |
|||
| Line 2: | Line 2: | ||
You may find the old IBCS2 website here: [http://www.paulbui.net/wl/cs2 IBCS2_0708] | You may find the old IBCS2 website here: [http://www.paulbui.net/wl/cs2 IBCS2_0708] | ||
| + | |||
| + | == Thursday (10/9/08) == | ||
| + | '''Warmup:''' | ||
| + | * Why do we use queues? | ||
| + | * Give an example of a queue in the room | ||
| + | |||
| + | '''Agenda:''' | ||
| + | * Reminder: Dossier Criteria for Success due TOMORROW | ||
| + | * Demo your Queue.java and Queue.main | ||
| + | * | ||
== Tuesday - Wednesday (10/7/08 - 10/8/08) == | == Tuesday - Wednesday (10/7/08 - 10/8/08) == | ||
Revision as of 09:41, 9 October 2008
Welcome to the IB Computer Science II Homepage!
You may find the old IBCS2 website here: IBCS2_0708
Contents
Thursday (10/9/08)
Warmup:
- Why do we use queues?
- Give an example of a queue in the room
Agenda:
- Reminder: Dossier Criteria for Success due TOMORROW
- Demo your Queue.java and Queue.main
Tuesday - Wednesday (10/7/08 - 10/8/08)
Warmup:
- What does LIFO stand for?
- What are the operations we can use on a stack?
- When do we use stacks?
Agenda:
- Reminder: Dossier Criteria for Success due this Friday
- Queues
- Fix Queue.java so that it works. You must fill in all the method bodies
Monday (10/6/08)
- Reminder: Dossier Criteria for Success due this Friday
- Introduction to Data Structures
- Stacks
Wednesday - Friday (10/1/08 - 10/3/08)
- Complete adding selectionSort() and bubbleSort() to your AddressBook
- Demo missing work to Mr. Bui
- Read through Media:CriterionA2_criteriaforSuccess.doc
- Begin working on your Criteria for Success. It will be due next week.
