https://www.paulbui.net/wiki/index.php?action=history&feed=atom&title=IBCS2_-_1011_-_JanuaryIBCS2 - 1011 - January - Revision history2026-04-09T13:00:28ZRevision history for this page on the wikiMediaWiki 1.31.8https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1011_-_January&diff=7537&oldid=prevAdmin: Protected "IBCS2 - 1011 - January" ([edit=sysop] (indefinite) [move=sysop] (indefinite))2011-04-26T14:31:39Z<p>Protected "<a href="/wl/IBCS2_-_1011_-_January" title="IBCS2 - 1011 - January">IBCS2 - 1011 - January</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 14:31, 26 April 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_-_January&diff=7536&oldid=prevAdmin: Created page with "== Monday (1/31/11) == '''Warmup:''' * Take out a clean sheet of paper. Invert your seats and separate. * This is a closed-book, closed-person, POP-quiz (hahaha!) * Simplify the..."2011-04-26T14:31:32Z<p>Created page with "== Monday (1/31/11) == '''Warmup:''' * Take out a clean sheet of paper. Invert your seats and separate. * This is a closed-book, closed-person, POP-quiz (hahaha!) * Simplify the..."</p>
<p><b>New page</b></p><div>== Monday (1/31/11) ==<br />
'''Warmup:'''<br />
* Take out a clean sheet of paper. Invert your seats and separate.<br />
* This is a closed-book, closed-person, POP-quiz (hahaha!)<br />
* Simplify the following boolean expression AND write out its truth table after simplifying<br />
* A'B'C + AB + A'C + A'B'C + AB'C<br />
<br />
'''Agenda:'''<br />
* Return Analog vs. Digital & Errors Quiz<br />
* NSF Field Trip<br />
* Introduction to Logic Gates<br />
** [[Media:LogicGates.ppt]]<br />
* File Input/Output - reading and writing to files<br />
** [[Media:RAFWriteDemo.java]]<br />
** [[Media:RAFReadDemo.java]]<br />
* Add writing to file to your LinkedList class<br />
*# Add a method named saveToFile(String filename)<br />
*# Open the filename for writing using RandomAccessFile<br />
*# writeUTF() the number of nodes or size of your LinkedList<br />
*# Create a loop that traverses the LinkedList and writeUTF() all of the nodes' data<br />
* If you want to add writing to file to a BinaryTree, then you must create recursive saveToFile() and saveToFileSubtree() methods that look like print() and printSubtree()<br />
<br />
== Tuesday (1/25/11) ==<br />
'''Warmup:'''<br />
* Get checked off for completing homework ([[Boolean expression exercises]])<br />
* Simply the following ABC' + A'B' + AC' + B'C<br />
<br />
'''Agenda:'''<br />
* Return 2nd Quarter Exams<br />
* Field trip forms<br />
* File Input/Output - reading and writing to files<br />
** [[Media:RAFWriteDemo.java]]<br />
** [[Media:RAFReadDemo.java]]<br />
* Add writing to file to your LinkedList class<br />
*# Add a method named saveToFile(String filename)<br />
*# Open the filename for writing using RandomAccessFile<br />
*# writeUTF() the number of nodes or size of your LinkedList<br />
*# Create a loop that traverses the LinkedList and writeUTF() all of the nodes' data<br />
* If you want to add writing to file to a BinaryTree, then you must create recursive saveToFile() and saveToFileSubtree() methods that look like print() and printSubtree()<br />
<br />
== Friday (1/21/11) ==<br />
'''Agenda:'''<br />
* NVCC Dual Enrollment<br />
* Turn in Dossier - Criterion B3: Modular Organization (late!)<br />
* Analog/Digital & Errors quiz<br />
* Complete [[File I/O Exercise]] and demo (more time in class next week)<br />
* Complete [[Boolean expression exercises]]<br />
<br />
'''Homework:'''<br />
* Complete Dossier sections and CODE<br />
* Complete [[Boolean expression exercises]] #10-15 for Tuesday (1/25/11)<br />
<br />
== Wednesday (1/19/11) ==<br />
'''Agenda:'''<br />
* Turn in Dossier - Criterion B3: Modular Organization (due today)<br />
* Analog/Digital & Errors quiz this Friday (1/21/11)<br />
** [[Media:AnalogDigital.ppt]]<br />
** [[Media:Errors.ppt]]<br />
* [[Boolean expression exercises]]<br />
* Be sure you've completed the following Criteria<br />
** A1: Analysis of the Problem - [[Media:CriterionA1_problemAnalysis.doc]]<br />
** A2: Criteria for Success - [[Media:CriterionA2_criteriaforSuccess.doc]]<br />
** A3: Prototype Solution - [[Media:CriterionA3_prototypeSolution.doc]]<br />
** B1: Data Structures - [[Media:CriterionB1_dataStructures.doc]]<br />
** B2: Algorithms - [[Media:CriterionB2_algorithms.doc]]<br />
** B3: Modular Organization - [[Media:CriterionB3_modularOrganization.doc]]<br />
** C1: Good Programming Style - [[Media:CriterionC1_goodProgrammingStyle.doc]]<br />
<br />
== Thursday (1/13/11) ==<br />
'''Warmup:'''<br />
* Draw the truth table for the following Boolean expression: ABC + A'B'C' + AC' + A'B'<br />
<br />
'''Agenda:'''<br />
* Turn in Dossier - Criterion B2: Algorithms<br />
* Dossier - Criterion B3: Modular Organization due Wednesday (1/19/11)<br />
** [[Media:CriterionB3_modularOrganization.doc]]<br />
* Analog/Digital & Errors quiz next Friday (1/21/11)<br />
** [[Media:AnalogDigital.ppt]]<br />
** [[Media:Errors.ppt]]<br />
* Review Boolean Logic<br />
* Simplifying Boolean expressions<br />
** [[Media:SimplifyingBooleanExpressions.ppt]]<br />
* Boolean expressions practice<br />
** [[Boolean expression exercises]]<br />
* Dossier work time<br />
<br />
== Tuesday (1/11/11) ==<br />
'''Warmup:'''<br />
* What is the decimal value of today's date?<br />
* What is the ASCII character represented by today's date? (Hint: Use the interwebz)<br />
<br />
'''Agenda:'''<br />
* Dossier Sections:<br />
** Dossier - Criterion B1: Data Structures return<br />
** Dossier - Criterion B2: Algorithms due Thursday (1/13/11)<br />
** [[Media:CriterionB2 algorithms.doc]]<br />
* Errors!<br />
** [[Media:Errors.ppt]]<br />
* Introduction to Boolean Logic<br />
** [[Media:BooleanLogic.ppt]]<br />
<br />
== Friday (1/7/11) ==<br />
* 2nd Quarter Exam<br />
* Complete your dossier code<br />
<br />
== Monday - Wednesday (1/3/11 - 1/5/11) ==<br />
'''Warmup:'''<br />
* Convert from hexadecimal to binary: ADD0BEEF<br />
* Convert from binary to hexadecimal: 111001011100000011011101<br />
* Assume 8-bit sign-magnitude, convert -13 from decimal to binary<br />
* Assume 8-bit 2's complement, convert -20 from decimal to binary<br />
<br />
'''Agenda:'''<br />
* [https://spreadsheets.google.com/viewform?formkey=dHlCd2dMOGxMc29VU1VuakVDOW5fSHc6MQ Dossier Progress Check]<br />
<br />
* 2nd Quarter Exam will be Friday (1/7/11)!<br />
** Basic Java programming<br />
** Stacks<br />
** Queues<br />
** Linked Lists<br />
** Binary Trees<br />
** Software Development<br />
** Big-O algorithm evaluation<br />
** Binary<br />
** Hexadecimal<br />
** Binary Addition<br />
** Sign-Magnitude Negative Binary Numbers<br />
** 2's Complement Negative Binary Numbers<br />
** Binary Subtraction (same as Binary Addition but with 2's complement negative)<br />
<br />
* So what the heck does '''digital''' mean?<br />
** [[Media:AnalogDigital.ppt]]<br />
<br />
* Go through your dossier code and clean it up according to "Good Programming Style"<br />
* C1: Good Programming Style - [[Media:CriterionC1_goodProgrammingStyle.doc]]</div>Admin