IB Computer Science 2

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:
  1. Add "Hyde"
  2. Add "Bradfield"
  3. Add "Infantino"
  4. Remove
  5. Add "Silverman"
  6. Remove
  7. What is left in the queue?

Agenda:

• Demo your completed CircularQueue Assignment
• Object and References Review
  • Media:Point.java
  • Media:ReferencesReview.java
• Node class
  • Media:Node.java
  • Media:NodeFun.java
  • Media:NodeFunAgain.java
• Node references practice
  1. Pair up
  2. Each person should type up an example main that uses Nodes
  3. Each person should then draw the memory diagram of the other person's code
  4. Repeat!
• Everybody must be an expert using Nodes and references
• 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)
  • Media:Queues.ppt
  • Media:Queue.java
  • Media:QueueMain.java
• 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

Archives

• IBCS2 - 1213 - September