Difference between revisions of "AP Computer Science"

From WLCS
Jump to: navigation, search
(26 intermediate revisions by the same user not shown)
Line 1: Line 1:
== Monday (12/10/19) ==
+
== Thursday (1/17/19) ==
'''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:'''
 
* 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:'''
 
'''Warmup:'''
* Complete #1 of eIMACS: Activity 7: Checksums
+
* Submit your Circle class to repl.it
  
 
'''Agenda:'''
 
'''Agenda:'''
* Make sure you have completed all repl.it methods assignments
+
* Object-Oriented Programming cont'd
* Complete eIMACS: Activity 11: Strings 2
+
** OOP Review - attributes, constructors, setters, getters, public vs. private, this
** Use the AP CS exam quick reference card
+
** toString() method (using the Point class)
** All methods should be able to be completed using the methods listed in the card
+
** Submit Point class to repl.it
 +
** [https://docs.google.com/presentation/d/1hb_8wMUlQQl7W-JF2f3gax021yDHLkLENJYy0fUMGy8/edit?usp=sharing Classes (Java) slides]
 +
* Complete the Car class assignments in repl.it
 +
* [https://drive.google.com/file/d/1tQc3yOyfjy7xN6oz0glIeFHqJgORmuAd/view?usp=sharing Dino Game example]
 +
** Add another cactus to the dino game
  
 
'''Homework:'''
 
'''Homework:'''
* Complete eIMACS: Activity 7 #2
+
* Complete eIMACS: Activity 14: Address Objects
* Complete eIMACS: Test 10
 
  
== Friday (11/30/18) ==
+
== Tuesday (1/15/19) ==
'''Agenda:'''
+
* Snow Day
* 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
 
  
 +
== Friday (1/11/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
* for loop demos - Practice 1:
+
* Object-Oriented Programming cont'd
*# Monte Carlo Pi
+
** Person class review
*# Taylor Series Pi and e
+
** Vocab:
*# Looping exercises
+
*** class vs object
* for loop demos - Practice 2:
+
*** declaration vs instantiation
*# Linear search
+
** Point class example
*# Binary search
+
** Point object instantiation
*# Selection sort
+
** Point object usage
*# Bubble sort
+
** [https://docs.google.com/presentation/d/1hb_8wMUlQQl7W-JF2f3gax021yDHLkLENJYy0fUMGy8/edit?usp=sharing Classes (Java) slides]
*# Insertion sort
+
** Circle class example
* Complete for Loop assignments in Repl.it
+
** [https://drive.google.com/file/d/1tQc3yOyfjy7xN6oz0glIeFHqJgORmuAd/view?usp=sharing Dino Game example]
** 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) ==
+
'''Homework:'''
'''Warmup:'''
+
* Create a Circle class and test it out
* for loops quiz at the end of class
+
* Follow the [https://docs.google.com/presentation/d/1hb_8wMUlQQl7W-JF2f3gax021yDHLkLENJYy0fUMGy8/edit?usp=sharing Classes (Java) slides]
* Prepare to demo for looped version of:
 
*# Monte Carlo Pi
 
*# Taylor Series Pi and e
 
*# Looping exercises
 
  
 +
== Wednesday (1/9/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
* Repl.it resubmits
+
* Cornell Engineering Diversity Programs - one-week residential programs:
** Binary search incorrect -- please redo and resubmit
+
** [https://sites.coecis.cornell.edu/catalystacademy/ Catalyst Academy] - juniors and seniors from underrepresented backgrounds
* for Loop Practice 2 - Re-implement the following using for loops:
+
** [https://sites.coecis.cornell.edu/curieacademy/ Curie Academy] - high school girls who excel in math and science
** Linear search
+
* Recursion quiz
** Binary search
+
* Submit Recursion Problems to repl.it
** Selection sort
+
** public static int count(String s, String ch) - returns the number of occurrences of ch (single character string) within s
** Bubble sort
+
** public static String reverse(String s) - returns the reversed String s
** Insertion sort
+
** public static int reverse(int i) - returns an int that is the full digit reversal of i (e.g. 1234 -> 4321)
* for loop assignments (repl.it submissions coming...)
+
* Introduction to Object-Oriented Programming
*# Write a program that takes a String input, uses a for loop, counts and displays the total number of spaces
+
** [https://repl.it/@paulbui/SimpleProgramWithoutOOP Simple program without OOP example]
*# Write a program that takes a double[], uses a for loop, and displays the average value of all elements in the array
+
** Simple program with OOP example
*# Write a program that takes a String input, and displays the entire string reversed (on one line)
+
** Point class example
* Have a great Thanksgiving Break!
+
** Point object instantiation
 +
** Point object usage
 +
** [https://docs.google.com/presentation/d/1hb_8wMUlQQl7W-JF2f3gax021yDHLkLENJYy0fUMGy8/edit?usp=sharing Classes (Java) slides]
 +
** Circle class example
  
== Thursday (11/15/18) ==
+
'''Homework:'''
'''Warmup:'''
+
* Complete and submit recursion problems to repl.it
* Login to your [https://www.albert.io albert.io] account
+
* Review SimpleProgramWithOOP notes that we did in class
* 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) ==
+
== Monday (1/7/19) ==
'''Agenda:'''
+
* Don't forget to complete Activity 13 (due tonight)
* Bubble sort questions?
+
* Recursion Quiz Wednesday (1/9/19)
** Bubble sort should be done by now
+
** Multiple choice questions
* NetBeans installation check
+
** Free-response question(s)
* JGrasp installation check
+
* Recursion Review & Practice
* JGrasp canvas visualization practice
+
* Recursion Problems (prepare to submit to repl.it)
** Simple variables
+
** public static int count(String s, String ch) - returns the number of occurrences of ch (single character string) within s
** Array
+
** public static String reverse(String s) - returns the reversed String s
** Loop
+
** public static int reverse(int i) - returns an int that is the full digit reversal of i (e.g. 1234 -> 4321)
* 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:'''
 
