<?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_-_1920_-_November</id>
	<title>APCS - 1920 - 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_-_1920_-_November"/>
	<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=APCS_-_1920_-_November&amp;action=history"/>
	<updated>2026-08-16T18:09:44Z</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_-_1920_-_November&amp;diff=16043&amp;oldid=prev</id>
		<title>Admin: Protected &quot;APCS - 1920 - 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_-_1920_-_November&amp;diff=16043&amp;oldid=prev"/>
		<updated>2019-12-03T15:17:57Z</updated>

		<summary type="html">&lt;p&gt;Protected &amp;quot;&lt;a href=&quot;/wl/APCS_-_1920_-_November&quot; title=&quot;APCS - 1920 - November&quot;&gt;APCS - 1920 - 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 15:17, 3 December 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_-_1920_-_November&amp;diff=16042&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;== Wednesday - Friday (11/27/19 - 11/29/19) == * Thanksgiving Break  == Tuesday (11/26/19) == &#039;&#039;&#039;Warmup:&#039;&#039;&#039; * Complete the Java Methods Review Worksheet in Canvas  &#039;&#039;&#039;Agenda:&#039;...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=APCS_-_1920_-_November&amp;diff=16042&amp;oldid=prev"/>
		<updated>2019-12-03T15:17:49Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;== Wednesday - Friday (11/27/19 - 11/29/19) == * Thanksgiving Break  == Tuesday (11/26/19) == &amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039; * Complete the Java Methods Review Worksheet in Canvas  &amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== Wednesday - Friday (11/27/19 - 11/29/19) ==&lt;br /&gt;
* Thanksgiving Break&lt;br /&gt;
&lt;br /&gt;
== Tuesday (11/26/19) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Warmup:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Complete the Java Methods Review Worksheet in Canvas&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Complete all missing assignments&lt;br /&gt;
* Convert the following to methods (repl.its coming soon)&lt;br /&gt;
** double sum(double[] nums) - returns the sum of the nums array&lt;br /&gt;
** double min(double[] nums) - returns the minimum element from the nums array&lt;br /&gt;
** double max(double[] nums) - returns the maximum element from the nums array&lt;br /&gt;
** int linearSearch(double[] nums, double key) - returns the index of the element matching key from the nums array, return -1 if not found (uses linear/sequential search algorithm)&lt;br /&gt;
** int binarySearch(double[] nums, double key) - returns the index of the element matching key from the nums array, return -1 if not found (uses binary search algorithm)&lt;br /&gt;
*** Be sure to sort the array at the beginning of the method (Hint: How did Mr. Bui do this in the repl.it assignment?)&lt;br /&gt;
* Java Methods &amp;amp; Strings quiz on &amp;#039;&amp;#039;&amp;#039;Tuesday (12/3/19)&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
== Friday (11/22/19) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* AP Classroom: Unit 3 &amp;amp; Unit 4&lt;br /&gt;
** If you did not score in the green, then you will be re-assigned the questions next week&lt;br /&gt;
** Take some time to go over your results and your questions&lt;br /&gt;
* break keyword&lt;br /&gt;
* Introduction/Review of [https://docs.google.com/presentation/d/1L-tbBp51YuUoTWldXFBr6JGcyHF5sBy_flfPGiqlVAQ/edit?usp=sharing Methods]&lt;br /&gt;
** Methods examples&lt;br /&gt;
** return keyword&lt;br /&gt;
** static vs. non-static methods&lt;br /&gt;
* Complete Activity 11&lt;br /&gt;
* Complete Test 10&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Homework:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Complete any missing assignments or assignments that you did not finish in class&lt;br /&gt;
&lt;br /&gt;
== Wednesday (11/20/19) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* [https://www.youtube.com/user/udiprod More Sorting Videos]&lt;br /&gt;
* Complete Insertion sort repl.it&lt;br /&gt;
* Complete the AP Classroom Progress Checks (these are timed!)&lt;br /&gt;
** Unit 3 (Boolean Expressions and if Statements) - 47 minutes&lt;br /&gt;
** Unit 4 (Iteration) - 41 minutes&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Homework:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Complete any assignments that you did not complete in class&lt;br /&gt;
&lt;br /&gt;
== Monday (11/18/19) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* For loops quiz&lt;br /&gt;
* [https://docs.google.com/presentation/d/1Y5JOINM2w744nqimZf2iVuFpi6N6gM2B7GM4ArGjChQ/edit?usp=sharing Sorting slides]&lt;br /&gt;
** Selection sort review&lt;br /&gt;
** Bubble sort walk-through&lt;br /&gt;
** Complete the Bubble sort repl.it&lt;br /&gt;
* Insertion sort&lt;br /&gt;
** Complete the insertion sort repl.it&lt;br /&gt;
&lt;br /&gt;
== Thursday (11/14/19) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Missing repl.its&lt;br /&gt;
* Enhanced for loop (for &amp;quot;each&amp;quot; loop / for &amp;quot;each &amp;amp; every&amp;quot; loop) review&lt;br /&gt;
** Examples and common pitfalls&lt;br /&gt;
** Complete the for loop vs enhanced for loop assignment in Canvas&lt;br /&gt;
* Test 9 questions?&lt;br /&gt;
* For loops (both types) quiz on &amp;#039;&amp;#039;&amp;#039;Monday (11/18/19)&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 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;
== Tuesday (11/12/19) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* for loop review&lt;br /&gt;
* Complete the 6 for loop repl.its:&lt;br /&gt;
** for loop - Linear Search (try attempting without looking at your previous code)&lt;br /&gt;
** for loop - Find Min/Max (try attempting without looking at your previous code)&lt;br /&gt;
** for loop - Binary Search (try attempting without looking at your previous code)&lt;br /&gt;
** for loop - Count Words&lt;br /&gt;
** for loop - double[] Average&lt;br /&gt;
** for loop - Reverse String Print&lt;br /&gt;
* Enhanced for loop&lt;br /&gt;
** Examples and common pitfalls&lt;br /&gt;
** Complete the for loop vs enhanced for loop assignment in Canvas&lt;br /&gt;
* Complete eIMACS: Test 9&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Homework:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Complete the for loop repl.it exercises if you did not do so in class&lt;br /&gt;
* Complete Test 9 if you did not do so in class&lt;br /&gt;
* Read eIMACS: Methods-&amp;gt;Static Methods before class&lt;br /&gt;
&lt;br /&gt;
== Thursday (11/7/19) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Test 8 Questions?&lt;br /&gt;
* Activity 7 work time - go on to the repl.its if you have already completed these&lt;br /&gt;
* Complete the 3 for loop repl.its:&lt;br /&gt;
** for loop - Count Words&lt;br /&gt;
** for loop - double[] Average&lt;br /&gt;
** for loop - Reverse String Print&lt;br /&gt;
* Enhanced for loop&lt;br /&gt;
** Examples and common pitfalls&lt;br /&gt;
** Complete the for loop vs enhanced for loop assignment in Canvas&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Homework:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Complete any missing assignments above&lt;br /&gt;
&lt;br /&gt;
== Monday (11/4/19) ==&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Agenda:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* Read the eIMACS chapter on for loops&lt;br /&gt;
* Complete Test 8&lt;br /&gt;
* Read the eIMACS chapter on for-each loops&lt;br /&gt;
* Complete Activity 7: Checksums&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>