<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.paulbui.net/wiki/index.php?action=history&amp;feed=atom&amp;title=IBCS2_-_1819_-_October</id>
	<title>IBCS2 - 1819 - October - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.paulbui.net/wiki/index.php?action=history&amp;feed=atom&amp;title=IBCS2_-_1819_-_October"/>
	<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1819_-_October&amp;action=history"/>
	<updated>2026-06-13T08:00:05Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.31.8</generator>
	<entry>
		<id>https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1819_-_October&amp;diff=14896&amp;oldid=prev</id>
		<title>Admin: Protected &quot;IBCS2 - 1819 - October&quot; ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading]</title>
		<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1819_-_October&amp;diff=14896&amp;oldid=prev"/>
		<updated>2018-11-13T15:02:44Z</updated>

		<summary type="html">&lt;p&gt;Protected &amp;quot;&lt;a href=&quot;/wl/IBCS2_-_1819_-_October&quot; title=&quot;IBCS2 - 1819 - October&quot;&gt;IBCS2 - 1819 - October&lt;/a&gt;&amp;quot; ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading]&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: #fff; color: #222; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: #fff; color: #222; text-align: center;&quot;&gt;Revision as of 15:02, 13 November 2018&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-notice&quot; lang=&quot;en&quot;&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
	<entry>
		<id>https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1819_-_October&amp;diff=14894&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;== Tuesday (10/30/18) == &#039;&#039;&#039;Agenda:&#039;&#039;&#039; * Turn in Group 4 Project Permission slip * Turn in Dual Enrollment form * Create a demonstration program for your sort() and shuffle()...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1819_-_October&amp;diff=14894&amp;oldid=prev"/>
		<updated>2018-11-13T15:02:06Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;== Tuesday (10/30/18) == &amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039; * Turn in Group 4 Project Permission slip * Turn in Dual Enrollment form * Create a demonstration program for your sort() and shuffle()...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== Tuesday (10/30/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Turn in Group 4 Project Permission slip&lt;br /&gt;
* Turn in Dual Enrollment form&lt;br /&gt;
* Create a demonstration program for your sort() and shuffle() methods&lt;br /&gt;
* Poker Hand Methods w/ arrays&lt;br /&gt;
** int getHighCardValue(Card[] cards)&lt;br /&gt;
*** returns the value of the highest Card (Hint: Use find maximum algorithm)&lt;br /&gt;
** boolean checkPair(Card[] cards)&lt;br /&gt;
*** returns true if any two Cards have the same value, false otherwise&lt;br /&gt;
*** You may want to sort the cards before you look for a pair of matching cards&lt;br /&gt;
** boolean checkTwoPair(Card[] cards)&lt;br /&gt;
*** returns true if there are two pairs of Cards have the same value, false otherwise&lt;br /&gt;
*** You may want to sort the cards before you look for two pair&lt;br /&gt;
** boolean checkThreeOfAKind(Card[] cards)&lt;br /&gt;
*** returns true if there are three Cards have the same value, false otherwise&lt;br /&gt;
*** You may want to sort the cards before you look for three of a kind&lt;br /&gt;
** Continue implementing boolean check methods for the other poker hands:&lt;br /&gt;
*** straight, flush, full house, four of a kind, straight flush, royal flush&lt;br /&gt;
*** Hint: You can actually use some method calls to the other methods in several of the method definitions (e.g. You can call checkStraight() and checkFlush() to make checkStraightFlush() easier)&lt;br /&gt;
&lt;br /&gt;
== Friday (10/26/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Group 4 Project permission slips!&lt;br /&gt;
* Check if you have NetBeans and JGrasp installed...we will be starting to use them more&lt;br /&gt;
* Complete [[Card class lab assignment]] (tests can be found via repl.it)&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Class Construction Quiz&lt;br /&gt;
* Intro Poker Hand Methods&lt;br /&gt;
** int getHighCardValue(Card c0, Card c1, Card c2, Card, c3, Card c4)&lt;br /&gt;
*** returns the value of the highest Card&lt;br /&gt;
** Do not continue with the other poker hand methods like above b/c we will be making new versions using arrays!&lt;br /&gt;
* Introduction to Arrays of Objects&lt;br /&gt;
** Walkthrough -- take notes!  Pay attention!&lt;br /&gt;
* Basic Card[] methods - implement the following, test, and demo for credit&lt;br /&gt;
** void printCards(Card[] cards) - we will do this one together&lt;br /&gt;
*** Use a for loop to iterate through all the cards, and print them to the screen&lt;br /&gt;
** void shuffle(Card[] cards)&lt;br /&gt;
**# Write a for loop that runs a bunch of times (e.g. 10000)&lt;br /&gt;
**# Generate two random numbers from 0 to the length of cards&lt;br /&gt;
**# Swap the cards at the locations of the two random numbers&lt;br /&gt;
** void sort(Card[] cards)&lt;br /&gt;
*** Implement either selection sort or bubble sort to sort your Card[] array.  You can literally copy and paste your sorting code from before, and then tweak it to use the value of the cards (i.e. getValue())&lt;br /&gt;
*** You should be able to test your code by generating a bunch of cards, sorting it, and then printing it out.  They should display in order of value.&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Homework:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Implement the sort() and shuffle() methods for Card[]&lt;br /&gt;
&lt;br /&gt;
== Wednesday (10/24/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Make sure you&amp;#039;ve completed all the class construction assignments in Repl.it&lt;br /&gt;
* Make sure you&amp;#039;ve installed NetBeans&lt;br /&gt;
* [[Card class lab assignment]]&lt;br /&gt;
* We will create poker hand methods to determine whether or not a Card[5] array contains a particular poker hand&lt;br /&gt;
* Quiz on Friday on class construction&lt;br /&gt;
** How do you study for this quiz?  Do all the class construction homework...duh&lt;br /&gt;
&lt;br /&gt;
== Monday (10/22/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Complete Point class assignment in repl.it&lt;br /&gt;
* [[Car class lab assignment]] - submit for testing in repl.it&lt;br /&gt;
* [[Vector class lab assignment]] - submit for testing in repl.it&lt;br /&gt;
&lt;br /&gt;
== Thursday (10/18/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Go to your App Catalog and look for NetBeans -- is it there?&lt;br /&gt;
* Demo Mosaic and Pointilism assignment(s) today&lt;br /&gt;
* Java Objects Slides&lt;br /&gt;
** [https://docs.google.com/presentation/d/1hb_8wMUlQQl7W-JF2f3gax021yDHLkLENJYy0fUMGy8/edit?usp=sharing Classes (Java) slides]&lt;br /&gt;
** [https://docs.google.com/presentation/d/1ks5B3fsnGCX_utk_Adxt1cQtPtUsNtNVENb9swCaHpo/edit?usp=sharing Object Usage (Java) slides]&lt;br /&gt;
** [https://docs.google.com/presentation/d/1Vq2mTZRJIBkwpsHqFmKRICpUOoqOOSKSyRKWMGKZovY/edit?usp=sharing Object-Oriented Programming (Java) slides]&lt;br /&gt;
* Point class assignment - complete in NetBeans or repl.it (*must* submit to repl.it for auto-testing)&lt;br /&gt;
*# You will create two java files: &amp;#039;&amp;#039;&amp;#039;Point.java&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;Main.java&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
*#* &amp;#039;&amp;#039;&amp;#039;Point.java&amp;#039;&amp;#039;&amp;#039; - the Point class definition will be here&lt;br /&gt;
*#* &amp;#039;&amp;#039;&amp;#039;Main.java&amp;#039;&amp;#039;&amp;#039; - only the main() method will be located here&lt;br /&gt;
*# Declare and initialize the following &amp;#039;&amp;#039;&amp;#039;private&amp;#039;&amp;#039;&amp;#039; attributes in the Point class&lt;br /&gt;
*#* double x = 0.0&lt;br /&gt;
*#* double y = 0.0&lt;br /&gt;
*# Define two Point() constructors:&lt;br /&gt;
*#* default constructor: Point()&lt;br /&gt;
*#* specific constructor Point(double newX, double newY)&lt;br /&gt;
*# Define the following &amp;#039;&amp;#039;&amp;#039;public&amp;#039;&amp;#039;&amp;#039; methods in the Point class&lt;br /&gt;
*#* double getX() - returns the x-coordinate&lt;br /&gt;
*#* double getY() - returns the y-coordinate&lt;br /&gt;
*#* void setX(double newX) - sets the x-coordinate to the new x-coordinate parameter&lt;br /&gt;
*#* void setY(double newY) - sets the y-coordinate to the new y-coordinate parameter&lt;br /&gt;
*#* String toString() - returns a String representation of the Point object&lt;br /&gt;
*# Go to your Main.java file to test out your Point class&lt;br /&gt;
*# In the main method, create several new instances of Point objects&lt;br /&gt;
*# Print out each of your Point objects&lt;br /&gt;
*# Define a static method in Main.java named &amp;#039;&amp;#039;&amp;#039;double slope(Point p1, Point p2)&amp;#039;&amp;#039;&amp;#039; - returns the slope between p1 and p2&lt;br /&gt;
*# Test and print out your slope method when you use it with your instantiated Point objects in the main() method&lt;br /&gt;
* More Java class assignments - complete in NetBeans or repl.it (*must* submit to repl.it for auto-testing)&lt;br /&gt;
** Mr. Bui is still in the process of creating the repl.it test cases&lt;br /&gt;
** [[Car class lab assignment]]&lt;br /&gt;
** [[Vector class lab assignment]]&lt;br /&gt;
&lt;br /&gt;
== Tuesday (10/16/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Creating a blank image and manipulating the pixels&lt;br /&gt;
*# Rotate 90 degrees clockwise&lt;br /&gt;
* Complete and demo the following image processing assignments:&lt;br /&gt;
*# Rotate 90 degrees clockwise of a non-square image (no animation needed)&lt;br /&gt;
*# Mosaic (no animation needed)&lt;br /&gt;
*## Take an image, sample every (10th row, 10th col) pixel&amp;#039;s color&lt;br /&gt;
*## Draw a 10x10 square using the sampled pixel&amp;#039;s color at ever 10th (x,y)&lt;br /&gt;
*## You should display both the original image and its mosaic&lt;br /&gt;
*# Pointilism Animation&lt;br /&gt;
*## This will be an animation&lt;br /&gt;
*## Within setup(), load an image, load its pixels, and turn off line strokes&lt;br /&gt;
*## Within draw(), generate a random index number from 0 to image&amp;#039;s pixel length (use [https://processing.org/reference/random_.html random()])&lt;br /&gt;
*##* int rand = (int) random(0, img.pixels.length);&lt;br /&gt;
*## Sample the color of the pixel from the random index and fill with the color&lt;br /&gt;
*## Calculate the appropriate (x,y) from the random index (Hint: use modulus (%) for x and division (/) for y)&lt;br /&gt;
*## Draw the circle at its appropriate (x,y) using a random diameter from (5, 15)&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Homework:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* All of the image processing assignments are due Thursday (10/18/18)&lt;br /&gt;
&lt;br /&gt;
== Tuesday - Friday (10/9/18 - 10/12/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Demo [[Media:BubbleSort.java]]&lt;br /&gt;
* Algorithms Identification Quiz in Canvas&lt;br /&gt;
* Reference variables overview&lt;br /&gt;
* Two-Dimensional Arrays and Nested Loops&lt;br /&gt;
*# Accessing all of the individual elements of a two-dimensional list&lt;br /&gt;
*# Prompt the user to construct a two-dimensional list&lt;br /&gt;
*## Prompt for the number of rows&lt;br /&gt;
*## Prompt for the number of columns&lt;br /&gt;
*## Prompt the user for each number in the two-dimensional list&lt;br /&gt;
*# Write a method: &amp;#039;&amp;#039;&amp;#039;void matrixPrint(int[][] m)&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
*#* Print each row on a separate line, and each element should be separated by a space&lt;br /&gt;
*#* Complete the method in repl.it&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
*# Write a method (function): &amp;#039;&amp;#039;&amp;#039;double[][] matrixAdd(double[][] m1, double[][] m2)&amp;#039;&amp;#039;&amp;#039; that returns a new matrix that is the sum of m1 and m2&lt;br /&gt;
*#* Be sure to check if the two matrices are the same size (if not, then return null)&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Nested Loops, Processing &amp;amp; Images&lt;br /&gt;
** Processing coordinate system review (print mouse coordinates)&lt;br /&gt;
** Processing PImage object practice&lt;br /&gt;
** [https://www.processing.org/tutorials/pixels/ Processing: Images &amp;amp; Pixels Tutorial]&lt;br /&gt;
** As a class, we&amp;#039;ll walk through several of the examples from the tutorial above, and we&amp;#039;ll modify each slightly&lt;br /&gt;
* Image Processing Exercises?&lt;br /&gt;
*# Convert to black and white&lt;br /&gt;
*# Rotate image 90 degrees&lt;br /&gt;
*# Flip vertical&lt;br /&gt;
*# Flip horizontal&lt;br /&gt;
*# Pointilism&lt;br /&gt;
*# Mosaic&lt;br /&gt;
*# Edge detection?&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Homework Challenge:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Try to complete the rotate 90 degrees image challenge&lt;br /&gt;
&lt;br /&gt;
== Thursday (10/4/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Make sure you&amp;#039;ve completed Selection Sort in repl.it&lt;br /&gt;
** Mr. Bui will be manually looking at your repl.it submissions too&lt;br /&gt;
* Take the Sorting Identification Quiz in Canvas&lt;br /&gt;
** The access code is ...&lt;br /&gt;
* Bubble sort review&lt;br /&gt;
* Complete and demo [[Media:BubbleSort.java]]&lt;br /&gt;
&lt;br /&gt;
== Tuesday (10/2/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Take the Abstract Data Structures Pre-assessment on Canvas&lt;br /&gt;
** Do not guess answers, skip them if you do not know the answer&lt;br /&gt;
* Complete the Find Minimum &amp;amp; Maximum repl.it&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Group sorting activity&lt;br /&gt;
*# Form 3-4 person groups&lt;br /&gt;
*# Receive playing cards&lt;br /&gt;
*# With your group, document an algorithm (steps) of how you sort the cards out&lt;br /&gt;
* Introduction to Sorting&lt;br /&gt;
** [https://docs.google.com/presentation/d/1Y5JOINM2w744nqimZf2iVuFpi6N6gM2B7GM4ArGjChQ/edit?usp=sharing Sorting slides]&lt;br /&gt;
* Selection sort assignment in repl.it&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>