https://www.paulbui.net/wiki/index.php?action=history&feed=atom&title=IBCS2_-_1011_-_DecemberIBCS2 - 1011 - December - Revision history2026-04-13T08:56:55ZRevision history for this page on the wikiMediaWiki 1.31.8https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1011_-_December&diff=6765&oldid=prevAdmin: Protected "IBCS2 - 1011 - December" ([edit=sysop] (indefinite) [move=sysop] (indefinite))2011-01-04T04:53:08Z<p>Protected "<a href="/wl/IBCS2_-_1011_-_December" title="IBCS2 - 1011 - December">IBCS2 - 1011 - December</a>" ([edit=sysop] (indefinite) [move=sysop] (indefinite))</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 04:53, 4 January 2011</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_-_1011_-_December&diff=6763&oldid=prevAdmin: Created page with "== Thursday - Friday (12/23/10 - 12/31/10) == * Winter Break == Tuesday (12/21/10) == '''Agenda:''' * Return Binary Quizzes * Media:NegBinarySignMag.ppt * [[Media:NegBinary2..."2011-01-04T04:52:32Z<p>Created page with "== Thursday - Friday (12/23/10 - 12/31/10) == * Winter Break == Tuesday (12/21/10) == '''Agenda:''' * Return Binary Quizzes * <a href="/wiki/images/0/00/NegBinarySignMag.ppt" class="internal" title="NegBinarySignMag.ppt">Media:NegBinarySignMag.ppt</a> * [[Media:NegBinary2..."</p>
<p><b>New page</b></p><div>== Thursday - Friday (12/23/10 - 12/31/10) ==<br />
* Winter Break<br />
<br />
== Tuesday (12/21/10) ==<br />
'''Agenda:'''<br />
* Return Binary Quizzes<br />
* [[Media:NegBinarySignMag.ppt]]<br />
* [[Media:NegBinary2sComp.ppt]]<br />
<br />
'''Homework:'''<br />
* Winter Break - Complete your Dossier code<br />
<br />
== Friday (12/17/10) ==<br />
* Binary Quiz<br />
* Work on Dossier projects!<br />
<br />
== Wednesday (12/15/10) ==<br />
'''Warmup:'''<br />
* Dossier Progress Check<br />
* Show code completion of the following pieces of your dossier:<br />
** Basic container class (e.g. Contact)<br />
** Node class (e.g. ContactLLNode or ContactBTNode)<br />
** Partial completion of your major data structure (e.g. ContactLL or ContactBT)<br />
<br />
'''Agenda:'''<br />
* [[Media:Hexadecimal.ppt]]<br />
* [[Media:BinaryAddition.ppt]]<br />
<br />
== Monday (12/13/10) ==<br />
'''Warmup:'''<br />
* List all the Big-O complexities in order from fastest to slowest. Hint: There are 7 you should know.<br />
* For at least 2 of the above complexities, give an example of the algorithm that has that complexity<br />
<br />
'''Agenda:'''<br />
* Final AddressBook demoes?<br />
* Introduction to Binary - [[Media:Binary.ppt]]<br />
* Introduction to Binary #2 - [[Media:Binary2.ppt]]<br />
* Binary Games<br />
** [http://britton.disted.camosun.bc.ca/binary.swf Binary Game #1]<br />
** [http://forums.cisco.com/CertCom/game/binary_game_page.htm Binary Game #2]<br />
* Binary Quiz on Friday (12/17/10)<br />
* Dossier Progress Check on Wednesday (12/15/10)<br />
** You will demo / present completion of the following components in your dossier:<br />
*** Basic container class (e.g. Contact)<br />
*** Node class (e.g. ContactLLNode or ContactBTNode)<br />
*** Partial completion of your major data structure (e.g. ContactLL or ContactBT)<br />
<br />
== Thursday (12/9/10) ==<br />
'''Agenda:'''<br />
* BT AddressBook demoes<br />
* Algorithm Evaluation - Big O! <br />
** [[Media:AlgorithmEvaluation.ppt]]<br />
** [[Big O Practice Problems]]<br />
<br />
== Tuesday (12/7/10) ==<br />
'''Warmup:'''<br />
* List the stages of the software development life cycle<br />
* List 3 different methods of data collection for the Analysis stage<br />
<br />
'''Agenda:'''<br />
* Turn in Dossier: B2 - Data Structures<br />
* Final demoes for LLAddressBook<br />
* BT AddressBook demoes<br />
<br />
== Friday (12/3/10) ==<br />
'''Agenda:'''<br />
* Dossier - Data Structures '''due Tuesday (12/7/10)'''<br />
** [[Media:CriterionB1_dataStructures.doc]]<br />
* Demo AddressBook 2<br />
* Create 3 new classes called ContactBinaryTreeNode, ContactBinaryTree, and ContactBTTestMain<br />
* [[Media:BinaryTreeNode.java]]<br />
* [[Media:BinaryTree.java]]<br />
* [[Media:BinaryTreeTestMain.java]]<br />
* Convert the 3 given binary tree classes to use Contacts instead of ints<br />
* Create and demo a BinaryTreeAddressBook<br />
<br />
== Wednesday (12/1/10) ==<br />
'''Warmup:'''<br />
* Insert the following numbers into a binary tree: 45, 23, 12, 87, 54, 52, 12, 0<br />
* How many comparisons does it take to find the number 54? (Remember to start at the root)<br />
* How many comparisons does it take to find the number 12? (Remember to start at the root)<br />
* What is the most number of comparisons that it takes to find a number? (Remember to start at the root)<br />
<br />
'''Agenda:'''<br />
* AddressBook 2 Demo<br />
* Remove<br />
*# Prompt the user for a name<br />
*# Find the Contact in the LinkedList<br />
*# Use the LinkedLists's remove method to remove it<br />
* Sort<br />
*# Use the SelectionSort algorithm<br />
*# You will need to convert the loops to traverse a LinkedList<br />
*# When swapping a Contact with the front, do not swap nodes, but just the Contacts inside them<br />
* Edit<br />
*# In the Address menu, you will need to ask the user which Contact they want to edit<br />
*# Search for the Contact, and then prompt the user which field they want to edit<br />
*# Prompt the user for the new information and use the Contact's setter method to change the particular field<br />
* Create 3 new classes called ContactBinaryTreeNode, ContactBinaryTree, and ContactBTTestMain<br />
* [[Media:BinaryTreeNode.java]]<br />
* [[Media:BinaryTree.java]]<br />
* [[Media:BinaryTreeTestMain.java]]<br />
* Convert the 3 given binary tree classes to use Contacts instead of ints<br />
* Create and demo a BinaryTreeAddressBook</div>Admin