* 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:'''
 
* 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 [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) ==
+
== Monday - Friday (12/31/18 - 1/4/19) ==
* While loops quiz
+
* Winter Break
* [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 - December]]
 +
* [[APCS - 1819 - November]]
 
* [[APCS - 1819 - October]]
 
* [[APCS - 1819 - October]]
 
* [[APCS - 1819 - September]]
 
* [[APCS - 1819 - September]]
 
* [[APCS - 1718]]
 
* [[APCS - 1718]]
 
* [[APCS - 1516]]
 
* [[APCS - 1516]]

Revision as of 10:45, 17 January 2019

Thursday (1/17/19)

Warmup:

  • Submit your Circle class to repl.it

Agenda:

  • Object-Oriented Programming cont'd
    • OOP Review - attributes, constructors, setters, getters, public vs. private, this
    • toString() method (using the Point class)
    • Submit Point class to repl.it
    • Classes (Java) slides
  • Complete the Car class assignments in repl.it
  • Dino Game example
    • Add another cactus to the dino game

Homework:

  • Complete eIMACS: Activity 14: Address Objects

Tuesday (1/15/19)

  • Snow Day

Friday (1/11/19)

Agenda:

  • Object-Oriented Programming cont'd
    • Person class review
    • Vocab:
      • class vs object
      • declaration vs instantiation
    • Point class example
    • Point object instantiation
    • Point object usage
    • Classes (Java) slides
    • Circle class example
    • Dino Game example

Homework:

Wednesday (1/9/19)

Agenda:

  • Cornell Engineering Diversity Programs - one-week residential programs:
  • Recursion quiz
  • Submit Recursion Problems to repl.it
    • public static int count(String s, String ch) - returns the number of occurrences of ch (single character string) within s
    • public static String reverse(String s) - returns the reversed String s
    • public static int reverse(int i) - returns an int that is the full digit reversal of i (e.g. 1234 -> 4321)
  • Introduction to Object-Oriented Programming

Homework:

  • Complete and submit recursion problems to repl.it
  • Review SimpleProgramWithOOP notes that we did in class

Monday (1/7/19)

  • Don't forget to complete Activity 13 (due tonight)
  • Recursion Quiz Wednesday (1/9/19)
    • Multiple choice questions
    • Free-response question(s)
  • Recursion Review & Practice
  • Recursion Problems (prepare to submit to repl.it)
    • public static int count(String s, String ch) - returns the number of occurrences of ch (single character string) within s
    • public static String reverse(String s) - returns the reversed String s
    • public static int reverse(int i) - returns an int that is the full digit reversal of i (e.g. 1234 -> 4321)

Monday - Friday (12/31/18 - 1/4/19)

  • Winter Break

Archives

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

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:
    1. Monte Carlo Pi
    2. Taylor Series Pi and e
    3. Looping exercises
  • for loop demos - Practice 2:
    1. Linear search
    2. Binary search
    3. Selection sort
    4. Bubble sort
    5. 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:
    1. Monte Carlo Pi
    2. Taylor Series Pi and e
    3. 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...)
    1. Write a program that takes a String input, uses a for loop, counts and displays the total number of spaces
    2. Write a program that takes a double[], uses a for loop, and displays the average value of all elements in the array
    3. 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)
    1. Write a for loop that prints out 0 to 10 (exclusive)
    2. Write a for loop that prints out 100 to 50 (inclusive)
    3. 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))
    1. Monte Carlo Pi
    2. Taylor Series Pi and e
    3. 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
    1. Study the insertion sort visualization VisuAlgo
    2. What are the major components of the algorithm? (e.g. Loop that iterates through array from beginning to end) Others?
    3. Implement insertion sort
    4. Create your own data set and demonstrate your code for credit. Be prepared to be able to explain how your code works
    5. 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:

  1. Assume you have a given int[] named arr
  2. Assume you have two int variables named a and b
  3. 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
    1. Form 3-4 person groups
    2. Receive playing cards
    3. With your group, document step-by-step an algorithm (steps) of how you sort the cards out
    4. Every group will share their algorithm in class
    5. 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)

Archives