<?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=APCS_-_1819_-_November</id>
	<title>APCS - 1819 - November - 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=APCS_-_1819_-_November"/>
	<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=APCS_-_1819_-_November&amp;action=history"/>
	<updated>2026-04-11T12:17:55Z</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=APCS_-_1819_-_November&amp;diff=15025&amp;oldid=prev</id>
		<title>Admin: Protected &quot;APCS - 1819 - November&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=APCS_-_1819_-_November&amp;diff=15025&amp;oldid=prev"/>
		<updated>2019-01-07T11:33:16Z</updated>

		<summary type="html">&lt;p&gt;Protected &amp;quot;&lt;a href=&quot;/wl/APCS_-_1819_-_November&quot; title=&quot;APCS - 1819 - November&quot;&gt;APCS - 1819 - November&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 11:33, 7 January 2019&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=APCS_-_1819_-_November&amp;diff=15022&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;== Friday (11/30/18) == &#039;&#039;&#039;Agenda:&#039;&#039;&#039; * Search &amp; Sort Identification Quiz * for loop demos - Practice 1 &amp; 2 * Complete for Loop assignments in Repl.it ** Count Words ** double...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=APCS_-_1819_-_November&amp;diff=15022&amp;oldid=prev"/>
		<updated>2019-01-07T11:32:44Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;== Friday (11/30/18) == &amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039; * Search &amp;amp; Sort Identification Quiz * for loop demos - Practice 1 &amp;amp; 2 * Complete for Loop assignments in Repl.it ** Count Words ** double...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== Friday (11/30/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Search &amp;amp; Sort Identification Quiz&lt;br /&gt;
* for loop demos - Practice 1 &amp;amp; 2&lt;br /&gt;
* Complete for Loop assignments in Repl.it&lt;br /&gt;
** Count Words&lt;br /&gt;
** double[] Average&lt;br /&gt;
** Reverse String Print&lt;br /&gt;
* Introduction to Methods&lt;br /&gt;
** [https://docs.google.com/presentation/d/1L-tbBp51YuUoTWldXFBr6JGcyHF5sBy_flfPGiqlVAQ/edit?usp=sharing Java Methods slides]&lt;br /&gt;
** Java methods examples&lt;br /&gt;
** Complete repl.it methods assignments&lt;br /&gt;
&lt;br /&gt;
== Monday - Wednesday (11/26/18 - 11/28/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Write a program that takes a String input, uses a for loop, and prints every other letter in the string&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* for loop demos - Practice 1:&lt;br /&gt;
*# Monte Carlo Pi&lt;br /&gt;
*# Taylor Series Pi and e&lt;br /&gt;
*# Looping exercises&lt;br /&gt;
* for loop demos - Practice 2:&lt;br /&gt;
*# Linear search&lt;br /&gt;
*# Binary search&lt;br /&gt;
*# Selection sort&lt;br /&gt;
*# Bubble sort&lt;br /&gt;
*# Insertion sort&lt;br /&gt;
* Complete for Loop assignments in Repl.it&lt;br /&gt;
** Count Words&lt;br /&gt;
** double[] Average&lt;br /&gt;
** Reverse String Print&lt;br /&gt;
* Search &amp;amp; Sort Identification Quiz next class&lt;br /&gt;
** If shown the programming code or visualization of a particular algorithm, you can identify its name&lt;br /&gt;
** You may be shown code or visualizations of things that you have not yet learned! You must be able to say that you did not learn it yet&lt;br /&gt;
&lt;br /&gt;
== Monday (11/19/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* for loops quiz at the end of class&lt;br /&gt;
* Prepare to demo for looped version of:&lt;br /&gt;
*# Monte Carlo Pi&lt;br /&gt;
*# Taylor Series Pi and e&lt;br /&gt;
*# Looping exercises&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Repl.it resubmits&lt;br /&gt;
** Binary search incorrect -- please redo and resubmit&lt;br /&gt;
* for Loop Practice 2 - Re-implement the following using for loops:&lt;br /&gt;
** Linear search&lt;br /&gt;
** Binary search&lt;br /&gt;
** Selection sort&lt;br /&gt;
** Bubble sort&lt;br /&gt;
** Insertion sort&lt;br /&gt;
* for loop assignments (repl.it submissions coming...)&lt;br /&gt;
*# Write a program that takes a String input, uses a for loop, counts and displays the total number of spaces&lt;br /&gt;
*# Write a program that takes a double[], uses a for loop, and displays the average value of all elements in the array&lt;br /&gt;
*# Write a program that takes a String input, and displays the entire string reversed (on one line)&lt;br /&gt;
* Have a great Thanksgiving Break!&lt;br /&gt;
&lt;br /&gt;
== Thursday (11/15/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Login to your [https://www.albert.io albert.io] account&lt;br /&gt;
* Join our AP CS A course using: EMVT7IN8APTL&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Java for loops (eIMACS: For Loops)&lt;br /&gt;
*# Write a for loop that prints out 0 to 10 (exclusive)&lt;br /&gt;
*# Write a for loop that prints out 100 to 50 (inclusive)&lt;br /&gt;
*# Write a for loop that prints out the first 10 odd numbers&lt;br /&gt;
* for Loop Practice 1 - Convert the following programs from a while loop to a for loop (due &amp;#039;&amp;#039;&amp;#039;Monday (11/19/18)&amp;#039;&amp;#039;&amp;#039;)&lt;br /&gt;
*# Monte Carlo Pi&lt;br /&gt;
*# Taylor Series Pi and e&lt;br /&gt;
*# Looping exercises&lt;br /&gt;
&lt;br /&gt;
== Tuesday (11/13/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Bubble sort questions?&lt;br /&gt;
** Bubble sort should be done by now&lt;br /&gt;
* NetBeans installation check&lt;br /&gt;
* JGrasp installation check&lt;br /&gt;
* JGrasp canvas visualization practice&lt;br /&gt;
** Simple variables&lt;br /&gt;
** Array&lt;br /&gt;
** Loop&lt;br /&gt;
* Insertion Sort Assignment&lt;br /&gt;
*# Study the insertion sort visualization [https://visualgo.net/bn/sorting VisuAlgo]&lt;br /&gt;
*# What are the major components of the algorithm? (e.g. Loop that iterates through array from beginning to end)  Others?&lt;br /&gt;
*# Implement insertion sort &lt;br /&gt;
*# Create your own data set and demonstrate your code for credit.  Be prepared to be able to explain how your code works&lt;br /&gt;
*# Submit you code via Repl.it&lt;br /&gt;
&lt;br /&gt;
== Wednesday (11/8/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Selection sort assignment in repl.it should be already complete&lt;br /&gt;
* Watch the bubble sort visualization at [https://visualgo.net/bn/sorting VisuAlgo]&lt;br /&gt;
** Watch it multiple times until you have a firm understanding of what is happening&lt;br /&gt;
** You can also read slide 5 about bubble sort in the [https://docs.google.com/presentation/d/1Y5JOINM2w744nqimZf2iVuFpi6N6gM2B7GM4ArGjChQ/edit?usp=sharing Sorting slides]&lt;br /&gt;
* There is a bubble sort repl.it assignment posted with guided comments. Implement bubble sort using the guided comments. You can copy-paste the comments into NetBeans to develop your code. Be sure to submit your finalized code into repl.it for bubble sort&lt;br /&gt;
* Future assignments will implement insertion sort and merge sort algorithms. You are encouraged to watch the [https://visualgo.net/bn/sorting VisuAlgo] visualizations to understand those algorithms&lt;br /&gt;
&lt;br /&gt;
== Monday (11/5/18) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
# Assume you have a given int[] named arr&lt;br /&gt;
# Assume you have two int variables named a and b&lt;br /&gt;
# Write the code that would swap the elements in arr located at indices a and b&lt;br /&gt;
#* e.g. swap the elements arr[a] and arr[b]&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Complete the Find Minimum &amp;amp; Maximum repl.it&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 step-by-step an algorithm (steps) of how you sort the cards out&lt;br /&gt;
*# Every group will share their algorithm in class&lt;br /&gt;
*# Paste your sorting algorithm in this [https://docs.google.com/document/d/1Jh9Uz3FdomH2cB9VKUSTfL_BSluWEoROHmhwbpM_qaA/edit?usp=sharing group document] - Don&amp;#039;t forget to put your names&lt;br /&gt;
* Introduction to Sorting&lt;br /&gt;
** [https://docs.google.com/presentation/d/1Y5JOINM2w744nqimZf2iVuFpi6N6gM2B7GM4ArGjChQ/edit?usp=sharing Sorting slides]&lt;br /&gt;
* Complete Selection sort assignment in repl.it&lt;br /&gt;
&lt;br /&gt;
== Thursday (11/1/18) ==&lt;br /&gt;
* While loops quiz&lt;br /&gt;
* [https://docs.google.com/presentation/d/1GLpwZbqLcyix2WHqS9lLJT3qCeIeWGQ9UDwr6f9VgoE/edit?usp=sharing Search slides]&lt;br /&gt;
** Linear Search&lt;br /&gt;
** Binary Search&lt;br /&gt;
* LS and BS assignments will be posted in Repl.it&lt;br /&gt;
* Complete LS and BS by Monday (11/5/18)&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>