Admin: Protected "APCS - 1920 - October" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading]

2019-11-04T11:11:02Z

Protected "APCS - 1920 - October" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading]

Admin: Created page with "== Thursday (10/31/19) == '''Agenda:''' * 1st Quarter Exam == Tuesday (10/29/19) == '''Agenda:''' * 1st Quarter Exam - '''Thursday (10/31/19)''' 80 minutes 35 multiple-..."

2019-11-04T11:10:48Z

Created page with "== Thursday (10/31/19) == '''Agenda:''' * 1st Quarter Exam == Tuesday (10/29/19) == '''Agenda:''' * 1st Quarter Exam - '''Thursday (10/31/19)''' ** 80 minutes ** 35 multiple-..."

New page

== Thursday (10/31/19) ==
'''Agenda:'''
* 1st Quarter Exam

== Tuesday (10/29/19) ==
'''Agenda:'''
* 1st Quarter Exam - '''Thursday (10/31/19)'''
** 80 minutes
** 35 multiple-choice questions
* All repl.its should be completed by this point
** Find Min/Max will be used in a future algorithm!
* How do they test you on algorithms in the multiple-choice section?
** If given some code and a missing block, they ask you to select the correct missing block to implement a particular algorithm
** If given a data set and code, you must trace the code (and follow the algorithm)
** Examples
** https://www.cs.usfca.edu/~galles/visualization/Search.html
* Study for quarter exam

