https://www.paulbui.net/wiki/index.php?action=history&feed=atom&title=IBCS2_-_0809_-_SeptemberIBCS2 - 0809 - September - Revision history2026-04-30T14:26:50ZRevision history for this page on the wikiMediaWiki 1.31.8https://www.paulbui.net/wiki/index.php?title=IBCS2_-_0809_-_September&diff=4329&oldid=prevAdmin at 17:46, 29 October 20092009-10-29T17:46:49Z<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr class="diff-title" lang="en">
<td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 17:46, 29 October 2009</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1" >Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del class="diffchange diffchange-inline"><!--</del></div></td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div> </div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== Monday - Tuesday (9/29/08 - 9/30/08) ==</div></td><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== Monday - Tuesday (9/29/08 - 9/30/08) ==</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>* Evaluate draft "Analysis of the Problem"</div></td><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>* Evaluate draft "Analysis of the Problem"</div></td></tr>
<tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l215" >Line 215:</td>
<td colspan="2" class="diff-lineno">Line 215:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>* Program dossier introduction</div></td><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>* Program dossier introduction</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>** [http://www.ib-computing.com/java/dossier/choices.html IB Computing Dossier suggestions]</div></td><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>** [http://www.ib-computing.com/java/dossier/choices.html IB Computing Dossier suggestions]</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">--></del></div></td><td colspan="2"> </td></tr>
</table>Adminhttps://www.paulbui.net/wiki/index.php?title=IBCS2_-_0809_-_September&diff=4049&oldid=prevAdmin: Protected "IBCS2 - 0809 - September" [edit=sysop:move=sysop]2009-10-21T18:23:14Z<p>Protected "<a href="/wl/IBCS2_-_0809_-_September" title="IBCS2 - 0809 - September">IBCS2 - 0809 - September</a>" [edit=sysop:move=sysop]</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 18:23, 21 October 2009</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_-_0809_-_September&diff=3997&oldid=prevAdmin: New page: <!-- == Monday - Tuesday (9/29/08 - 9/30/08) == * Evaluate draft "Analysis of the Problem" * Turn in "Analysis of the Problem" * Demo StringBinarySearch.java by the end of Wednesday * Demo...2009-10-21T15:38:20Z<p>New page: <!-- == Monday - Tuesday (9/29/08 - 9/30/08) == * Evaluate draft "Analysis of the Problem" * Turn in "Analysis of the Problem" * Demo StringBinarySearch.java by the end of Wednesday * Demo...</p>
<p><b>New page</b></p><div><!--<br />
== Monday - Tuesday (9/29/08 - 9/30/08) ==<br />
* Evaluate draft "Analysis of the Problem"<br />
* Turn in "Analysis of the Problem"<br />
* Demo StringBinarySearch.java by the end of Wednesday<br />
* Demo AddressBook's selectionSort() and bubbleSort() by the end of Wednesday<br />
* Register for a [http://www.turingscraft.com turingscraft] account using TC-0483-0 as the section code.<br />
** Test the interface and attempt the first several problems<br />
<br />
== Friday (9/26/08) ==<br />
* Reminder: 1st draft of "Analysis of the Problem" due on Monday!!!<br />
<br />
* Sorting & Searching Review<br />
** Selection Sort<br />
** Bubble Sort<br />
** Linear Search<br />
** Binary Search<br />
* Examples of using the String.compareTo() method<br />
** [[Media:CompareToDemo.java]]<br />
** [[Media:CompareToDemo2.java]]<br />
* Fix [[Media:StringBinarySearch.java]] such that it uses binary search to find a String. Hint: You will be using the compareTo()<br />
* Demo StringBinarySearch to Mr. Bui by the end of today.<br />
<br />
* You should then add selectionSort() to your AddressBook class. It sorts your AddressBook Contact array by last name using the selection sort algorithm. You may assume that everybody will have a different last name.<br />
* You should then add bubbleSort() to your AddressBook class. It sorts your AddressBook Contact array by last name using the bubble sort algorithm. You may assume that everybody will have a different last name.<br />
* Demo the two sorting methods to Mr. Bui by the end of Monday.<br />
<br />
== Thursday (9/25/08) ==<br />
* Introduction to Linear Search<br />
* Download [[Media:LinearSearch.java]]<br />
* Fill in the commented parts of LinearSearch.java and demo a working linear search to Mr. Bui<br />
* Linear Search performance evaluation<br />
# What is the best case scenario? i.e. What is the minimum # of comparisons?<br />
# What is the worst case scenario? i.e. What is the maximum # of comparisons?<br />
# What is the average # of comparisons?<br />
# Can we do better than a linear search?<br />
<br />
* Introduction to Binary Search<br />
# Assume sorted list<br />
# Go to the middle point<br />
# If the middle element matches the key, then the search is over<br />
# If the key is less than middle element, go to the left (down), else go to the right (up)<br />
# Repeat steps 2-4 until the key is found or when the left and right bounds pass each other<br />
<br />
* [http://euler.slu.edu/~goldwasser/demos/BinarySearch/ Binary Search Demo]<br />
* [http://www.cosc.canterbury.ac.nz/people/mukundan/dsal/BSearch.html Binary Search Demo2]<br />
* [[Media:BinarySearch.java]]<br />
* Binary Search performance evaluation<br />
# What is the best case scenario? i.e. What is the minimum # of comparisons?<br />
# What is the worst case scenario? i.e. What is the maximum # of comparisons?<br />
# What is the average # of comparisons?<br />
* Binary Search Advantages & Disadvantages<br />
<br />
== Wednesday (9/24/08) ==<br />
* Demo missing assignments<br />
* Dossier<br />
** Past examples<br />
** Work on your Analysis of the Problem section<br />
<br />
== Back to School Night ==<br />
* [[Media:B2snIBCS2.ppt]]<br />
<br />
== Monday - Tuesday (9/22/08 - 9/23/08) ==<br />
'''Warmup:'''<br />
* Assume you have the following integers: 5, 2, 3, 8, 4<br />
* What are the steps to selection sort the integers? Show the movement of the integers.<br />
* '''What are the steps to bubble sort the integers? Show the movement of the integers.'''<br />
<br />
'''Agenda:'''<br />
* Demo SelectionSort.java to Mr. Bui<br />
* Introduction to Bubble Sort<br />
# Initialize the front to be the top or beginning of the array<br />
# Now go to the bottom/end of the array<br />
# Compare the two adjacent elements to see if they are in proper sequential order<br />
## Swap the elements if they are out of order (bigger number to the left of smaller number)<br />
# Move to the next pair of adjacent elements/numbers<br />
# Repeat steps 3 and 4 until the smallest number has "floated" to the top/front<br />
# After you traverse the entire array<br />
## Move the front so that the sorted numbers are ignored<br />
## Go back to the end of the array<br />
## Repeat steps 2 through 6 for the unsorted part of the array<br />
* [http://web.engr.oregonstate.edu/~minoura/cs162/javaProgs/sort/BubbleSort.html Bubble Sort Animation]<br />
* Download [[Media:BubbleSort.java]]<br />
** Fill in the commented parts of the BubbleSort.java file. Where there is a comment, you need to write code.<br />
** Demo to Mr. Bui at the end of class or at the beginning of class tomorrow<br />
* Introduction to Program Dossier<br />
** [[Media:CriterionA1_problemAnalysis.doc]]<br />
** 1st rough draft of Analysis of the Problem due Monday (9/29/08)<br />
<br />
'''Assignment:'''<br />
* Verify that you have Java and JCreator installed on your home computer.<br />
<br />
== Friday (9/19/08) ==<br />
* Introduction to Selection Sort<br />
# Find the smallest element<br />
# Move to the front of the array (swap with front)<br />
# Repeat Steps 1&2, but ignoring the sorted front<br />
* [http://web.engr.oregonstate.edu/~minoura/cs162/javaProgs/sort/SelectSort.html Selection Sort Animation]<br />
* [http://www.cs.ust.hk/faculty/tcpong/cs102/summer96/aids/select.html Another Selection Sort Animation]<br />
* Download [[Media:SelectionSort.java]]<br />
** Fill in the commented parts of the SelectionSort.java file. Where there is a comment, you need to write code.<br />
** Demo to Mr. Bui at the end of class or at the beginning of class on Monday<br />
<br />
== Wednesday - Thursday (9/17/08 - 9/18/08) ==<br />
'''Agenda:'''<br />
* [[AddressBook class lab assignment]] is due at the end of the day tomorrow.<br />
* Your AddressBook demo should use the menu system you created in the warmup yesterday<br />
** When the user selects to ADD a Contact, you should prompt them for a first name, last name, phone, and address.<br />
** You should then create a new Contact<br />
** Add the Contact to your AddressBook using the AddressBook's add() method<br />
* The PRINT menu choice should print the entire AddressBook using the print() method<br />
* Make sure your menu runs again after the user makes a choice (HINT: use a loop somewhere)<br />
<br />
== Tuesday (9/16/08) ==<br />
'''Warmup:'''<br />
* You will be creating a user interface menu for use with your AddressBook<br />
* Open / create your AddressBook's main method<br />
* Print out a message that explains the program (e.g. "Welcome to YOUR_NAME's address book!")<br />
* Print out a menu with the following options:<br />
<br />
<pre><br />
(a)dd to address book<br />
(p)rint address book<br />
(q)uit<br />
<br />
What would you like to do? <br />
</pre><br />
<br />
* You should prompt for input after the menu is printed. Review [[Media:JavaIOExample.java]] for examples of input/output<br />
* If the user inputs 'a', then print a message that says "USER SELECTED ADD"<br />
* If the user inputs 'p', then print a message that says "USER SELECTED PRINT"<br />
* If the user inputs 'q', then print a message that says "USER SELECTED QUIT"<br />
<br />
'''Agenda:'''<br />
* Demo JCreator<br />
* Add a String address attribute to your Contact class<br />
* Demo your Person, Car, and Contact classes to Mr. Bui (LATE)<br />
* [[AddressBook class lab assignment]]<br />
<br />
== Monday (9/15/08) ==<br />
* Demo your Person, Car, and Contact classes to Mr. Bui<br />
* AddressBook overview<br />
* [[AddressBook class lab assignment]]<br />
<br />
== Wednesday - Friday (9/10/08 - 9/12/08) ==<br />
* Receive textbooks<br />
** Write your name on the inside cover<br />
** Tell Mr. Bui your number<br />
* Demo to Mr. Bui your Person, Car, and Contact classes<br />
* Complete Lab 14 in [http://www.eimacs.com eimacs]<br />
* Complete Test 12 in [http://www.eimacs.com eimacs]<br />
<br />
== Monday - Tuesday (9/8/08 - 9/9/08) ==<br />
<br />
'''Agenda'''<br />
* [[Media:IntroClasses.ppt]]<br />
* [[Person class lab assignment]]<br />
* [[Car class lab assignment]]<br />
* [[Contact class lab assignment]]<br />
<br />
== Friday (9/5/08) ==<br />
'''Warmup'''<br />
Determine whether or not each of the following lines result in ''x'' evaluating ''true'' or ''false'':<br />
<br />
<source lang="java" line><br />
boolean x;<br />
x = 50 > 20;<br />
x = !x;<br />
x = true && false;<br />
x = false || false;<br />
x = false || false || false || false || false || true;<br />
x = true && true && true && false;<br />
x = x || !x;<br />
x = x && !x;<br />
</source><br />
<br />
'''Agenda'''<br />
* A gentle re-introduction to Java<br />
** [[Media:IntroJava.ppt]]<br />
** [[Media:IntroJava2.ppt]]<br />
** [[Media:IntroClasses.ppt]]<br />
** [[Media:IntroObjects.ppt]]<br />
** JCreator Demo<br />
** [[Person class lab assignment]]<br />
<br />
'''Assignment'''<br />
* [[How to install Java on Windows]]<br />
* [[How to install JCreator]]<br />
* Test your Java and JCreator installs by creating, compiling, and executing a Hello, World! program<br />
<br />
== Tuesday - Thursday (9/2/08 - 9/4/08) ==<br />
* Introductions<br />
* Syllabus<br />
* Name cards<br />
* Lab setup/config<br />
* [http://spreadsheets.google.com/viewform?key=p6_k1SMbS2zvMHJNJBBkFPA Student Survey]<br />
** Fill out and submit<br />
** Share several snippets with class<br />
* On-line Resources<br />
** [http://www.paulbui.net/wl/cs2 Old IBCS2 website]<br />
** [http://www.eimacs.com EIMACS] - test your login<br />
** [http://www.turingscraft.com Turingscraft] - login coming soon!<br />
* Java Review<br />
# Write a Hello, world! program ( Hint: [[Java program template]] )<br />
## Create a new Java program using JEdit or whatever editor you prefer<br />
## Use the Java program template as a guide<br />
## Insert your code<br />
## Compile and execute your code<br />
### Open terminal<br />
### Navigate to your Java file<br />
### ''javac FILENAME''<br />
### Execute your code: ''java PROGRAM_NAME''<br />
# Write a program that prints Hello, world 20 times<br />
# Write a program that prints Hello, world infinite times<br />
* Program dossier introduction<br />
** [http://www.ib-computing.com/java/dossier/choices.html IB Computing Dossier suggestions]<br />
--></div>Admin