Difference between revisions of "AP Computer Science"

From WLCS
(39 intermediate revisions by the same user not shown)
Line 1: Line 1:
== Monday (1/7/19) ==
+
== Tuesday (2/12/19) ==
* Don't forget to complete Activity 13 (due tonight)
+
'''Agenda:'''
* Recursion Quiz Wednesday (1/9/19)
+
* Class construction, object usage, & object arrays quiz
** Multiple choice questions
+
* Complete and demo War Card "Game"/Simulation
** Free-response question(s)
+
** Display how many cards each player has at the beginning of each round
* Recursion Review & Practice
+
** You should display messages like "Player 1 reveals X of X"
* Recursion Problems (prepare to submit to repl.it)
+
** Display a message of who wins each "round"
** public static int count(String s, String ch) - returns the number of occurrences of ch (single character string) within s
+
** Display "I declare war!"
** public static String reverse(String s) - returns the reversed String s
+
** Display the eventual winner
** 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) ==
+
== Wednesday - Friday (2/6/19 - 2/8/19) ==
* Winter Break
 
 
 
== Monday - Friday (12/24/18 - 12/28/18) ==
 
* Winter Break
 
 
 
== Tuesday - Thursday (12/18/18 - 12/20/18) ==
 
 
'''Agenda:'''
 