== Friday (10/25/19) ==
'''Agenda:'''
* 1st Quarter Exam - '''Thursday (10/31/19)'''
** All topics are fair game up through while loops
* [https://docs.google.com/presentation/d/1GLpwZbqLcyix2WHqS9lLJT3qCeIeWGQ9UDwr6f9VgoE/edit?usp=sharing Search slides]
** Linear search
** Binary search
* Complete all repl.its

== Wednesday (10/23/19) ==
'''Agenda:'''
* while loops quiz in Canvas
* 1st Quarter Exam - '''Thursday (10/31/19)'''
** All topics are fair game up through while loops
* Looping practice from previous day(s)
* Looping algorithms
** Sum all the elements in an array
** Given a key to search for, locate the matching element in an array (return -1 if not there)
** Find the minimum/smallest element in an array
** Find the maximum/largest element in an array
* Complete while loop repl.its
** 3 x while loop practices
** Linear Search
** Find Min/Max

== Monday (10/21/19) ==
'''Agenda:'''
* 1st Quarter Exam - '''Thursday (10/31/19)'''
** All topics are fair game up through while loops
* Tic-Tac-Toe: Part 3 demos today
* Test 6 Questions?
* Test 7 questions?
** while loops quiz on '''Wednesday (10/23/19)'''
* Looping w/ String methods cont'd
*# Write a loop that counts the number of occurrences of a particular substring within a larger string (there are many ways to do this)
*# Write a loop that prints the location of every occurrence of a particular substring within a larger string (there are many ways to do this!)
* While loops with arrays
*# Write a loop that prints every element of an int[]
*# Write a loop that prints the square of every element in an int[]
*# Write a loop that sums all the numbers of an int[]

== Thursday (10/17/19) ==
'''Agenda:'''
* Did you complete Activity 6?
* Iteration - While Loops
** Basic while loops
**# Write a loop that prints 0 to 10 (exclusive)
**# Write a loop that prints 10 to 0 (inclusive)
**# Write a loop that sums all the numbers from 0 to 1000 (inclusive)
**# Write a loop that prints all the numbers that are divisible by 3 and 7 between 0 and 1000
** While loops with strings
**# Write a loop that prints each character of a String s (you supply the String's value)
**# Write a loop that prints every other character of a String s
**# Write a loop that prints each character of a String s from end to beginning
**# Write a loop that counts the number of occurrences of a particular substring within a larger string (there are many ways to do this)
**# Write a loop that prints the location of every occurrence of a particular substring within a larger string (there are many ways to do this!)
** While loops with arrays
**# Write a loop that prints every element of an int[]
**# Write a loop that prints the square of every element in an int[]
**# Write a loop that sums all the numbers of an int[]
** Complete Test 6 and Test 7

'''Homework:'''
* Complete Test 6 and Test 7 if you did not do so in class

== Friday (10/11/19) ==
'''Agenda:'''
* Activity 5 Questions?
* Test 5 Questions?
* Arrays Quiz
* Complete Activity 6

'''Homework:'''
* Complete Activity 6: Airline Meals

== Wednesday (10/9/19) ==
'''Agenda:'''
* Demo completed Tic-Tac-Toe game
* Introduction to Arrays
** Walk-through and read eIMACS: Arrays chapter (page 60)
** [https://docs.google.com/a/apsva.us/presentation/d/1Ayzvd1q-6RwZKplUtLHDCCLyO5XIR5kyeKUi8-htErY/edit?usp=sharing Java Arrays]
** Complete the Canvas Arrays Practice assignment
** Complete Activity 5: Arrays
** Java Arrays Quiz on '''Friday (10/11/19)'''

'''Homework:'''
* Complete Test 5

== Monday (10/7/19) ==
'''Agenda:'''
* Demo Tic-Tac-Toe - Part 2
* Tic-Tac-Toe - Part 3
*# Be sure to create a new sketch so as not to lose your working Part 2 code
*# Add conditionals to check if any 3 locations match (make sure that at least one of the locations is not equal to the empty string)
*# Display a text() message that indicates the winner
*# Call the noLoop() method to stop the game when there is a winner
*# Implement a mechanism/conditional to check if the game is a draw (tie)
* Demo a completed Tic-Tac-Toe game
* Challenge:
*# Implement an AI to play against you
*# Design and implement [https://en.wikipedia.org/wiki/Ultimate_tic-tac-toe Ultimate/Super Tic-Tac-Toe]

== Thursday (10/3/19) ==
'''Agenda:'''
* Work on and complete Tic-Tac-Toe - Part 2
*# Add a String variable to track the turn ("X" or "O")
*# You have two options:
*#* Add a two-dimensional String array to your Tic-Tac-Toe at the top to track the moves (all elements start as "", but will be "X" or "O" later)
*#* Add 9 String variables, one for each Tic-Tac-Toe square. Use a naming convention like (b_0_0, b_0_1, etc.)
*# Implement the appropriate code in mouseReleased() and draw() to draw Xs and Os where the mouse button is released
*# Make sure that you also have conditionals to check whether or not the location that is clicked is still empty (check against 2D array)
*# Make sure you update the 2-D String array OR your b_#_# variables with the current player's move
*# Update the turn variable so that it switches after a player has successfully made a move
*# Don't forget to update your draw() with text() commands so that all the moves are displayed
* Done with the above? Here are some challenges:
*# Implement a winner checking feature to stop the game and display who won
*# Implement an AI to play against you
*# Design and implement [https://en.wikipedia.org/wiki/Ultimate_tic-tac-toe Ultimate/Super Tic-Tac-Toe]

== Tuesday (10/1/19) ==
'''Agenda:'''
* Demo Tic-Tac-Toe: Select-a-Square
* Read [https://www.processing.org/reference/text_.html text()] and test it out to draw some text on the screen
* Read [https://www.processing.org/reference/mouseReleased_.html mouseReleased()] and test out the code
* X-O clicker assignment
*# Modify the code of the mouseReleased() so that a text-based X or O is drawn every time the mouse button is released
* Work on and complete Tic-Tac-Toe - Part 2
*# Add a String variable to track the turn ("X" or "O")
*# You have two options:
*#* Add a two-dimensional String array to your Tic-Tac-Toe at the top to track the moves (all elements start as "", but will be "X" or "O" later)
*#* Add 9 String variables, one for each Tic-Tac-Toe square. Use a naming convention like (b_0_0, b_0_1, etc.)
*# Implement the appropriate code in mouseReleased() and draw() to draw Xs and Os where the mouse button is released
*# Make sure that you also have conditionals to check whether or not the location that is clicked is still empty (check against 2D array)
*# Make sure you update the 2-D String array OR your b_#_# variables with the current player's move
*# Update the turn variable so that it switches after a player has successfully made a move
*# Don't forget to update your draw() with text() commands so that all the moves are displayed
* Done with the above? Here are some challenges:
*# Implement a winner checking feature to stop the game and display who won
*# Implement an AI to play against you
*# Design and implement [https://en.wikipedia.org/wiki/Ultimate_tic-tac-toe Ultimate/Super Tic-Tac-Toe]

← Older revision	Revision as of 11:11, 4 November 2019
(No difference)

APCS - 1920 - October - Revision history

Admin: Protected "APCS - 1920 - October" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading]

Admin: Created page with "== Thursday (10/31/19) == '''Agenda:''' * 1st Quarter Exam == Tuesday (10/29/19) == '''Agenda:''' * 1st Quarter Exam - '''Thursday (10/31/19)''' ** 80 minutes ** 35 multiple-..."

Admin: Created page with "== Thursday (10/31/19) == '''Agenda:''' * 1st Quarter Exam == Tuesday (10/29/19) == '''Agenda:''' * 1st Quarter Exam - '''Thursday (10/31/19)''' 80 minutes 35 multiple-..."