IBCS2 - 1213 - November

Thursday (11/29/12)

Agenda:

Binary Tree Quiz
Dossier - remember that there are example dossiers on this page!
Dossier Criterion B1: Data Structures - Media:CriterionB1_dataStructures.doc
- Due Tuesday (12/11/12)
- This section describes ALL the data structures that you plan to us
  - Container classes (e.g. Contact)
  - Data structures (e.g. array, linked list, binary tree)
  - File format structures (e.g. how your data files will be organized)
Mastery Aspects - Media:MasteryAspects.doc
1. Print this list out now
2. Identify the 10 that you will most likely have in your code
AddressBookGUI Code Walk-through
- Read through the code yourself
Work on your Dossier code
- Highly recommend planning out the classes that you intend to use

Agenda:

Missing items/demos?
- Criterion A3: Prototype Solution
- Media:AddressBookLLTest.java
- Media:StringBinaryTreeTestMain.java
Java GUI assignment
- Complete and demo the Celcius Converter Tutorial

Agenda:

Turn in Criterion A3: Prototype Solution
Mr. Bui's AddressBookLLTest
- Media: AddressBookLLTest.java
Sorting with LinkedLists walk-through
Introduction to Binary Trees
Binary Tree Assignment - Convert BinaryTree so that it contains Strings instead of int. Be sure to test it to make sure it works
- Binary Tree Assignment due Tuesday (11/27/12)
- Media:StringBinaryTreeTestMain.java

Agenda:

Turn in A2: Criteria for Success
A3: Prototype Solution - Media:CriterionA3_prototypeSolution.doc
- Due Friday (11/16/12)
Flowcharts - Media:Flowcharts.ppt
- Microsoft Word (recommended)
- Google Draw
- Diagramly
Java GUI development
- NetBeans GUI Builder
1. Don't create a main() file
2. Create a new JFrame
3. Drag-n-drop like crazy
4. Run the specific frame file and take a screenshot for A3: Prototype Solution
Mr. Bui's AddressBookLLTest
- Media: AddressBookLLTest.java
Implementing sorting with LinkedLists

Agenda:

AddressBookLL Assignment
1. Create a new Java Project and name it AddressBookLLProject
2. Copy over your Contact, AddressBook, and AddressBookMain classes to this new project
3. Create a new class named ContactNode
  - ContactNode should be just like Node, but instead of having an int num, you should have a Contact contact as the internal attribute
  - Also be sure to have the next reference, which should be of type: ContactNode
  - Your ContactNode class should have two constructors: ContactNode() and ContactNode(Contact newContact)
4. Create a new class named ContactLinkedList
  - Copy over your LinkedList code
  - Convert the code so that it uses ContactNode and Contact instead of int
  - Wherever you need to return an error Contact, return null or -1
5. Change AddressBook so that it uses the ContactLinkedList instead of the Contact[]
  - Be sure to create a new instance of ContactLinkedList in the AddressBook() constructor
  - Most of AddressBook will look MUCH simpler b/c all you need to do is use the ContactLinkedList
  - Comment out your sort() method
6. Test out everything using AddressBookMain, which should not require any changes except for commenting out the sort option
When you are done with AddressBookLL, edit the sort option so that it works with a LinkedList of Contacts