AP Computer Science

From WLCS
Jump to: navigation, search

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