https://www.paulbui.net/wiki/index.php?action=history&feed=atom&title=IBCS2_-_1213_-_NovemberIBCS2 - 1213 - November - Revision history2026-04-22T11:43:06ZRevision history for this page on the wikiMediaWiki 1.31.8https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1213_-_November&diff=9710&oldid=prevAdmin: Protected "IBCS2 - 1213 - November" ([edit=sysop] (indefinite) [move=sysop] (indefinite)) [cascading]2012-12-18T17:34:32Z<p>Protected "<a href="/wl/IBCS2_-_1213_-_November" title="IBCS2 - 1213 - November">IBCS2 - 1213 - November</a>" ([edit=sysop] (indefinite) [move=sysop] (indefinite)) [cascading]</p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr class="diff-title" lang="en">
<td colspan="1" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td>
<td colspan="1" style="background-color: #fff; color: #222; text-align: center;">Revision as of 17:34, 18 December 2012</td>
</tr><tr><td colspan="2" class="diff-notice" lang="en"><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Adminhttps://www.paulbui.net/wiki/index.php?title=IBCS2_-_1213_-_November&diff=9709&oldid=prevAdmin: Created page with "== Thursday (11/29/12) == '''Agenda:''' * Binary Tree Quiz * Dossier - remember that there are example dossiers on this page! * Dossier Criterion B1: Data Structures - [[Medi..."2012-12-18T17:34:26Z<p>Created page with "== Thursday (11/29/12) == '''Agenda:''' * Binary Tree Quiz * <a href="/wl/Dossier" title="Dossier">Dossier</a> - remember that there are example dossiers on this page! * Dossier Criterion B1: Data Structures - [[Medi..."</p>
<p><b>New page</b></p><div>== Thursday (11/29/12) ==<br />
'''Agenda:'''<br />
* Binary Tree Quiz<br />
* [[Dossier]] - remember that there are example dossiers on this page!<br />
* Dossier Criterion B1: Data Structures - [[Media:CriterionB1_dataStructures.doc]]<br />
** Due Tuesday (12/11/12)<br />
** This section describes ALL the data structures that you plan to us<br />
*** Container classes (e.g. Contact)<br />
*** Data structures (e.g. array, linked list, binary tree)<br />
*** File format structures (e.g. how your data files will be organized)<br />
* Mastery Aspects - [[Media:MasteryAspects.doc]]<br />
*# Print this list out now<br />
*# Identify the 10 that you will most likely have in your code<br />
* [http://www.washlee.net/cs2code/AddressBookGUI.zip AddressBookGUI Code Walk-through]<br />
** Read through the code yourself<br />
* Work on your Dossier code<br />
** Highly recommend planning out the classes that you intend to use<br />
<br />
== Tuesday (11/27/12) ==<br />
'''Agenda:'''<br />
* Missing items/demos?<br />
** Criterion A3: Prototype Solution<br />
** [[Media:AddressBookLLTest.java]]<br />
** [[Media:StringBinaryTreeTestMain.java]]<br />
* Java GUI assignment<br />
** Complete and demo the [http://docs.oracle.com/javase/tutorial/uiswing/learn/index.html Celcius Converter Tutorial]<br />
<br />
== Friday - Tuesday (11/16/12 - 11/20/12) ==<br />
'''Agenda:'''<br />
* Turn in Criterion A3: Prototype Solution<br />
* Mr. Bui's AddressBookLLTest<br />
** [[Media: AddressBookLLTest.java]]<br />
* Sorting with LinkedLists walk-through<br />
* Introduction to Binary Trees<br />
** [[Media:BinaryTrees.ppt]]<br />
** [[Media:BinaryTreeNode.java]]<br />
** [[Media:BinaryTree.java]]<br />
** [[Media:BinaryTreeTestMain.java]]<br />
* Binary Tree Assignment - Convert BinaryTree so that it contains Strings instead of int. Be sure to test it to make sure it works<br />
** Binary Tree Assignment due Tuesday (11/27/12)<br />
** [[Media:StringBinaryTreeTestMain.java]]<br />
<br />
== Wednesday (11/14/12) ==<br />
* Reminder: A3: Prototype Solution is due Friday (11/16/12)<br />
* Mr. Bui's AddressBookLLTest<br />
** [[Media: AddressBookLLTest.java]]<br />
* Sorting with LinkedLists walk-through<br />
<br />
== Friday (11/9/12) ==<br />
'''Agenda:'''<br />
* Turn in A2: Criteria for Success<br />
* A3: Prototype Solution - [[Media:CriterionA3_prototypeSolution.doc]]<br />
** Due Friday (11/16/12)<br />
* Flowcharts - [[Media:Flowcharts.ppt]]<br />
** Microsoft Word (recommended)<br />
** Google Draw<br />
** [http://www.diagram.ly/ Diagramly]<br />
* Java GUI development<br />
** NetBeans GUI Builder<br />
*# Don't create a main() file<br />
*# Create a new JFrame<br />
*# Drag-n-drop like crazy<br />
*# Run the specific frame file and take a screenshot for A3: Prototype Solution<br />
* Mr. Bui's AddressBookLLTest<br />
** [[Media: AddressBookLLTest.java]]<br />
* Implementing sorting with LinkedLists<br />
<br />
== Friday - Wednesday (11/2/12 - 11/7/12) ==<br />
'''Agenda:'''<br />
* AddressBookLL Assignment<br />
*# Create a new Java Project and name it AddressBookLLProject<br />
*# Copy over your Contact, AddressBook, and AddressBookMain classes to this new project<br />
*# Create a new class named ContactNode<br />
*#* ContactNode should be just like Node, but instead of having an '''int num''', you should have a '''Contact contact''' as the internal attribute<br />
*#* Also be sure to have the next reference, which should be of type: ContactNode<br />
*#* Your ContactNode class should have two constructors: ContactNode() and ContactNode(Contact newContact)<br />
*# Create a new class named ContactLinkedList<br />
*#* Copy over your LinkedList code<br />
*#* Convert the code so that it uses ContactNode and Contact instead of int<br />
*#* Wherever you need to return an error Contact, return '''null''' or -1<br />
*# Change AddressBook so that it uses the ContactLinkedList instead of the Contact[]<br />
*#* Be sure to create a '''new''' instance of ContactLinkedList in the AddressBook() constructor<br />
*#* Most of AddressBook will look MUCH simpler b/c all you need to do is use the ContactLinkedList<br />
*#* Comment out your sort() method<br />
*# Test out everything using AddressBookMain, which should not require any changes except for commenting out the sort option<br />
* When you are done with AddressBookLL, edit the sort option so that it works with a LinkedList of Contacts</div>Admin