Difference between revisions of "IB Computer Science II"
From WLCS
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] | ||
+ | |||
+ | == Tuesday (10/28/08) == | ||
+ | * 1st Quarter Exam Review | ||
+ | ** Java programming | ||
+ | ** class construction | ||
+ | ** methods | ||
+ | *** components of the method header | ||
+ | ** Stacks | ||
+ | *** how they work | ||
+ | *** operations: push(), pop(), top(), isEmpty() | ||
+ | *** why we use them | ||
+ | *** example uses | ||
+ | ** Queues | ||
+ | *** how they work | ||
+ | *** operations: add(), remove(), head(), tail(), isEmpty() | ||
+ | *** why we use them | ||
+ | *** example uses | ||
+ | ** Nodes and reference variables | ||
+ | *** Memory diagram and tracing code | ||
+ | *** Stack and Queue implementations using Nodes | ||
== Wednesday - Monday (10/22/08 - 10/27/08) == | == Wednesday - Monday (10/22/08 - 10/27/08) == |
Revision as of 09:49, 28 October 2008
Welcome to the IB Computer Science II Homepage!
You may find the old IBCS2 website here: IBCS2_0708
Contents
- 1 Tuesday (10/28/08)
- 2 Wednesday - Monday (10/22/08 - 10/27/08)
- 3 Tuesday (10/21/08)
- 4 Friday - Monday (10/17/08 - 10/20/08)
- 5 Monday - Thursday (10/13/08 - 10/16/08)
- 6 Thursday (10/9/08)
- 7 Tuesday - Wednesday (10/7/08 - 10/8/08)
- 8 Monday (10/6/08)
- 9 Wednesday - Friday (10/1/08 - 10/3/08)
- 10 Archives
Tuesday (10/28/08)
- 1st Quarter Exam Review
- Java programming
- class construction
- methods
- components of the method header
- Stacks
- how they work
- operations: push(), pop(), top(), isEmpty()
- why we use them
- example uses
- Queues
- how they work
- operations: add(), remove(), head(), tail(), isEmpty()
- why we use them
- example uses
- Nodes and reference variables
- Memory diagram and tracing code
- Stack and Queue implementations using Nodes
Wednesday - Monday (10/22/08 - 10/27/08)
Warmup:
- Trace through Media:NodeFunAgain.java and draw the memory diagrams on a separate piece of paper
Agenda:
- Data Structure vs. Abstract Data Type
- Re-Introduction to Stacks
- Create a new class called DynamicStack
- What attribute must we keep track of when we talk about stacks?
- Create a Node reference for the most important stack attribute
- Implement push(int num) using Nodes.
- push() should not return anything
- push() creates a new Node with the num, and set the new Node's next reference to the top
- Don't forget to update the top to be the new node!
- Implement pop(), which should POP and return the value on top of the stack and update the top
- Implement top(), which should just return the value on top of the stack
- Implement isEmpty() which returns true if the stack is empty
- Implement print() which should print your entire stack
- TEST YOUR STACK USING MR. BUI'S STACK MAIN OR YOUR OWN MAIN METHOD
Tuesday (10/21/08)
- Object and References Review
- Node class
- Node references practice
Friday - Monday (10/17/08 - 10/20/08)
- Usability engineering
- Dossier Prototype Solution evaluation
- User feedback
Monday - Thursday (10/13/08 - 10/16/08)
Warmup:
- IB exam registration.
- Everyone will take the HL exam
Agenda:
- Reminder: Dossier Prototype Solution due this Friday
- CircularQueue Assignment
Thursday (10/9/08)
Warmup:
- Why do we use queues?
- Give an example of a queue in the room
- Identify the following parts in each of the method declarations: access type, return type, method name, parameters
- public int getSize()
- private String whatNot(String whatFor)
- public void print(int size, String stuff)
Agenda:
- Reminder: Dossier Criteria for Success due TOMORROW
- Demo your Queue.java and Queue.main
- Work on your Criteria for Success
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.