Difference between revisions of "AP Computer Science"
From WLCS
(43 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
− | == | + | == Monday (12/10/19) == |
'''Agenda:''' | '''Agenda:''' | ||
− | * | + | * Complete Lab 1: Chatter |
− | ** | + | <!-- |
− | * | + | ** Your project will be auto-graded when you export from NetBeans and upload it to eIMACS |
− | * | + | * For-each (enhanced for) loop |
− | + | ** Walk-through and examples | |
− | * | + | ** Common pitfall(s) |
− | * | + | ** What are the advantages of a regular for loop? Disadvantages? |
+ | ** What are the advantages of a for-each/enhanced? Disadvantages? | ||
+ | ** When do you want to use a regular for loop vs. a for-each/enhanced for loop? | ||
+ | --> | ||
+ | |||
+ | '''Homework:''' | ||
+ | * Complete Lab 1: Chatter | ||
+ | <!--* Complete Test 9--> | ||
− | == | + | == Thursday (12/6/18) == |
'''Agenda:''' | '''Agenda:''' | ||
− | * | + | * Go over eIMACS: Test 10 homework |
− | * | + | * main method |
− | + | * Comments | |
− | * Complete | + | * Multiple variable declarations (comma-separated) |
+ | * Complete Lab 1: Chatter (you will need NetBeans or Eclipse) | ||
+ | |||
+ | == Tuesday (12/4/18) == | ||
+ | '''Warmup:''' | ||
+ | * Complete #1 of eIMACS: Activity 7: Checksums | ||
− | |||
'''Agenda:''' | '''Agenda:''' | ||
− | * Complete | + | * Make sure you have completed all repl.it methods assignments |
− | ** | + | * Complete eIMACS: Activity 11: Strings 2 |
− | * Complete | + | ** Use the AP CS exam quick reference card |
− | * Complete | + | ** All methods should be able to be completed using the methods listed in the card |
+ | |||
+ | '''Homework:''' | ||
+ | * Complete eIMACS: Activity 7 #2 | ||
+ | * Complete eIMACS: Test 10 | ||
− | == | + | == Friday (11/30/18) == |
'''Agenda:''' | '''Agenda:''' | ||
− | * | + | * Search & Sort Identification Quiz |
− | * | + | * for loop demos - Practice 1 & 2 |
− | * | + | * Complete for Loop assignments in Repl.it |
− | ** | + | ** Count Words |
− | ** | + | ** double[] Average |
− | ** | + | ** Reverse String Print |
− | ** | + | * Introduction to Methods |
− | ** | + | ** [https://docs.google.com/presentation/d/1L-tbBp51YuUoTWldXFBr6JGcyHF5sBy_flfPGiqlVAQ/edit?usp=sharing Java Methods slides] |
− | ** | + | ** Java methods examples |
− | + | ** Complete repl.it methods assignments | |
− | * | + | |
− | + | == Monday - Wednesday (11/26/18 - 11/28/18) == | |
− | + | '''Warmup:''' | |
− | + | * Write a program that takes a String input, uses a for loop, and prints every other letter in the string | |
− | |||
− | |||
− | |||
'''Agenda:''' | '''Agenda:''' | ||
− | * | + | * for loop demos - Practice 1: |
− | * | + | *# Monte Carlo Pi |
− | *# | + | *# Taylor Series Pi and e |
− | *# | + | *# Looping exercises |
− | *# | + | * for loop demos - Practice 2: |
− | * | + | *# Linear search |
− | * | + | *# Binary search |
− | * | + | *# Selection sort |
− | *# | + | *# Bubble sort |
− | *# | + | *# Insertion sort |
+ | * Complete for Loop assignments in Repl.it | ||
+ | ** Count Words | ||
+ | ** double[] Average | ||
+ | ** Reverse String Print | ||
+ | * Search & Sort Identification Quiz next class | ||
+ | ** If shown the programming code or visualization of a particular algorithm, you can identify its name | ||
+ | ** 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 | ||
+ | |||
+ | == Monday (11/19/18) == | ||
+ | '''Warmup:''' | ||
+ | * for loops quiz at the end of class | ||
+ | * Prepare to demo for looped version of: | ||
+ | *# Monte Carlo Pi | ||
+ | *# Taylor Series Pi and e | ||
+ | *# Looping exercises | ||
− | |||
'''Agenda:''' | '''Agenda:''' | ||
− | * | + | * Repl.it resubmits |
− | * | + | ** Binary search incorrect -- please redo and resubmit |
− | * | + | * for Loop Practice 2 - Re-implement the following using for loops: |
− | * | + | ** Linear search |
− | * | + | ** Binary search |
− | * | + | ** Selection sort |
− | *# | + | ** Bubble sort |
− | *# | + | ** Insertion sort |
− | *# | + | * for loop assignments (repl.it submissions coming...) |
− | * | + | *# Write a program that takes a String input, uses a for loop, counts and displays the total number of spaces |
− | + | *# Write a program that takes a double[], uses a for loop, and displays the average value of all elements in the array | |
− | + | *# Write a program that takes a String input, and displays the entire string reversed (on one line) | |
− | * | + | * Have a great Thanksgiving Break! |
− | + | ||
− | + | == Thursday (11/15/18) == | |
+ | '''Warmup:''' | ||
+ | * Login to your [https://www.albert.io albert.io] account | ||
+ | * Join our AP CS A course using: EMVT7IN8APTL | ||
− | |||
'''Agenda:''' | '''Agenda:''' | ||
− | * | + | * Java for loops (eIMACS: For Loops) |
− | * | + | *# Write a for loop that prints out 0 to 10 (exclusive) |
− | * | + | *# Write a for loop that prints out 100 to 50 (inclusive) |
− | + | *# Write a for loop that prints out the first 10 odd numbers | |
− | *# | + | * for Loop Practice 1 - Convert the following programs from a while loop to a for loop (due '''Monday (11/19/18)''') |
− | * | + | *# Monte Carlo Pi |
− | *# | + | *# Taylor Series Pi and e |
− | *# | + | *# Looping exercises |
− | == Tuesday ( | + | == Tuesday (11/13/18) == |
'''Agenda:''' | '''Agenda:''' | ||
− | * | + | * Bubble sort questions? |
− | * | + | ** Bubble sort should be done by now |
− | * | + | * NetBeans installation check |
− | * | + | * JGrasp installation check |
− | * | + | * JGrasp canvas visualization practice |
− | * | + | ** Simple variables |
+ | ** Array | ||
+ | ** Loop | ||
+ | * Insertion Sort Assignment | ||
+ | *# Study the insertion sort visualization [https://visualgo.net/bn/sorting VisuAlgo] | ||
+ | *# What are the major components of the algorithm? (e.g. Loop that iterates through array from beginning to end) Others? | ||
+ | *# Implement insertion sort | ||
+ | *# Create your own data set and demonstrate your code for credit. Be prepared to be able to explain how your code works | ||
+ | *# Submit you code via Repl.it | ||
− | == | + | == Wednesday (11/8/18) == |
'''Agenda:''' | '''Agenda:''' | ||
− | * | + | * Selection sort assignment in repl.it should be already complete |
− | + | * Watch the bubble sort visualization at [https://visualgo.net/bn/sorting VisuAlgo] | |
− | * | + | ** Watch it multiple times until you have a firm understanding of what is happening |
− | ** | + | ** You can also read slide 5 about bubble sort in the [https://docs.google.com/presentation/d/1Y5JOINM2w744nqimZf2iVuFpi6N6gM2B7GM4ArGjChQ/edit?usp=sharing Sorting slides] |
− | ** | + | * 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 |
− | + | * 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 | |
− | + | ||
− | * | + | == Monday (11/5/18) == |
− | + | '''Warmup:''' | |
− | + | # Assume you have a given int[] named arr | |
− | * | + | # Assume you have two int variables named a and b |
− | + | # Write the code that would swap the elements in arr located at indices a and b | |
− | + | #* e.g. swap the elements arr[a] and arr[b] | |
− | |||
− | |||
− | |||
− | |||
− | * | ||
− | |||
'''Agenda:''' | '''Agenda:''' | ||
− | * | + | * Complete the Find Minimum & Maximum repl.it |
− | * [https:// | + | * 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 | ||
+ | |||
+ | == Thursday (11/1/18) == | ||
+ | * While loops quiz | ||
+ | * [https://docs.google.com/presentation/d/1GLpwZbqLcyix2WHqS9lLJT3qCeIeWGQ9UDwr6f9VgoE/edit?usp=sharing Search slides] | ||
+ | ** Linear Search | ||
+ | ** Binary Search | ||
+ | * LS and BS assignments will be posted in Repl.it | ||
+ | * Complete LS and BS by Monday (11/5/18) | ||
== Archives == | == Archives == | ||
+ | * [[APCS - 1819 - October]] | ||
* [[APCS - 1819 - September]] | * [[APCS - 1819 - September]] | ||
* [[APCS - 1718]] | * [[APCS - 1718]] | ||
* [[APCS - 1516]] | * [[APCS - 1516]] |
Revision as of 10:34, 10 December 2018
Contents
Monday (12/10/19)
Agenda:
- Complete Lab 1: Chatter
Homework:
- Complete Lab 1: Chatter
Thursday (12/6/18)
Agenda:
- Go over eIMACS: Test 10 homework
- main method
- Comments
- Multiple variable declarations (comma-separated)
- Complete Lab 1: Chatter (you will need NetBeans or Eclipse)
Tuesday (12/4/18)
Warmup:
- Complete #1 of eIMACS: Activity 7: Checksums
Agenda:
- Make sure you have completed all repl.it methods assignments
- Complete eIMACS: Activity 11: Strings 2
- Use the AP CS exam quick reference card
- All methods should be able to be completed using the methods listed in the card
Homework:
- Complete eIMACS: Activity 7 #2
- Complete eIMACS: Test 10
Friday (11/30/18)
Agenda:
- Search & Sort Identification Quiz
- for loop demos - Practice 1 & 2
- Complete for Loop assignments in Repl.it
- Count Words
- double[] Average
- Reverse String Print
- Introduction to Methods
- Java Methods slides
- Java methods examples
- Complete repl.it methods assignments
Monday - Wednesday (11/26/18 - 11/28/18)
Warmup:
- Write a program that takes a String input, uses a for loop, and prints every other letter in the string
Agenda:
- for loop demos - Practice 1:
- Monte Carlo Pi
- Taylor Series Pi and e
- Looping exercises
- for loop demos - Practice 2:
- Linear search
- Binary search
- Selection sort
- Bubble sort
- Insertion sort
- Complete for Loop assignments in Repl.it
- Count Words
- double[] Average
- Reverse String Print
- Search & Sort Identification Quiz next class
- If shown the programming code or visualization of a particular algorithm, you can identify its name
- 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
Monday (11/19/18)
Warmup:
- for loops quiz at the end of class
- Prepare to demo for looped version of:
- Monte Carlo Pi
- Taylor Series Pi and e
- Looping exercises
Agenda:
- Repl.it resubmits
- Binary search incorrect -- please redo and resubmit
- for Loop Practice 2 - Re-implement the following using for loops:
- Linear search
- Binary search
- Selection sort
- Bubble sort
- Insertion sort
- for loop assignments (repl.it submissions coming...)
- Write a program that takes a String input, uses a for loop, counts and displays the total number of spaces
- Write a program that takes a double[], uses a for loop, and displays the average value of all elements in the array
- Write a program that takes a String input, and displays the entire string reversed (on one line)
- Have a great Thanksgiving Break!
Thursday (11/15/18)
Warmup:
- Login to your albert.io account
- Join our AP CS A course using: EMVT7IN8APTL
Agenda:
- Java for loops (eIMACS: For Loops)
- Write a for loop that prints out 0 to 10 (exclusive)
- Write a for loop that prints out 100 to 50 (inclusive)
- Write a for loop that prints out the first 10 odd numbers
- for Loop Practice 1 - Convert the following programs from a while loop to a for loop (due Monday (11/19/18))
- Monte Carlo Pi
- Taylor Series Pi and e
- Looping exercises
Tuesday (11/13/18)
Agenda:
- Bubble sort questions?
- Bubble sort should be done by now
- NetBeans installation check
- JGrasp installation check
- JGrasp canvas visualization practice
- Simple variables
- Array
- Loop
- Insertion Sort Assignment
- Study the insertion sort visualization VisuAlgo
- What are the major components of the algorithm? (e.g. Loop that iterates through array from beginning to end) Others?
- Implement insertion sort
- Create your own data set and demonstrate your code for credit. Be prepared to be able to explain how your code works
- Submit you code via Repl.it
Wednesday (11/8/18)
Agenda:
- Selection sort assignment in repl.it should be already complete
- Watch the bubble sort visualization at VisuAlgo
- Watch it multiple times until you have a firm understanding of what is happening
- You can also read slide 5 about bubble sort in the Sorting slides
- 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
- Future assignments will implement insertion sort and merge sort algorithms. You are encouraged to watch the VisuAlgo visualizations to understand those algorithms
Monday (11/5/18)
Warmup:
- Assume you have a given int[] named arr
- Assume you have two int variables named a and b
- Write the code that would swap the elements in arr located at indices a and b
- e.g. swap the elements arr[a] and arr[b]
Agenda:
- Complete the Find Minimum & Maximum repl.it
- 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 group document - Don't forget to put your names
- Introduction to Sorting
- Complete Selection sort assignment in repl.it
Thursday (11/1/18)
- While loops quiz
- Search slides
- Linear Search
- Binary Search
- LS and BS assignments will be posted in Repl.it
- Complete LS and BS by Monday (11/5/18)