https://www.paulbui.net/wiki/index.php?action=history&feed=atom&title=IBCS2_-_1213_-_DecemberIBCS2 - 1213 - December - Revision history2026-04-18T12:41:48ZRevision history for this page on the wikiMediaWiki 1.31.8https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1213_-_December&diff=9779&oldid=prevAdmin: Protected "IBCS2 - 1213 - December" ([edit=sysop] (indefinite) [move=sysop] (indefinite))2013-01-14T15:50:20Z<p>Protected "<a href="/wl/IBCS2_-_1213_-_December" title="IBCS2 - 1213 - December">IBCS2 - 1213 - 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 15:50, 14 January 2013</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_-_December&diff=9777&oldid=prevAdmin: Created page with "== Monday - Monday (12/24/12 - 12/31/12) == * Winter Break == Friday (12/21/12) == * DOSSIER DOSSIER DOSSIER! * Dossier - Criterion B2: Algorithms due Friday (1/4/13) ** [[Media..."2013-01-14T15:49:53Z<p>Created page with "== Monday - Monday (12/24/12 - 12/31/12) == * Winter Break == Friday (12/21/12) == * DOSSIER DOSSIER DOSSIER! * Dossier - Criterion B2: Algorithms due Friday (1/4/13) ** [[Media..."</p>
<p><b>New page</b></p><div>== Monday - Monday (12/24/12 - 12/31/12) ==<br />
* Winter Break<br />
<br />
== Friday (12/21/12) ==<br />
* DOSSIER DOSSIER DOSSIER!<br />
* Dossier - Criterion B2: Algorithms due Friday (1/4/13)<br />
** [[Media:CriterionB2_algorithms.doc]]<br />
* Dossier sections completed so far:<br />
** A1: Problem Analysis<br />
** A2: Criteria for Success<br />
** A3: Prototype Solution<br />
** B1: Data Structures<br />
* Use winter break to actually code your dossier!!<br />
** We are currently behind in the dossier<br />
** Complete dossier and documentation is due at the end of February<br />
<br />
== Wednesday (12/19/12) ==<br />
'''Agenda:'''<br />
* Hexadecimal & Binary Addition quiz ... surprise!<br />
* Dossier - Criterion B2: Algorithms due Wednesday (1/2/13)<br />
** [[Media:CriterionB2_algorithms.doc]]<br />
* Missing dossier sections<br />
* Dossier sections completed so far:<br />
** A1: Problem Analysis<br />
** A2: Criteria for Success<br />
** A3: Prototype Solution<br />
** B1: Data Structures<br />
* Use winter break to actually code your dossier!!<br />
** We are currently behind in the dossier<br />
** Complete dossier and documentation is due at the end of February<br />
<br />
== Monday (12/17/12) ==<br />
'''Agenda:'''<br />
* Hexadecimal<br />
** [[Media:Hexadecimal.ppt]]<br />
* Binary Addition<br />
** [[Media:BinaryAddition.ppt]]<br />
* Dossier Progress<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/13/12) ==<br />
'''Agenda:'''<br />
* Binary Quiz today<br />
* Analog vs. Digital<br />
** [[Media:AnalogDigital.ppt]]<br />
* Analog Signal Woes (interesting, but not on IB exam)<br />
** [[Media:AnalogProblems.ppt]]<br />
** What is noise?<br />
** Radio signals<br />
** TV signals (video signals)<br />
** Audio signals (through audio cables)<br />
** Signal-to-Noise Ratio<br />
* Why is digital better than analog?<br />
* Dossier Progress Check on Monday (12/17/11)<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 />
== Tuesday (12/11/12) ==<br />
'''Warmup:'''<br />
* What are the Big-O evaluations for the following?<br />
*# Selection Sort<br />
*# Binary Search<br />
*# Bubble Sort<br />
*# Linear Search<br />
*# Quick Sort?<br />
<br />
'''Agenda:'''<br />
* Turn in Dossier Criterion B1: Data Structures<br />
* Introduction to Binary <br />
** [[Media:Binary.ppt]]<br />
** [[Media:Binary2.ppt]]<br />
* Binary Games - Play individually or as a class?<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 Thursday (12/13/11)<br />
* Dossier Progress Check on Monday (12/17/11)<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 />
'''Homework:'''<br />
* Binary Quiz on Thursday (12/13/11)<br />
* Dossier Progress Check on Monday (12/17/11)<br />
<br />
== Friday (12/7/12) ==<br />
'''Agenda:'''<br />
* Work on your Dossier<br />
** Highly recommend planning out the classes that you intend to use<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 />
<br />
== Wednesday (12/5/12) ==<br />
'''Warmup:'''<br />
# Define the word '''algorithm'''<br />
# What qualities constitute a '''good''' algorithm versus a '''bad''' algorithm?<br />
<br />
'''Agenda:'''<br />
* Algorithm Evaluation - Big O!<br />
** [[Media:AlgorithmEvaluation.ppt]]<br />
** Algorithm Evaluation of Stack methods<br />
** Algorithm Evaluation of Queue methods<br />
** Algorithm Evaluation of Linked List methods<br />
** Algorithm Evaluation of Binary Tree methods<br />
** [[Big O Practice Problems]]<br />
<br />
== Monday (12/3/12) ==<br />
'''Agenda:'''<br />
* [http://contest.idtus.com/registration.php IDT Programming Contest Registration]<br />
* [http://www.washlee.net/cs2code/AddressBookGUI.zip AddressBookGUI Code Walk-through]<br />
** Read through the code yourself<br />
* Work on your Dossier<br />
** Highly recommend planning out the classes that you intend to use<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)</div>Admin