|
|
Line 1: |
Line 1: |
− | <!--
| |
− | == Monday (12/22/08) ==
| |
− | * Demo your BTAddressBook by the end of today!
| |
− | * Dossier - Data Structures
| |
− | ** The Data Structures section of your dossier is due on Monday (1/5/09).
| |
| | | |
− | == Friday (12/19/08) ==
| |
− | * Demo your BTAddressBook by the end of today!
| |
− | * Dossier - Data Structures
| |
− | ** The Data Structures section of your dossier will be due when we get back from break.
| |
− |
| |
− | == Thursday (12/18/08) ==
| |
− | * ContactBTNode
| |
− | ** Create a new class called ContactBTNode that uses Contact instead of String
| |
− | * ContactBinaryTree
| |
− | ** Create a new class called ContactBinaryTree that uses Contact instead of String
| |
− | ** When comparing the Contact to the current node, be sure that you are comparing their Lastname+Firstname
| |
− | * BTAddressBook
| |
− | ** Create a new class called BTAddressBook that uses your ContactBinaryTree instead of CLinkedList
| |
− | ** BTAddressBook will be VERY, VERY simple because you will be using the ContactBinaryTree inside of it
| |
− | * TESTING
| |
− | ** Be sure to test your new BTAddressBook (copy and paste your old test code from the other AddressBookTestMains)
| |
− |
| |
− | == Wednesday (12/17/08) ==
| |
− | * Attend presentation on science and engineering (sponsored by SHPE)
| |
− |
| |
− | == Monday - Tuesday (12/15/08 - 12/16/08) ==
| |
− | * Proper coding style
| |
− | ** Program header at the very top
| |
− | *** the program name
| |
− | *** author, date, school
| |
− | *** computer used, IDE used, purpose
| |
− | ** Proper indentation
| |
− | ** Proper line-wrapping (how to deal with LONG lines of code)
| |
− | * Go back through your StringBinaryTree and make sure that the proper coding style is used
| |
− | * ContactBTNode
| |
− | ** Create a new class called ContactBTNode that uses Contact instead of String
| |
− | * ContactBinaryTree
| |
− | ** Create a new class called ContactBinaryTree that uses Contact instead of String
| |
− | * BTAddressBook
| |
− | ** Create a new class called BTAddressBook that uses your ContactBinaryTree instead of CLinkedList
| |
− |
| |
− | == Thursday - Friday (12/11/08 - 12/13/08) ==
| |
− | * Download the following files:
| |
− | ** [[Media:BTNode.java]]
| |
− | ** [[Media:BinaryTree.java]]
| |
− | ** [[Media:BinaryTreeTestMain.java]]
| |
− | * Create a new class called StringBinaryTree that is a binary tree of strings
| |
− | * Test out your StringBinaryTree
| |
− | * Comment your StringBinaryTree code (you must explain WHY and WHAT the code is doing what it's doing)
| |
− |
| |
− | == Tuesday - Wednesday (12/9/08 - 12/10/08) ==
| |
− | * Binary Tree Review
| |
− | * BTNode Review
| |
− | * BinaryTree Class construction (we will create BinaryTree as a class)
| |
− |
| |
− | == Friday - Monday (12/5/08 - 12/8/08) ==
| |
− | * Software systems life cycle & software development
| |
− | ** [[Media:SoftwareDevelopment.ppt]]
| |
− |
| |
− | == Thursday (12/4/08) ==
| |
− | * Dossier progress check
| |
− |
| |
− | == Monday - Wednesday (12/1/08 - 12/3/08) ==
| |
− | * IMPORTANT: USE THIS CLASS TIME WISELY!
| |
− | * Dossier Programming Days - use this time in class to begin programming the classes you will use in your dossier
| |
− | ** Create your basic container classes (e.g. Person, Schedule, Book, Order, Ticket, etc.). They should contain the following:
| |
− | *** private attributes
| |
− | *** default constructor
| |
− | *** specific constructor
| |
− | *** setters
| |
− | *** getters
| |
− | ** Create any classes that may contain these other classes (e.g. Library, AddressBook, etc.)
| |
− | ** Using your prototype solution as a guide, you should begin creating the main menu system for your dossier.
| |
− | * When Mr. Bui returns, you should be able to show him all the basic container classes AND a basic menu system
| |
− |
| |
− | == Archives ==
| |
− | * [[IBCS2 - November]]
| |
− | * [[IBCS2 - October]]
| |
− | * [[IBCS2 - September]]
| |
− | -->
| |