IB Computer Science II
From WLCS
Welcome to the IB Computer Science II Homepage!
You may find the old IBCS2 website here: IBCS2_0708
Contents
Monday (11/17/08)
Warmup:
- Create a new Java file named AddressBookMainWarmup with a main method
- In the main method, do the following:
- test
- test
- test
- test
Agenda:
- Demo your AddressBook that uses a LinkedList
- LinkedList Search
- LinkedList Sort
Friday (11/14/08)
- By the end of today, you should be able to demo an AddressBook that uses a LinkedList
- Be sure to comment out the find(), selectionSort(), and bubbleSort() methods in your AddressBook class
Wednesday (11/12/08)
- Demo your LinkedList class
- Contact class review
- Create a new class from your Node class and called ContactNode
- Create a new class called ContactLinkedList
- Convert your LinkedList to use ContactNode and call it ContactLinkedList
- Be sure to test your ContactLinkedList
- AddressBook class review
- Convert your AddressBook to use ContactLinkedList instead of array
- Comment out the methods for find(), selectionSort(), and bubbleSort(). We will convert these later
- Be sure to test your AddressBook with LOTS of contacts
Thursday - Friday (11/6/08 - 11/7/08)
- Show Mr. Bui your Queue before-and-after diagrams
- LinkedLists cont'd
- Attributes: head, tail, size
- Constructors: default
- Methods:
- isEmpty() - returns true if the LinkedList is empty, and false otherwise
- void add(int num) - adds a new Node with num at the end of the LinkedList
- int remove(int index) - removes the index-th Node and returns its data
- There are SIX different scenarios when you remove a Node
- void add(int num, int index)
- There are FIVE different scenarios when you add a Node
- DRAW the before-and-after pictures for all FIVE secenarios
- print() - traverses the LinkedList and prints out each Node's data
- Media:LinkedList.java
- LinkedListTestMain - create as a class
Wednesday (11/5/08)
- Print out your DynamicQueue.java -- I will grade them by hand
- Introduction to LinkedLists
- Attributes: head, tail, size
- Constructors: default
- Methods:
- isEmpty() - returns true if the LinkedList is empty, and false otherwise
- void add(int num) - adds a new Node with num at the end of the LinkedList
- int remove(int index) - removes the index-th Node and returns its data
- There are FIVE different scenarios when you remove a Node
- print() - traverses the LinkedList and prints out each Node's data
- Homework: Draw the before-and-after diagrams for the remove() method
Monday (11/3/08)
Warmup:
- On a separate sheep of paper, please answer the following questions:
- In a dynamically-sized queue's isEmpty() method, what are the two different cases or scenarios that you check for?
- In a dynamically-sized queue's add() method, what are the two different cases or scenarios?
- Draw the before and after picture of each of the two scenarios.
- In a dynamically-sized queue's remove() method, what are the two different cases or scenarios?
- Draw the before and after picture of each of the two scenarios.
Agenda:
- Secret ballot - Have you installed and used Java or JCreator on your computer at home?
- Demo DynamicQueues
- Introduction to Linked Lists