'''Agenda:'''
* Introduction to Recursion
+
* Complete and submit Poker Hands: Part 1 to repl.it
** [https://drive.google.com/open?id=1lTbHjY4I8bw4vWaXyoe-t5jDDTTCqa6ZcYR3BTyRNZc Recursion slides]
+
* Introduction to ArrayLists
** Recursion practice problems
+
** AP CS reference card for ArrayLists
**# Write a recursive method that returns the sum of all the numbers from N down to 1: int sum(int N)
+
** eIMACS ArrayLists chapter review
**# Write a recursive method that prints every other letter of a string: void printSkipping(String s)
+
** Memorize / study ArrayList<E> instance methods
**# Write a recursive method that returns true if a particular character is in the String: boolean findChar(char ch, String s)
+
* Processing - Ball example w/ ArrayLists
* Recursion Practice Examples - We will convert the following from iterative to recursive algorithms
+
* Processing - millis() timer example
*# Monte Carlo Pi
+
* Item Collection w/ ArrayLists
*# Taylor Series Pi and e
+
*# Re-implement your Item Collection game so that it uses ArrayLists instead of arrays
*# Looping exercises
+
*# Start with an ArrayList of 1 robot, and add new robots every 3 seconds
*# ...and more practice
+
*# Start with an ArrayList of 5 items, and remove items when the player collides with them
* Recursion Problems (prepare to submit to repl.it)
+
* ArrayList<Card> examples
** public static int count(String s, String ch) - returns the number of occurrences of ch (single character string) within s
+
* War Card "Game"/Simulation
** public static String reverse(String s) - returns the reversed String s
+
*# Use NetBeans and create a new project for War
** public static int reverse(int i) - returns an int that is the full digit reversal of i (e.g. 1234 -> 4321)
+
*# The Main.java file will be the simulation
* Complete Activity 13
+
*# Create a new Java class (name the file Card.java) and paste your Card class there
 
+
*# Design and implement the game/simulation (we will design as a class)
== Friday (12/14/18) ==
 
'''Warmup:'''
 
* Complete eIMACS: Activity 7 #3
 
  
 +
== Monday (2/4/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
* Test 9 review
+
* Demo Item Collection Game w/ Object Arrays
* Overloaded methods
+
* Complete Card class in repl.it (should be done today)
** When you have multiple methods of the same name, but different parameters (types or number of parameters)
+
* Work on Poker Hands: Part 1 in repl.it - '''due Thursday (2/6/19)'''
** Examples:  
 
*** String's substring() method
 
*** Processing's rect() method
 
* Complete Activity 12
 
  
== Wednesday (12/12/18) ==
+
== Thursday (1/31/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
* Are you missing any work? (check eIMACS gradebook and StudentVUE)
+
* Demo Item Collection Game
* Complete Lab 1 on your own time
+
* Arrays of Objects
* For-each (enhanced for) loop
+
** String arrays (review)
** Walk-through and examples
+
** Ball class and Ball array
** Common pitfall(s)
+
* Item Collection Game w/ Object Arrays (assignment)
** What are the advantages of a regular for loop? Disadvantages?
+
*# Copy your Item Collection Game to a new Processing sketch
** What are the advantages of a for-each/enhanced? Disadvantages?
+
*# Convert your item Sprites collected into an array
** When do you want to use a regular for loop vs. a for-each/enhanced for loop?
+
*# Convert your robot Sprites into an array
* Complete Test 9
+
*# Demo your converted game on '''Monday (2/4/19)'''
 
 
'''Homework:'''
 
* Complete Lab 1: Chatter
 
* Complete Test 9
 
  
== Monday (12/10/19) ==
+
== Tuesday (1/29/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
* Complete Lab 1: Chatter
+
* Item Collection Game - '''due Thursday (1/31/19)'''
** Your project will be auto-graded when you export from NetBeans and upload it to eIMACS
+
*# We will design a simple top-down item collection game using a new Sprite class (specified below)
 
+
*# Find and download Sprite images of your choosing
'''Homework:'''
+
*# You can move the player sprite with the keyboard (wrap the player to the other side of the screen if you go off screen)
* Complete Lab 1: Chatter
+
*# The player sprite will be able to collect item sprites
 +
*# Robot sprites will follow the player around
 +
*# You win when you collect all the items
 +
*# You lose if a robot collides with your sprite
 +
* Sprite class (has similarities to the previous Sprite class)
 +
** Attributes:
 +
*** double x, y (to be used for position)
 +
*** double dx, dy (to be used for step size when moving -- always positive)
 +
*** PImage img (stores the image)
 +
*** boolean visible (default setting is true -- we will use this variable to track the Sprite's visibility state)
 +
** Constructors:
 +
*** Sprite()
 +
*** Sprite(String imgfile, double x, double y, double dx, double dy)
 +
** Methods:
 +
*** void display() - if visible is true, then display the image
 +
*** void moveLeft() - move x-coordinate to the left by dx amount
 +
*** void moveRight() - move x-coordinate to the right by dx amount
 +
*** void moveUp() - move y-coodrinate upwards by dy amount
 +
*** void moveDown() - move y-coodrinate downwards by dy amount
 +
*** boolean checkCollision(Sprite other) - returns true if this Sprite is colliding with the other Sprite (use previous Sprite class to help with this method)
 +
*** void follow(Sprite other) - compare x and y coordinates of this Sprite with the other Sprite -- move this Sprite towards other Sprite by using the move____() methods
  
== Thursday (12/6/18) ==
+
== Tuesday - Thursday (1/22/19 - 1/24/19) ==
 
'''Agenda:'''
 
'''Agenda:'''
* Go over eIMACS: Test 10 homework
+
* [https://drive.google.com/file/d/1tQc3yOyfjy7xN6oz0glIeFHqJgORmuAd/view?usp=sharing Dino Game example]
* main method
+
** We will convert the non-OOP version into an [https://drive.google.com/file/d/1FAO7kdtVrYrrO4jgcRMap3S3UtDqFe_W/view?usp=sharing OOP version]
* Comments
+
** Add another cactus to the dino game
* Multiple variable declarations (comma-separated)
+
* Flappy Bird OOP
* Complete Lab 1: Chatter (you will need NetBeans or Eclipse)
+
** What modifications to our Sprite class do we need to make?
 +
** Here are some Flappy Bird sprite images [https://drive.google.com/file/d/1UugFrLPjeA8YPXOlmOxjIvzd6HdvpupA/view?usp=sharing here]
 +
** Implement the OOP version of Flappy Bird in Processing
 +
** Bird will need to flap when a key is pressed
 +
** Pipes will need to move and wrap around the screen
 +
** Score increases when a pipe is passed (this will require something to be added to the Sprite class)
 +
** Lose when bird collides with a pipe or when the Bird goes too far below the screen
 +
** Due '''Thursday (1/24/19)''' -- last assignment of 2nd Quarter
  
== Tuesday (12/4/18) ==
+
== Thursday (1/17/19) ==
 
'''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:'''
+
== Monday (1/7/19) ==
* Java for loops (eIMACS: For Loops)
+
* Don't forget to complete Activity 13 (due tonight)
*# Write a for loop that prints out 0 to 10 (exclusive)
+
* Recursion Quiz Wednesday (1/9/19)
*# Write a for loop that prints out 100 to 50 (inclusive)
+
** Multiple choice questions
*# Write a for loop that prints out the first 10 odd numbers
+
** Free-response question(s)
* for Loop Practice 1 - Convert the following programs from a while loop to a for loop (due '''Monday (11/19/18)''')
+
* Recursion Review & Practice
*# Monte Carlo Pi
+
* Recursion Problems (prepare to submit to repl.it)
*# Taylor Series Pi and e
+
** public static int count(String s, String ch) - returns the number of occurrences of ch (single character string) within s
*# Looping exercises
+
** 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)
  
== Tuesday (11/13/18) ==
+
== Monday - Friday (12/31/18 - 1/4/19) ==
'''Agenda:'''
+
* Winter Break
* 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:'''
 
* 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) ==
 
* 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 - 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 07:03, 12 February 2019

Tuesday (2/12/19)

Agenda:

  • Class construction, object usage, & object arrays quiz
  • Complete and demo War Card "Game"/Simulation
    • Display how many cards each player has at the beginning of each round
    • You should display messages like "Player 1 reveals X of X"
    • Display a message of who wins each "round"
    • Display "I declare war!"
    • Display the eventual winner

Wednesday - Friday (2/6/19 - 2/8/19)

Agenda:

  • Complete and submit Poker Hands: Part 1 to repl.it
  • Introduction to ArrayLists
    • AP CS reference card for ArrayLists
    • eIMACS ArrayLists chapter review
    • Memorize / study ArrayList<E> instance methods
  • Processing - Ball example w/ ArrayLists
  • Processing - millis() timer example
  • Item Collection w/ ArrayLists
    1. Re-implement your Item Collection game so that it uses ArrayLists instead of arrays
    2. Start with an ArrayList of 1 robot, and add new robots every 3 seconds
    3. Start with an ArrayList of 5 items, and remove items when the player collides with them
  • ArrayList<Card> examples
  • War Card "Game"/Simulation
    1. Use NetBeans and create a new project for War
    2. The Main.java file will be the simulation
    3. Create a new Java class (name the file Card.java) and paste your Card class there
    4. Design and implement the game/simulation (we will design as a class)

Monday (2/4/19)

Agenda:

  • Demo Item Collection Game w/ Object Arrays
  • Complete Card class in repl.it (should be done today)
  • Work on Poker Hands: Part 1 in repl.it - due Thursday (2/6/19)

Thursday (1/31/19)

Agenda:

  • Demo Item Collection Game
  • Arrays of Objects
    • String arrays (review)
    • Ball class and Ball array
  • Item Collection Game w/ Object Arrays (assignment)
    1. Copy your Item Collection Game to a new Processing sketch
    2. Convert your item Sprites collected into an array
    3. Convert your robot Sprites into an array
    4. Demo your converted game on Monday (2/4/19)

Tuesday (1/29/19)

Agenda:

  • Item Collection Game - due Thursday (1/31/19)
    1. We will design a simple top-down item collection game using a new Sprite class (specified below)
    2. Find and download Sprite images of your choosing
    3. You can move the player sprite with the keyboard (wrap the player to the other side of the screen if you go off screen)
    4. The player sprite will be able to collect item sprites
    5. Robot sprites will follow the player around
    6. You win when you collect all the items
    7. You lose if a robot collides with your sprite
  • Sprite class (has similarities to the previous Sprite class)
    • Attributes:
      • double x, y (to be used for position)
      • double dx, dy (to be used for step size when moving -- always positive)
      • PImage img (stores the image)
      • boolean visible (default setting is true -- we will use this variable to track the Sprite's visibility state)
    • Constructors:
      • Sprite()
      • Sprite(String imgfile, double x, double y, double dx, double dy)
    • Methods:
      • void display() - if visible is true, then display the image
      • void moveLeft() - move x-coordinate to the left by dx amount
      • void moveRight() - move x-coordinate to the right by dx amount
      • void moveUp() - move y-coodrinate upwards by dy amount
      • void moveDown() - move y-coodrinate downwards by dy amount
      • boolean checkCollision(Sprite other) - returns true if this Sprite is colliding with the other Sprite (use previous Sprite class to help with this method)
      • void follow(Sprite other) - compare x and y coordinates of this Sprite with the other Sprite -- move this Sprite towards other Sprite by using the move____() methods

Tuesday - Thursday (1/22/19 - 1/24/19)

Agenda:

  • Dino Game example
    • We will convert the non-OOP version into an OOP version
    • Add another cactus to the dino game
  • Flappy Bird OOP
    • What modifications to our Sprite class do we need to make?
    • Here are some Flappy Bird sprite images here
    • Implement the OOP version of Flappy Bird in Processing
    • Bird will need to flap when a key is pressed
    • Pipes will need to move and wrap around the screen
    • Score increases when a pipe is passed (this will require something to be added to the Sprite class)
    • Lose when bird collides with a pipe or when the Bird goes too far below the screen
    • Due Thursday (1/24/19) -- last assignment of 2nd Quarter

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