<?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_-_1516_-_October</id>
	<title>IBCS2 - 1516 - 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_-_1516_-_October"/>
	<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1516_-_October&amp;action=history"/>
	<updated>2026-04-11T00:49:18Z</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_-_1516_-_October&amp;diff=12801&amp;oldid=prev</id>
		<title>Admin: Protected &quot;IBCS2 - 1516 - October&quot; ([edit=sysop] (indefinite) [move=sysop] (indefinite)) [cascading]</title>
		<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1516_-_October&amp;diff=12801&amp;oldid=prev"/>
		<updated>2016-02-22T16:18:15Z</updated>

		<summary type="html">&lt;p&gt;Protected &amp;quot;&lt;a href=&quot;/wl/IBCS2_-_1516_-_October&quot; title=&quot;IBCS2 - 1516 - October&quot;&gt;IBCS2 - 1516 - October&lt;/a&gt;&amp;quot; ([edit=sysop] (indefinite) [move=sysop] (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 16:18, 22 February 2016&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_-_1516_-_October&amp;diff=12798&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;== Thursday (10/29/15) == &#039;&#039;&#039;Warmup:&#039;&#039;&#039; * List the typical stack operations * Be able to describe what they do  &#039;&#039;&#039;Agenda:&#039;&#039;&#039; * Stack review * Complete static-sized Stack class w...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1516_-_October&amp;diff=12798&amp;oldid=prev"/>
		<updated>2016-02-22T16:14:11Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;== Thursday (10/29/15) == &amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039; * List the typical stack operations * Be able to describe what they do  &amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039; * Stack review * Complete static-sized Stack class w...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== Thursday (10/29/15) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* List the typical stack operations&lt;br /&gt;
* Be able to describe what they do&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Stack review&lt;br /&gt;
* Complete static-sized Stack class walk-through&lt;br /&gt;
** Implement a Stack using a static data structure (e.g. array)&lt;br /&gt;
** Test out our implementation to find weaknesses&lt;br /&gt;
** Fix the weaknesses in our implementation&lt;br /&gt;
* Queues - [[Media:Queues.ppt]]&lt;br /&gt;
* Work on [[Java - Static Queue Assignment]]&lt;br /&gt;
&lt;br /&gt;
== Tuesday - Thursday (10/27/15 - 10/29/15) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Introduction to Stacks - [[Media:Stacks.ppt]]&lt;br /&gt;
** Be able to describe the characteristics of a stack&lt;br /&gt;
** Be able to explain the operations of a stack&lt;br /&gt;
** Be able to describe different stack applications&lt;br /&gt;
** If given a list or an array, be able to explain their use as stacks&lt;br /&gt;
* [https://www.cs.usfca.edu/~galles/visualization/Algorithms.html Data Structure Visualizations]&lt;br /&gt;
* Practice Stack Exercises&lt;br /&gt;
*# Push the following words onto a stack: &amp;quot;Washington-Lee&amp;quot;, &amp;quot;Generals&amp;quot;, &amp;quot;Computer&amp;quot;, &amp;quot;Science&amp;quot;.  What will the words be in the order of popping them all.&lt;br /&gt;
*# Imagine that you are stuck in a dungeon. You are using a stack to keep track of your movements so that you can find your way back to the beginning of the dungeon. Diagram the stack after the following moves: forward, left, left, right, forward, forward, right, forward, left. Using your stack, what would the order of moves be to return back to your starting position?&lt;br /&gt;
*# Assume you are given a list of numbers that you can only access one at a time in their order.  Describe how you would use stacks to reverse their order&lt;br /&gt;
* Static-sized Stack class walk-through&lt;br /&gt;
** Implement a Stack using a static data structure (e.g. array)&lt;br /&gt;
** Test out our implementation to find weaknesses&lt;br /&gt;
** Fix the weaknesses in our implementation&lt;br /&gt;
&lt;br /&gt;
== Friday (10/23/15) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* [http://idtus.com/contest/ IDT Programming Contest (Nov - Mar)]&lt;br /&gt;
** Come see Mr. Bui or Eric Weiner if interested&lt;br /&gt;
* [https://projecteuler.net/ Project Euler]&lt;br /&gt;
** If you finish assignments early, you are encouraged to attempt these problems&lt;br /&gt;
* [http://rosalind.info/problems/locations/ Project Rosalind]&lt;br /&gt;
** If you finish assignments early, you are encouraged to attempt these problems &lt;br /&gt;
* Demo [[Vector class lab assignment]]&lt;br /&gt;
&lt;br /&gt;
== Wednesday (10/21/15) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Happy &amp;quot;Back to the Future&amp;quot; Day! (10/21/15)&lt;br /&gt;
* Demo the following:&lt;br /&gt;
** [[Person class lab assignment]]&lt;br /&gt;
** [[Car class lab assignment]]&lt;br /&gt;
** [[Vector class lab assignment]]&lt;br /&gt;
&lt;br /&gt;
== Monday (10/19/15) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Volunteer &amp;amp; job opportunities for juniors or seniors (if interested, come see Mr. Bui):&lt;br /&gt;
** Ms. Carlson (PTA member)&lt;br /&gt;
*** Requirement: HTML skills, general I.T. skills&lt;br /&gt;
*** Paid work on various projects for non-profit clients: voter registration, e-mail broadcasting, fundraising website maintenance, Facebook page maintenance&lt;br /&gt;
** Mr. Goldstein (school board candidate)&lt;br /&gt;
*** Requirement: general I.T. skills&lt;br /&gt;
*** Volunteer work on various I.T. projects: e-mail broadcasting, data entry&lt;br /&gt;
* [http://computer-science.egr.vcu.edu/events/computer-science-day/ VCU Computer Science Day (open house)]&lt;br /&gt;
* Demo the following:&lt;br /&gt;
** [[Person class lab assignment]]&lt;br /&gt;
** [[Car class lab assignment]]&lt;br /&gt;
** [[Vector class lab assignment]]&lt;br /&gt;
&lt;br /&gt;
== Thursday (10/15/15) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Demo any missing assignments to Mr. Bui&lt;br /&gt;
* Complete the Point class definition from last class&lt;br /&gt;
* Define more static methods in PointMain.java:&lt;br /&gt;
** double distance(Point p1, Point p2) - returns distance between p1 and p2&lt;br /&gt;
** Point midPoint(Point p1, Point p2) - returns a new Point, which is the midpoint between p1 and p2&lt;br /&gt;
* Test your new methods in the main().  Demonstrate the tests to Mr. Bui &lt;br /&gt;
* [[Person class lab assignment]]&lt;br /&gt;
* [[Car class lab assignment]]&lt;br /&gt;
* [[Vector class lab assignment]]&lt;br /&gt;
&lt;br /&gt;
== Tuesday (10/13/15) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Demo missing assignments&lt;br /&gt;
* IA Progress Assignment (due tomorrow!) - via [http://classroom.google.com Google Classroom]&lt;br /&gt;
*# You will upload any/all code or tutorial documentation to justify your progress on the Internal Assessment.&lt;br /&gt;
*# You must submit at least 3 artifacts demonstrating Internal Assessment progress for full credit.&lt;br /&gt;
*# You may include screenshots of tutorial completions (e.g. CodeAcademy).&lt;br /&gt;
*# At the top of each file, annotate the code or screenshot, explaining what it is and how it is a reasonable artifact for your Internal Assessment&lt;br /&gt;
*# You may upload multiple files. Be sure to include your name in each document.&lt;br /&gt;
*# LATE submissions will be penalized&lt;br /&gt;
* Java Functions/Methods Review&lt;br /&gt;
** [[Media:JavaMethods.pptx]]&lt;br /&gt;
** Method Definitions&lt;br /&gt;
** Method Return types&lt;br /&gt;
** Method Parameters&lt;br /&gt;
** Method Calls&lt;br /&gt;
* Java Objects&lt;br /&gt;
** [[Media:IntroObjects.ppt]]&lt;br /&gt;
** [[Media:ObjectUsageReview.ppt]]&lt;br /&gt;
** [[Media:ObjectUsageReview2.ppt]]&lt;br /&gt;
** [[Media:IntroClasses.ppt]]&lt;br /&gt;
** [[Media:OOP.pptx‎]]&lt;br /&gt;
* Point Class assignment walk-through&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;PointMain.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;PointMain.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 PointMain.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 PointMain.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;
&lt;br /&gt;
== Thursday (10/8/15) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Demo Two-Dimensional Array Assignment&lt;br /&gt;
&lt;br /&gt;
== Tuesday (10/6/15) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Search and sort quiz&lt;br /&gt;
* Two-Dimensional Array Assignment&lt;br /&gt;
*# Write a function: &amp;#039;&amp;#039;&amp;#039;matrixAdd(a, b)&amp;#039;&amp;#039;&amp;#039; that returns a new matrix that is the sum of a and b&lt;br /&gt;
*#* Be sure to check if the two matrices are the same size (if not, then return &amp;#039;&amp;#039;&amp;#039;null&amp;#039;&amp;#039;&amp;#039;)&lt;br /&gt;
*# Write a function: &amp;#039;&amp;#039;&amp;#039;fliplr(m)&amp;#039;&amp;#039;&amp;#039; that returns a new matrix that is the horizontal flip (left to right) of matrix &amp;#039;&amp;#039;&amp;#039;m&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
*#* [http://www.mathworks.com/help/matlab/ref/fliplr.html MATLAB fliplr() description]&lt;br /&gt;
*# Write a function: &amp;#039;&amp;#039;&amp;#039;flipud(m)&amp;#039;&amp;#039;&amp;#039; that returns a new matrix that is the vertical flip (up to down) of matrix &amp;#039;&amp;#039;&amp;#039;m&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
*#* [http://www.mathworks.com/help/matlab/ref/flipud.html MATLAB flipup() description]&lt;br /&gt;
*# Extra Credit: Write a function: &amp;#039;&amp;#039;&amp;#039;matrixMult(a, b)&amp;#039;&amp;#039;&amp;#039; that returns the product of matrix a and b&lt;br /&gt;
*#* Be sure to check the rules of matrix multiplication&lt;br /&gt;
*#* Return an &amp;#039;&amp;#039;&amp;#039;null&amp;#039;&amp;#039;&amp;#039; matrix if their sizes are different&lt;br /&gt;
* Challenge: Write the function &amp;#039;&amp;#039;&amp;#039;det(m)&amp;#039;&amp;#039;&amp;#039; which returns the determinant of any matrix m&lt;br /&gt;
&lt;br /&gt;
== Friday (10/2/15) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Seniors, please take the [http://goo.gl/forms/HJCeVXyeYs student sociology project survey]&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Demo both selection sort and bubble sort&lt;br /&gt;
* [[Media:Sorting.pptx]]&lt;br /&gt;
* Quicksort discussion&lt;br /&gt;
* Search and sort quiz next Tuesday (10/6/15). Be able to describe the step-by-step algorithm&lt;br /&gt;
** Linear search&lt;br /&gt;
** Binary search&lt;br /&gt;
** Selection sort&lt;br /&gt;
** Bubble sort&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 the function &amp;#039;&amp;#039;&amp;#039;matrixPrint(m)&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Two-Dimensional Array Assignment&lt;br /&gt;
*# Write a function: &amp;#039;&amp;#039;&amp;#039;matrixAdd(m1, 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 &amp;#039;&amp;#039;&amp;#039;null&amp;#039;&amp;#039;&amp;#039;)&lt;br /&gt;
*# Write a function: &amp;#039;&amp;#039;&amp;#039;matrixMult(m1, m2)&amp;#039;&amp;#039;&amp;#039; that returns the product of matrix m1 and m2&lt;br /&gt;
*#* Be sure to check the rules of matrix multiplication&lt;br /&gt;
*#* Return an &amp;#039;&amp;#039;&amp;#039;null&amp;#039;&amp;#039;&amp;#039; matrix if their sizes are different&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>