Difference between revisions of "IB Computer Science 2"
From WLCS
Line 1: | Line 1: | ||
+ | == Wednesday (12/5/12) == | ||
+ | '''Warmup:''' | ||
+ | # Define the word '''algorithm''' | ||
+ | # What qualities constitute a '''good''' algorithm versus a '''bad'''algorithm? | ||
+ | |||
+ | '''Agenda:''' | ||
+ | * Algorithm Evaluation - Big O! | ||
+ | ** [[Media:AlgorithmEvaluation.ppt]] | ||
+ | ** Algorithm Evaluation of Stack methods | ||
+ | ** Algorithm Evaluation of Queue methods | ||
+ | ** Algorithm Evaluation of Linked List methods | ||
+ | ** Algorithm Evaluation of Binary Tree methods | ||
+ | ** [[Big O Practice Problems]] | ||
+ | * Work on your Dossier | ||
+ | ** Highly recommend planning out the classes that you intend to use | ||
+ | * 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) | ||
+ | |||
== Monday (12/3/12) == | == Monday (12/3/12) == | ||
'''Agenda:''' | '''Agenda:''' |
Revision as of 11:28, 5 December 2012
Contents
Wednesday (12/5/12)
Warmup:
- Define the word algorithm
- What qualities constitute a good algorithm versus a badalgorithm?
Agenda:
- Algorithm Evaluation - Big O!
- Media:AlgorithmEvaluation.ppt
- Algorithm Evaluation of Stack methods
- Algorithm Evaluation of Queue methods
- Algorithm Evaluation of Linked List methods
- Algorithm Evaluation of Binary Tree methods
- Big O Practice Problems
- Work on your Dossier
- Highly recommend planning out the classes that you intend to use
- 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)
Monday (12/3/12)
Agenda:
- IDT Programming Contest Registration
- AddressBookGUI Code Walk-through
- Read through the code yourself
- Work on your Dossier
- Highly recommend planning out the classes that you intend to use
- 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)
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
- Print this list out now
- 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
Tuesday (11/27/12)
Agenda:
- Missing items/demos?
- Criterion A3: Prototype Solution
- Media:AddressBookLLTest.java
- Media:StringBinaryTreeTestMain.java
- Java GUI assignment
- Complete and demo the Celcius Converter Tutorial
Friday - Tuesday (11/16/12 - 11/20/12)
Agenda:
- Turn in Criterion A3: Prototype Solution
- Mr. Bui's AddressBookLLTest
- 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
Wednesday (11/14/12)
- Reminder: A3: Prototype Solution is due Friday (11/16/12)
- Mr. Bui's AddressBookLLTest
- Sorting with LinkedLists walk-through
Friday (11/9/12)
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
- Don't create a main() file
- Create a new JFrame
- Drag-n-drop like crazy
- Run the specific frame file and take a screenshot for A3: Prototype Solution
- Mr. Bui's AddressBookLLTest
- Implementing sorting with LinkedLists
Friday - Wednesday (11/2/12 - 11/7/12)
Agenda:
- 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
- When you are done with AddressBookLL, edit the sort option so that it works with a LinkedList of Contacts