|
|
| (569 intermediate revisions by the same user not shown) |
| Line 1: |
Line 1: |
| − | == Thursday (3/5/18) == | + | == [[APCS - Archives]] == |
| − | '''Agenda:'''
| |
| − | * Algorithms review
| |
| − | * Algorithm Identification Quiz on Canvas
| |
| − | * Individual grade meetings to finalize grading
| |
| − | | |
| − | == Tuesday (4/3/18) ==
| |
| − | '''Agenda:'''
| |
| − | * Mr. Bui is out because his son as the flu
| |
| − | * Insertion sort
| |
| − | *# Go to [https://visualgo.net/bn/sorting https://visualgo.net/bn/sorting]
| |
| − | *# Be sure to click on '''INS''' for Insertion Sort at the top
| |
| − | *# Click on '''Create''' -> '''Random'''
| |
| − | *# Click on '''Sort''' -> '''Go'''
| |
| − | *# Run the visualization as many times as you need
| |
| − | *# You can slow down the visualization and observe the pseudocode in the lower right
| |
| − | *# You may also look up the Java code for insertion sort
| |
| − | * Algorithms Quiz on '''Thursday (4/5/18)'''
| |
| − | ** You will be given the Java code for the following algorithms, and you must be able to identify the name of the algorithm
| |
| − | *** Linear search
| |
| − | *** Binary search
| |
| − | *** Minimum search
| |
| − | *** Maximum search
| |
| − | *** Selection sort
| |
| − | *** Bubble sort
| |
| − | *** Insertion sort
| |
| − | * Use the remaining time in class to complete any missing assignments
| |
| − | | |
| − | == Friday (3/23/18) ==
| |
| − | '''Agenda:'''
| |
| − | * Finish interfaces
| |
| − | * Min/Max algorithm review
| |
| − | * Sorting
| |
| − | ** Selection sort
| |
| − | ** Bubble sort
| |
| − | | |
| − | == Wednesday (3/21/18) ==
| |
| − | * Snow Day
| |
| − | | |
| − | == Monday (3/19/18) ==
| |
| − | '''Warmup:'''
| |
| − | * Think of 3 different examples of commonly accepted "interfaces" in real life. You can use examples in *anything* -- hardware, software, real-world objects, etc.
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Interfaces cont'd
| |
| − | ** keywords: implements, interface
| |
| − | | |
| − | == Thursday (3/15/18) ==
| |
| − | '''Agenda:'''
| |
| − | * Complete eIMACS: Test 14 on the mini scantron sheet
| |
| − | ** Write your answers on both your scratch paper
| |
| − | ** You will have 20 minutes total
| |
| − | * Test 14 review
| |
| − | * Interfaces
| |
| − | ** keyword: interface
| |
| − | ** keyword: implements
| |
| − | | |
| − | == Tuesday (3/13/18) ==
| |
| − | '''Agenda:'''
| |
| − | * What's left to cover?
| |
| − | * abstract classes
| |
| − | * abstract methods
| |
| − | * Complete eIMACS: Activity 24
| |
| − | | |
| − | == Friday (3/9/18) ==
| |
| − | '''Agenda:'''
| |
| − | * Volunteer Opportunity
| |
| − | ** Middle schoolers will be building and programming VEX IQ robots. They will be using block language to program so any student with basic background in coding would be helpful.
| |
| − | ** Adam Nesbitt Robotics Day on '''Saturday, March 17th from 8:30am-12:30pm at the Career Center'''
| |
| − | ** [https://tinyurl.com/y6v82rdx Volunteer Sign-up form]
| |
| − | * Binary Search
| |
| − | ** Break up into groups (Mr. Bui will assign based on binary search understanding)
| |
| − | ** Discuss the algorithm with your team and how it works
| |
| − | ** Only one person coding/typing per team
| |
| − | ** Complete and demo [[JavaSearchAssignment.java]] (ignore linear search part)
| |
| − | ** Once you have completed the array version, reimplement the code and search using ArrayList
| |
| − | | |
| − | == Wednesday (3/7/18) ==
| |
| − | '''Agenda:'''
| |
| − | * Some random Java keywords and their demos
| |
| − | ** final keyword - forces variable to be a constant value
| |
| − | ** static keyword - binds variable/method to CLASSNAME *instead* of to instances of objects
| |
| − | * Linear search algorithm (for both arrays and ArrayList)
| |
| − | * Use internets to research Binary search algorithm
| |
| − | ** Check out visualizations
| |
| − | ** Check out code examples
| |
| − | | |
| − | == Monday (3/5/18) ==
| |
| − | '''Warmup:'''
| |
| − | * Complete eIMACS: Activity 16.1 on paper- you have 3 minutes
| |
| − | * We will review and self-grade
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Finish going over 2015 FRQ #3
| |
| − | * What's left?
| |
| − | ** A little more OOP
| |
| − | ** Search algorithms
| |
| − | ** Sorting algorithms
| |
| − | * Final grade after AP exam
| |
| − | ** If you score a 5 on the exam, Mr. Bui will retroactively update your final grade to an A
| |
| − | ** If you score a 4 on the exam, Mr. Bui will retroactively update your final grade to an B+
| |
| − | ** You grade can only increase or stay the same (he will not downgrade if you bomb the exam)
| |
| − | * Complete eIMACS: Activity 16.2 on paper - you have 4 minutes
| |
| − | * Review & self-grade Activity 16.2
| |
| − | * Complete eIMACS: Activity 16.3 on paper - you have 4 minutes
| |
| − | * Review & self-grade Activity 16.3
| |
| − | * Complete eIMACS: Activity 16.4 on paper - you have 4 minutes
| |
| − | * Review & self-grade Activity 16.4
| |
| − | * Object-oriented programming review
| |
| − | ** Polymorphism
| |
| − | ** Overriding Methods
| |
| − | | |
| − | == Thursday (3/1/18) ==
| |
| − | '''Warmup:'''
| |
| − | * Submit your 2015 FRQ #2 attempt to Canvas
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Go over 2015 FRQ #2
| |
| − | * Attempt 2015 FRQ #3
| |
| − | * Go over 2015 FRQ #3
| |
| − | | |
| − | == Archives == | |
| − | * [[APCS - 1718 - February]]
| |
| − | * [[APCS - 1718 - January]]
| |
| − | * [[APCS - 1718 - December]]
| |
| − | * [[APCS - 1718 - November]]
| |
| − | * [[APCS - 1718 - October]]
| |
| − | * [[APCS - 1718 - September]]
| |
| − | * [[APCS - 1516]]
| |
