|
|
(141 intermediate revisions by the same user not shown) |
Line 1: |
Line 1: |
− | == Tuesday (12/3/19) ==
| |
− | '''Agenda:'''
| |
− | * Java Methods & Strings quiz
| |
− | * Repl.it reminder - all assignments should be completed by now
| |
− | * Multiple Variable Declarations
| |
− | * Overloaded Methods
| |
− | ** Exercises & Examples
| |
− | ** Why would we want to overload methods?
| |
− | * Complete Activity 12: Optional Arguments
| |
− |
| |
− | == Wednesday - Friday (11/27/19 - 11/29/19) ==
| |
− | * Thanksgiving Break
| |
− |
| |
− | == Tuesday (11/26/19) ==
| |
− | '''Warmup:'''
| |
− | * Complete the Java Methods Review Worksheet in Canvas
| |
− |
| |
− | '''Agenda:'''
| |
− | * Complete all missing assignments
| |
− | * Convert the following to methods (repl.its coming soon)
| |
− | ** double sum(double[] nums) - returns the sum of the nums array
| |
− | ** double min(double[] nums) - returns the minimum element from the nums array
| |
− | ** double max(double[] nums) - returns the maximum element from the nums array
| |
− | ** 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)
| |
− | ** 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)
| |
− | *** Be sure to sort the array at the beginning of the method (Hint: How did Mr. Bui do this in the repl.it assignment?)
| |
− | * Java Methods & Strings quiz on '''Tuesday (12/3/19)'''
| |
− |
| |
− | == Friday (11/22/19) ==
| |
− | '''Agenda:'''
| |
− | * AP Classroom: Unit 3 & Unit 4
| |
− | ** If you did not score in the green, then you will be re-assigned the questions next week
| |
− | ** Take some time to go over your results and your questions
| |
− | * break keyword
| |
− | * Introduction/Review of [https://docs.google.com/presentation/d/1L-tbBp51YuUoTWldXFBr6JGcyHF5sBy_flfPGiqlVAQ/edit?usp=sharing Methods]
| |
− | ** Methods examples
| |
− | ** return keyword
| |
− | ** static vs. non-static methods
| |
− | * Complete Activity 11
| |
− | * Complete Test 10
| |
− |
| |
− | '''Homework:'''
| |
− | * Complete any missing assignments or assignments that you did not finish in class
| |
− |
| |
− | == Wednesday (11/20/19) ==
| |
− | '''Agenda:'''
| |
− | * [https://www.youtube.com/user/udiprod More Sorting Videos]
| |
− | * Complete Insertion sort repl.it
| |
− | * Complete the AP Classroom Progress Checks (these are timed!)
| |
− | ** Unit 3 (Boolean Expressions and if Statements) - 47 minutes
| |
− | ** Unit 4 (Iteration) - 41 minutes
| |
− |
| |
− | '''Homework:'''
| |
− | * Complete any assignments that you did not complete in class
| |
− |
| |
− | == Monday (11/18/19) ==
| |
− | '''Agenda:'''
| |
− | * For loops quiz
| |
− | * [https://docs.google.com/presentation/d/1Y5JOINM2w744nqimZf2iVuFpi6N6gM2B7GM4ArGjChQ/edit?usp=sharing Sorting slides]
| |
− | ** Selection sort review
| |
− | ** Bubble sort walk-through
| |
− | ** Complete the Bubble sort repl.it
| |
− | * Insertion sort
| |
− | ** Complete the insertion sort repl.it
| |
− |
| |
− | == Thursday (11/14/19) ==
| |
− | '''Agenda:'''
| |
− | * Missing repl.its
| |
− | * Enhanced for loop (for "each" loop / for "each & every" loop) review
| |
− | ** Examples and common pitfalls
| |
− | ** Complete the for loop vs enhanced for loop assignment in Canvas
| |
− | * Test 9 questions?
| |
− | * For loops (both types) quiz on '''Monday (11/18/19)'''
| |
− | * Group sorting activity
| |
− | *# Form 3-4 person groups
| |
− | *# Receive playing cards
| |
− | *# With your group, document step-by-step an algorithm (steps) of how you sort the cards out
| |
− | *# Every group will share their algorithm in class
| |
− | *# Paste your sorting algorithm in this [https://docs.google.com/document/d/1Jh9Uz3FdomH2cB9VKUSTfL_BSluWEoROHmhwbpM_qaA/edit?usp=sharing group document] - Don't forget to put your names
| |
− | * Introduction to Sorting
| |
− | ** [https://docs.google.com/presentation/d/1Y5JOINM2w744nqimZf2iVuFpi6N6gM2B7GM4ArGjChQ/edit?usp=sharing Sorting slides]
| |
− | * Complete Selection sort assignment in repl.it
| |
− |
| |
− | == Tuesday (11/12/19) ==
| |
− | '''Agenda:'''
| |
− | * for loop review
| |
− | * Complete the 6 for loop repl.its:
| |
− | ** for loop - Linear Search (try attempting without looking at your previous code)
| |
− | ** for loop - Find Min/Max (try attempting without looking at your previous code)
| |
− | ** for loop - Binary Search (try attempting without looking at your previous code)
| |
− | ** for loop - Count Words
| |
− | ** for loop - double[] Average
| |
− | ** for loop - Reverse String Print
| |
− | * Enhanced for loop
| |
− | ** Examples and common pitfalls
| |
− | ** Complete the for loop vs enhanced for loop assignment in Canvas
| |
− | * Complete eIMACS: Test 9
| |
− |
| |
− | '''Homework:'''
| |
− | * Complete the for loop repl.it exercises if you did not do so in class
| |
− | * Complete Test 9 if you did not do so in class
| |
− | * Read eIMACS: Methods->Static Methods before class
| |
− |
| |
− | == Thursday (11/7/19) ==
| |
− | '''Agenda:'''
| |
− | * Test 8 Questions?
| |
− | * Activity 7 work time - go on to the repl.its if you have already completed these
| |
− | * Complete the 3 for loop repl.its:
| |
− | ** for loop - Count Words
| |
− | ** for loop - double[] Average
| |
− | ** for loop - Reverse String Print
| |
− | * Enhanced for loop
| |
− | ** Examples and common pitfalls
| |
− | ** Complete the for loop vs enhanced for loop assignment in Canvas
| |
− |
| |
− | '''Homework:'''
| |
− | * Complete any missing assignments above
| |
− |
| |
− | == Monday (11/4/19) ==
| |
− | '''Agenda:'''
| |
− | * Read the eIMACS chapter on for loops
| |
− | * Complete Test 8
| |
− | * Read the eIMACS chapter on for-each loops
| |
− | * Complete Activity 7: Checksums
| |
− |
| |
− | == [[APCS - 1920 - October]] ==
| |
− |
| |
− | == [[APCS - 1920 - September]] ==
| |
− |
| |
| == [[APCS - Archives]] == | | == [[APCS - Archives]] == |