Difference between revisions of "IB Computer Science 2"
From WLCS
| Line 1: | Line 1: | ||
| + | == Monday (10/15/12) == | ||
| + | '''Warmup:''' | ||
| + | * Draw the memory diagram for the following code: | ||
| + | |||
| + | <syntaxhighlight lang="Java"> | ||
| + | Node x = new Node(); | ||
| + | x.num = 5; | ||
| + | Node y = new Node(); | ||
| + | y.num = 8; | ||
| + | y.next = x; | ||
| + | x.next = null; | ||
| + | </syntaxhighlight> | ||
| + | |||
| + | '''Agenda:''' | ||
| + | * Node references practice | ||
| + | *# Pair up | ||
| + | *# Each person should type up an example main that uses Nodes | ||
| + | *# Each person should then draw the memory diagram of the other person's code | ||
| + | *# Repeat! | ||
| + | * Everybody must be an expert using Nodes and references | ||
| + | * Node Quiz | ||
| + | |||
== Thursday (10/11/12) == | == Thursday (10/11/12) == | ||
* What does FIFO stand for? | * What does FIFO stand for? | ||
| Line 20: | Line 42: | ||
** [[Media:NodeFun.java]] | ** [[Media:NodeFun.java]] | ||
** [[Media:NodeFunAgain.java]] | ** [[Media:NodeFunAgain.java]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
* Node Quiz on Monday (10/15/12) | * Node Quiz on Monday (10/15/12) | ||
** Be able to trace code and draw memory diagram | ** Be able to trace code and draw memory diagram | ||
Revision as of 10:03, 15 October 2012
Contents
Monday (10/15/12)
Warmup:
- Draw the memory diagram for the following code:
Node x = new Node();
x.num = 5;
Node y = new Node();
y.num = 8;
y.next = x;
x.next = null;
Agenda:
- Node references practice
- Pair up
- Each person should type up an example main that uses Nodes
- Each person should then draw the memory diagram of the other person's code
- Repeat!
- Everybody must be an expert using Nodes and references
- Node Quiz
Thursday (10/11/12)
- What does FIFO stand for?
- When would you want to use a queue? Give an example
- Assume the following queue operations have occurred:
- Add "Hyde"
- Add "Bradfield"
- Add "Infantino"
- Remove
- Add "Silverman"
- Remove
- What is left in the queue?
Agenda:
- Demo your completed CircularQueue Assignment
- Object and References Review
- Node class
- Node Quiz on Monday (10/15/12)
- Be able to trace code and draw memory diagram
- Be able to write code that creates a given memory diagram
Homework:
- Node Quiz on Monday (10/15/12)
Tuesday (10/9/12)
Agenda:
- Stacks Quiz 2
- Demo your completed Media:Queue.java using Media:QueueMain.java
- CircularQueue Assignment
Thursday (10/4/12)
Agenda:
- Turn in Criterion A: Analyzing the Problem
- Stacks Review
- Stacks Pop Quiz
- Stacks Quiz 2 on Tuesday (10/9/12)
- Queueueueueues (Queues)
- Fix Media:Queue.java so that it works. You must fill in all the method bodies
Homework:
- Stacks Quiz 2 on Tuesday (10/9/12)
- Fix Media:Queue.java so that it works with Media:QueueMain.java
