Difference between revisions of "IB Computer Science 2"
From WLCS
| Line 5: | Line 5: | ||
'''Agenda:''' | '''Agenda:''' | ||
* Missing Prototype Solutions | * Missing Prototype Solutions | ||
| + | * Demo completed Binary Tree w/ Strings | ||
* Demo completed AddressBook w/ Menu and Binary Tree | * Demo completed AddressBook w/ Menu and Binary Tree | ||
| − | * Java | + | * Java GUIs |
| + | ** NetBeans IDE | ||
== Wednesday - Friday (11/16/11 - 11/18/11) == | == Wednesday - Friday (11/16/11 - 11/18/11) == | ||
Revision as of 14:29, 22 November 2011
Contents
Tuesday (11/22/11)
Warmup:
- Insert the following numbers into a binary tree: 45, 23, 12, 87, 54, 52, 12, 0
Agenda:
- Missing Prototype Solutions
- Demo completed Binary Tree w/ Strings
- Demo completed AddressBook w/ Menu and Binary Tree
- Java GUIs
- NetBeans IDE
Wednesday - Friday (11/16/11 - 11/18/11)
Agenda:
- Turn in missing assignments: AddressBookLL & Prototype Solution
- 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 Friday (11/18/11)
- Media:StringBinaryTreeTestMain.java
- AddressBookMain - implement an Edit feature.
- In the Address menu, you will need to ask the user which Contact they want to edit
- Search for the Contact, and then prompt the user which field they want to edit
- Prompt the user for the new information and use the Contact's setter method to change the particular field
- AddressBook Binary Tree - due Tuesday (11/22/11)
- Create 3 new classes called ContactBinaryTreeNode, ContactBinaryTree, and AddressBookBT
- Convert the BinaryTreeNode and BinaryTree such that they use Contacts
- Create a new AddressBookBT that uses a BinaryTree (instead of LinkedList)
- Upon completion, you should have an AddressBook with a menu that uses a binary tree, which allows users to add, remove, search, and edit Contacts
Homework:
- Binary Tree Assignment due Friday (11/18/11)
- AddressBookBT Assignment due Tuesday (11/22/11)
Monday (11/14/11)
Agenda:
- Turn in missing Prototype Solutions
- Demo AddressBookLL Assignment
- Mr. Bui's AddressBookLLTest
- Implementing sorting with LinkedLists
Wednesday (11/9/11)
Agenda:
- IDT Programming Contest will begin on 11/11/11
- Individuals and teams should meet after school on Monday (11/14/11)
- Take out your Dossier A3: Prototype Solution
- Should have a flowchart and corresponding screenshots
- We will be peer-editing and providing "user feedback"
- CS2 Code
- AddressBookLL Assignment due on Monday (11/14/11)
- You MUST work on the above at home. There will not be much lab time to work on these assignments.
Wednesday - Friday (11/2/11 - 11/4/11)
Agenda:
- IDT Programming Contest
- Begins November 11, 2011
- Solutions submitted by December 27, 2011
- 1st place - $1,500
- 2nd place - $750
- 3rd place - $500
- Carney JAMTech - December 3rd
- Demo your completed Media:LinkedList.java
- Test your LinkedList using Media:LinkedListTestMain.java
- Flow Charts
- Prototype Solution due Wednesday (11/9/11)
- Be sure to create a complete "Initial Design" flow chart of program screens
- Each box should have a corresponding prototype window
- Media:CriterionA3_prototypeSolution.doc
- AddressBookLL Assignment
- Create a new Java Project and name it AddressBookLLProject
- Copy over your Contact, AddressBook, and AddressBookMain classes to this new project
- 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)
- 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
- 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
- Test out everything using AddressBookMain, which should not require any changes except for commenting out the sort option
Homework:
- Media:CriterionA3_prototypeSolution.doc due Wednesday (11/9/11)
- AddressBookLL Assignment due on Monday (11/14/11)
- You MUST work on the above at home. There will not be much lab time to work on these assignments.
