AP Java Resources
|
Class Notes/Activities
ap_computer_science_a_syllabus.doc | |
File Size: | 37 kb |
File Type: | doc |
AP Testing Registration and Payment
This is a reminder, West Salem High School is now taking registration and payments for 2022 AP Testing. Please click on this link to register and make a payment. https://www.totalregistration.net/Exam-Registration-Services/Exam-Student-Payment.php The price per test is currently $96 until Nov. 9th. After November 9th, each test will cost $136 which includes a late fee. Make sure to notify your AP teacher if you plan to take the test so we can get them ordered. Enjoy the week! |
Read and take notes on Recursion lessons 70, 71 and 72. Then complete one of the code options posted in OnlineGDB.
|
Semester 2
Past Material
AP Test Registration 3/6/2021 Deadline
Cost for AP Exam is $96
2/11-2/12/2021 Project GroupComplete one of the following:
1) Dice Project 2) Statistics Package |
2/11-2/12 Variables, Input and MathInput and Math #1: Complete one of the following
1) Mile to inch: YourNameMileToInch Input: The number of miles traveled Output: The equivalent distance converted to inches 5280 feet per mile, 12 inches per foot 2) Change: YourNameChange Input: The amount of change in pennies Output: The least amount of coins it takes to make the change. Example: Input: 66 cents Output: To get 66 cents you need: 2 Quarters 1 Dime(s) 1 Nickel(s) 1 Cent(s) Input and Math #2 Complete one of the following 1) Quadratic formula Input: a, b and c (of type double) Output: The positive root (-b + sqrt(b2 – 4ac))/(2a) 2) Distance formula Input: The x and y coordinates for two points Output the distance between the points: Distance = sqrt((y1-y2)2 + (x1-x2)2) Push: Calculate the distance between two points that are on a 3-D grid. That is they have an x, y, and z value. 3) Given the lengths of three sides of a triangle, find the area of the triangle. Find a way to calculate this even if it is not a right triangle. (Do a little research) |
2/23-2/24/2021
Static Methods |
If/Else |
Complete any two of the following
1) Song: (void, no parameters) Write a program that has methods for chorus, first verse, second verse, … for a song of your choice. The main body will call each of the methods for the song 2) Average Method. (double, no parameters) Write a program that has a method. In the method the user will input an unknown number of scores, then the average of the scores will be calculated and returned to the main body. The main body will then shows the average. 3) Roly Poly (int, one parameter) Write a program with a method that is sent an integer, then rolls a pair of dice 1000 times and returns how often that number is rolled. Include a main method that gets the initial value from the user, calls the method and displays how often the roll occured. |
Complete one of the two programs
1) Modify the quadratic equation program to also calculate imaginary roots. If b2 – 4ac >= 0 then display the real roots Else show the imaginary roots 2) Input three real numbers, and print the numbers in sorted order. Complete one of the two programs 1) Write a program that inputs a persons name, rate of pay, and the number of hours worked during the week. The program will calculate the pay for the person. For every hour of overtime work (over 40 hours in the week) the person gets paid 150 percent of the regular wage. Example: Input: Sue, $10.00 per hour rate, 45 hours Calculation: pay = 10*40 + 1.5*10*5 = $475 2) Input a value representing a person’s percent score (example inputting 80 represents an 80% score), write a program that will output the corresponding letter grade. ‘A’ for 90-100, ‘B’ for 80 to 89, etc. |
2/25-2/25/2021 Arrays |
For loop |
Array Program : Complete one of the following
1) Input: 10 scores Output: The number of scores within 10 points of the average of the 10 scores. (You’ll need to calculate the average before going back and seeing which scores are within 10 points of the average.) 2) Create a random restaurant selection generator using an array to store the restaurant options. Using a while loop (so the user can be try again if they do not like the computers suggestion) have the computer display one of at least 5 random restaurants each time the user would like. |
Assignments:
Complete the fix if program Complete one of the following: 1) Enter 10 scores. Output the total, average, highest and lowest score. 2) Enter 5 ages and calculate the number of teenagers in the list. |
3/2-3/3/2021 More Arrays and Selection Sort |
Strings |
Complete the following program
Input 11 scores in main body Output: Numbers in sorted order (Low to High): Method Mean (average): Method Median (Middle number after sorting): Method Pushes: Find the mode: The most often occurring value. Multiple modes? No mode? Let the user tell you how many scores prior to entering the scores Add a method that will return an array of the 5 highest scores. Add a method that will return the modified average. If the pre-sorted scores are in increasing order (continual improvement), it will return the average of the top 3 scores, otherwise with will return the entire average. |
Complete one of the Following
1) Find last name Input first and last name into one String Output only the last name. Push: Support middle names 2) Input a word, output whether it is a palindrome.(Is spelled the same forward and backward.) Examples of Palindromes evilolive racecar 3) English to Pig-Latin translation program. The rules of Pig Latin are If the word begins with a consonant -- such as ``string,'' ``Latin'' -- divide the word at the first vowel, swapping the front and back halves and append ``ay'' to the word -- ``ingstray,'' ``atinLay.'' If the word begins with a vowel -- such as ``am,'' ``are,'' ``i'' -- append ``yay'' to the word -- ``amyay,'' ``areyay,'' ``iyay.'' If the word has no vowels (other than 'y') -- such as ``my,'' ``thy'' -- append ``yay'' to it -- ``myyay,'' ``thyyay.'' Level 1, Translate a single word Level 2: Translate a sentence. |
3/4-3/5/2021 Selection Sort Day 2
Complete the FixArray Program as well as the Selection Sort Program described above.
|
Write the code for one of the following
1) Write the code to find and display the last occurrence of a given string in a phrase. If the given string is not found, then a -1 is displayed. Assume: str.length()>0 Example: phrase = “A cat ate late.” string = “at” returns 11 string = “cat” returns 2 string = “bat” returns -1 2) Write a program that finds the nth occurrence of a given string in a phrase and returns -1 if the nth occurrence does not exist. Assume str.length() > 0 and n>0 Example: phrase =”A cat ate late.” string = “at”, n = 2, return 6 string = “at”, n = 3, return 11 string = “blue”, n=3 return -1 3) Write a program that replaces the nth occurrence of a string in a phrase. If the nth occurrence does not exist, the phrase is not changed. Assume str.length()>0 and n>0. Example: Phrase = “A cat ate late.”, string = “at”, n=1, replaceWith = “rane” Output: “A crane ate late” |
AP CS 3/9-3/10/2021 |
Wed/Friday Cohort: Random and while |
Assignment Tu/Th Cohort
Fix Selection Sort Names Finish Selection Sort Program from 3/2-3/3/2021 |
Assignments Wed/Fri Cohort
Complete one of the following 1) Flip a coin 100 times, show the total number of heads and tails AND which occurred the most often. 2) Roll a pair of 6-sided dice 100 times. Find out which occurs most often, 3 or 11. Show how often each of these rolls occur and which occurs most often. Complete one of the following 1) Input: An unknown number of integers. Output: The total , average, high and low values. 2) Input: None Process: Roll a pair of six-sided dice and count how many rolls it takes for you to roll three sevens in a row. Output: Each roll and the count for the number of rolls it takes to roll three sevens in a row. 3) Input: An unknown number of integers representing light sensor readings. Output: A running average of the three most recent readings. Determine how you will handle the first two readings and include your approach in your header notes. Push: Modify the program so the user can enter how many readings to consider when calculating the average. |
3/15-3/16/2021 Tu/Th Cohort Insertion Sort |
W/F Cohort: Static Methods |
|
Complete any two of the following
1) Song: (void, no parameters) Write a program that has methods for chorus, first verse, second verse, … for a song of your choice. The main body will call each of the methods for the song 2) Average Method. (double, no parameters) Write a program that has a method. In the method the user will input an unknown number of scores, then the average of the scores will be calculated and returned to the main body. The main body will then shows the average. 3) Roly Poly (int, one parameter) Write a program with a method that is sent an integer, then rolls a pair of dice 1000 times and returns how often that number is rolled. Include a main method that gets the initial value from the user, calls the method and displays how often the roll occured. |
Using the Insertion Sort Video and the Google Slides document take notes on the Insertion sort and complete the following program.
Assignment Phoney book for an unknown # (<100) Names Write a program with a menu with the following choices. Add a name: Semantics of a while loop. Method or in main body. Show all names : Method Sort the names: Method using the Insertion Sort Pushes: Figure out how to store a name and phone number. This will make the program a bit more useful. Find a name. The user will enter a name and the program will find their phone number, or tell the user they are not in the list. Enhance the find part to handle some sort of misspelling. Extra letters, Case insensitive, … Describe what errors your method will be able to handle. Create a class People that will have fields for name, phone, and email. Create an array of People rather than an array of String for the above program. |
3/17-3/18/2021
T/Th Cohort |
W/F Cohort: Arrays Day 1 |
Catch up day
|
Complete one of the following:
1) Input: 10 scores Output: The number of scores within 10 points of the average of the 10 scores. (You’ll need to calculate the average before going back and seeing which scores are within 10 points of the average.) 2) Create a random restaurant selection generator using an array to store the restaurant options. Using a while loop (so the user can be try again if they do not like the computers suggestion) have the computer display one of at least 5 random restaurants each time the user would like. |
3/30/2021 Tu/Th Cohort |
W/Fr Cohort: Arrays Day 2 |
Assignment:
1) Fix unknown number of names into an array |
Assignment:
1) Fix unknown number of names into an array 2) Complete one of the following programs a) Write a program that will roll a pair of 6-sided dice 3600 times and will… Show how often each roll occurred (Use a for..each loop) Show which roll occurred most often Show which roll occurred least often b) Write a program that will input 9 numbers and calculates and shows the standard deviation. |
4/7/2021 W/F Cohort Selection SortComplete the following
1) Fix Selection Sort program to sort 5 names 2) Write the code for the following a) Input 11 scores in main body Output: Numbers in sorted order (Low to High): Method Mean (average): Method Median (Middle number after sorting): Method Pushes: Find the mode: The most often occurring value. Multiple modes? No mode? Let the user tell you how many scores prior to entering the scores Add a method that will return an array of the 5 highest scores. Add a method that will return the modified average. If the pre-sorted scores are in increasing order (continual improvement), it will return the average of the top 3 scores, otherwise with will return the entire average. |
4/15-4/16/2021 Introduction to Objects (Both Cohorts)
Assignment:
1) Add the following to the example project. a) A default constructor that sets the numerator to 1 and the denominator to 1 b) Accessor methods. Sent nothing, but returns their values getNumerator (public int getNumerator()) getDenominator c) Mutator Methods: Sent an integer to replace the... setNumerator (public void setNumerator(int newValue) setDenominator d) Modify the Application method to demonstrate the additions to Fraction works. 2) Level 2 Complete one of the following: mult method. Sent an integer and changes the instance variables accordingly. public void mult(int num) add method: Sent an integer and changes the instance variables accordingly. public void add(int num) multFrac method that is sent a Fraction object and changes the instance variables accordingly. public void multFrac(Fraction num) |
4/20-4/21/2021 Methods: Overloaded, Static, Non-Static
4/22-4/23/2021 Imaginary Number Class
1) Create a Complex Number Class and Application to Demonstrate it works
a) Complex Class
Instance Variables
double realPart
double imaginaryPart
Constructors
Default
Sent a real part and an imaginary part
Methods
String toString()
void add(Complex number)
void integerDivide(int)
int compareTo(Complex)
Compare the magnitude. For the complex number a+bi it’s magnitude is sqrt(a^2 + b^2)
d.compareTo(e) >0 when d>e
d.compareTo(e) <0 when d<e
d.compareTo(e) ==0 when d==e
b) Application
Create an application using Complex Numbers for one of the following
i) Total, average, highest and lowest.
Input an unknown number of imaginary numbers and output the total, average, highest and lowest values entered.
ii) Blow up or not
Input a complex number c such that both the real and imaginary parts are less than 2. (Like c = 1 + 1i, or c = 0.3 + -0.5i, …)
Apply the following algorithm until it blows up, gets bigger than 2or stays below 2 for 20 iterations.
f(z) = z^2 + c where z starts as 0+0i. See Mandelbrot video for examples.
Output: The number of iterations to blow up or that it did not blow up.
iii) Push
Have the program enter the values such that the real part goes from -2 to 2 by 0.1 and for each of these the imaginary part goes from -2 to 2 by 0.1.
Push: Show the results as a grid
Write the code to generate the Mandelbrot set (Complete Blow-up push first) be setting the number based on the number of iterations to blow up.
Complex class Extensions
Methods
Mutators/Setters
void setRealPart(double)
void setImagPart(double)
Getters
double getRealPart()
double getImagPart()
void pow(int)
Raises the imaginary number to an integer power.
var.pow(2) will square the imaginary variable var.
a) Complex Class
Instance Variables
double realPart
double imaginaryPart
Constructors
Default
Sent a real part and an imaginary part
Methods
String toString()
void add(Complex number)
void integerDivide(int)
int compareTo(Complex)
Compare the magnitude. For the complex number a+bi it’s magnitude is sqrt(a^2 + b^2)
d.compareTo(e) >0 when d>e
d.compareTo(e) <0 when d<e
d.compareTo(e) ==0 when d==e
b) Application
Create an application using Complex Numbers for one of the following
i) Total, average, highest and lowest.
Input an unknown number of imaginary numbers and output the total, average, highest and lowest values entered.
ii) Blow up or not
Input a complex number c such that both the real and imaginary parts are less than 2. (Like c = 1 + 1i, or c = 0.3 + -0.5i, …)
Apply the following algorithm until it blows up, gets bigger than 2or stays below 2 for 20 iterations.
f(z) = z^2 + c where z starts as 0+0i. See Mandelbrot video for examples.
Output: The number of iterations to blow up or that it did not blow up.
iii) Push
Have the program enter the values such that the real part goes from -2 to 2 by 0.1 and for each of these the imaginary part goes from -2 to 2 by 0.1.
Push: Show the results as a grid
Write the code to generate the Mandelbrot set (Complete Blow-up push first) be setting the number based on the number of iterations to blow up.
Complex class Extensions
Methods
Mutators/Setters
void setRealPart(double)
void setImagPart(double)
Getters
double getRealPart()
double getImagPart()
void pow(int)
Raises the imaginary number to an integer power.
var.pow(2) will square the imaginary variable var.
Practice FRQ Question
freeresposepracticeHiddenWord.docx | |
File Size: | 50 kb |
File Type: | docx |
ArrayLists 5/4-5/5/2021
Complete one of the following:
1) Input: An unknown number of names.
Output: The names in reverse order
Push: Add a check method that will get a name from the user and see if they are in the list.
2) Create a Person class
Instance Variables: Name, age
Constructors (Default and with values), toString(), methods getName() and getAge()
Application Program: Input an unknown number of Person’s into an ArrayList, output the names of the Person’s that are younger than the average age.
AND
Complete the 'Boolean and Conditional' Practice MC Question Worksheet. (Handed out in class)
1) Input: An unknown number of names.
Output: The names in reverse order
Push: Add a check method that will get a name from the user and see if they are in the list.
2) Create a Person class
Instance Variables: Name, age
Constructors (Default and with values), toString(), methods getName() and getAge()
Application Program: Input an unknown number of Person’s into an ArrayList, output the names of the Person’s that are younger than the average age.
AND
Complete the 'Boolean and Conditional' Practice MC Question Worksheet. (Handed out in class)
Recursion + Methods and Control Structures Review : Thursday/Friday 5/6-7/2021
Assignment:
1) Complete one of the following a) Factorial using recursion Input: A positive integer Output: It’s factorial: Example: Input 6 Output: 6 ! = 6*5*4*3*2*1 = 720 b) Input: 10 names into an array Output: The names in reverse order recursively, in the subroutine c) Finding the Greatest Common Factor using the Euclidean Algorithm If b goes into a, then the GCF(a,b) is b If b does not go into a, then GCF(a,b) = GCF(b, a MOD b) Example: GCF(28,8) since 28 MOD 8 = 4 GCF(8,4), since 4 goes into 8, GCF(8,4) = 4. GCF(28,8) = 4 2) Complete the 'Recursion problems' Worksheet (Handed out in class) 3) Watch and take notes on the Methods and Control Structures Video In this video, we will review CSA practices and skills and examine Methods and Control Structures. We will also review Boolean expressions, method calls, loops, and conditionals. |
|
How to Implement Java Quick Reference: Monday 5/10/2021
Assignment:
In this video, we will review the Java Quick Reference, as well as the relationship between classes and objects. Using a past FRQ, we will examine class constructors and method header syntax. |
|
Inheritance and How to use Algorithms with Arrays and Array/ArrayList: Tuesday-Wednesday 5/11-12/2021
In this video, we will review algorithms using Arrays and Array/ArrayList. We will look at for loops and enhanced for loops, and discuss the construction and transversal of ArrayLists.
Assignment: 1) Complete Inheritance Program Add two more classes of animals Enhance each class with at least one more instance variable. At least one of these classes must extend another class you created. Create a driver class (application, public static void main…) that will demonstrate that your classes are working. Share the project with [email protected] Push: Create a group of animals in the application. Array, Arraylist, A Barn class that stores several animals, … 2) Complete the 'Data Structures problems' Worksheet. |
|
Inheritance and Exam Details and Strategies for 2021 and 2D Arrays: Thursday-Friday 5/13-14/2021
In this video, we will review strategies for the 2021 AP Exam and explore a 2D array FRQ. We will also discuss nested for loops and review techniques and uses of 2D array transversals.
Assignment: 1) Inheritance Program Complete the Abstract Card project from the Presentation. 2) Complete the 'Code Trace' MC Practice Worksheet |
|
Methods and Control Structures: Loops and Conditionals: Monday 5/17/2021
In this video, we will explore using AP Daily videos for exam prep and review a Methods and Control Structures FRQ. We will discuss class methods, method calls, loops, and conditionals.
|
|
Abstract Classes and Class Inheritance and Digital Exam 2021 Information: Tuesday-Wednesday 5/18-19/2021
In this video, we will review the digital exam 2021 information and examine a Class Inheritance FRQ. We will review super and subclasses, class constructors, and floating-point arithmetic.
Assignment: 1) Complete the given MC Practice Problems 2) Join the AP CS online course. Use the pdf below and the class code Q3AEMX. 3) With parent's permission. Download the AP Central Testing App. (See link below)
|
|
Free Response Question Practice + How to Search and Sort with Arrays/ArrayLists: Thursday-Friday 5/20-21/2021
In this video, we will review binary search, sequential search, merge sort, selection sort, and insertion sort. We will also discuss the construction and transversal of ArrayLists and arrays.
Assignment: 1) Complete Free Response Question Activities
that sums row row in the 2D array called array. Then, traverse array to print the sum of each row in the 2D array. 2. The last element in each array in a 2D array is incorrect. It’s your job to fix each array so that the value 0 is changed to include the correct value. In the first array, the final value should be the length of the first array. In the second array, the final value should be the sum of the first value, and the second to last value in the array. In the third array, the final value should be the length of the 2D array. 3. Create a method called fixArray(int[][] array, int row, int col, int value) that sets the [row][column] to the correct value. Then, call the fixArray method three times - once for each value change that you are supposed to make. When inputting values to fixArray, you will have to hard code the row value, but the column value and the new value should be set using the array accessor methods. For example, if we wanted to set the value of the first index in the first array to the length of the 2D array, we would write: fixArray(array, 0, 0, array.length) 2) Complete the 'Algorithm' worksheet
|
|
Recursion and Endorsed Providers: Monday 5/24/2021
In this video, we will look at using endorsed provider resources for exam prep. We will also review MCQs on recursion and address techniques and uses of 2D array traversals.
|
|
Practice Exams 5/25-5/28
Assignment:
1) Prepare for AP Exam
a) Install Digital Exam Application
b) Complete the Practice Exam using Digital Testing Application
c) Complete Exam Setup (5/29-5/31/2021)
2) Complete and score FRQs
a) 2019 #1, #2
b) Complete the practice 'Demo'
b) 2018 #2, #4
3) Test Day
Be in room C204, logged in, ready to go by 12:30 pm
The exam starts at 1:00 pm
1) Prepare for AP Exam
a) Install Digital Exam Application
b) Complete the Practice Exam using Digital Testing Application
c) Complete Exam Setup (5/29-5/31/2021)
2) Complete and score FRQs
a) 2019 #1, #2
b) Complete the practice 'Demo'
b) 2018 #2, #4
3) Test Day
Be in room C204, logged in, ready to go by 12:30 pm
The exam starts at 1:00 pm
|
2019 Scoring Guide
2018 Scoring Guide
|
AP Exam 6/1/2021!!!
Room C204
By in your seat, logged in , ready to go by 12:30 pm for the 1:00 pm exam.
6/2-6/15/2021
RoboCode
|
|
Past AP CS Material
ap_javadayOne.ppt | |
File Size: | 6771 kb |
File Type: | ppt |
|
|
javavariablesandinput.ppt | |
File Size: | 431 kb |
File Type: | ppt |
ap_javaif-else.ppt | |
File Size: | 251 kb |
File Type: | ppt |
fixIf.java | |
File Size: | 0 kb |
File Type: | java |
|
|
|
|
stringsdayone.ppt | |
File Size: | 471 kb |
File Type: | ppt |
apjavastringreview.pptx | |
File Size: | 83 kb |
File Type: | pptx |
|
|
javaswingNonAP.ppt | |
File Size: | 240 kb |
File Type: | ppt |
aprandomwhile10-1-2019.pptx | |
File Size: | 280 kb |
File Type: | pptx |
|
|
|
Mid-Term
Complete the Practice Midterm
- When completed, check your answers with at least one other person in class and correct as needed. - If there is time, write your code in BlueJ to test - Refine your notes as needed to prepare for the Midterm. |
|
MidTerm
1) Complete the mid-term exam and turn it into the Macintosh.
2) Read and take notes on the 'java_methods10-17-2019.ppt' PowerPoint
- Focused notes
- Complete the Dry Run activities
- Work on the coding activities. There are three sets of programs. There will be time on Monday to work on this
2) Read and take notes on the 'java_methods10-17-2019.ppt' PowerPoint
- Focused notes
- Complete the Dry Run activities
- Work on the coding activities. There are three sets of programs. There will be time on Monday to work on this
java_methods.ppt | |
File Size: | 797 kb |
File Type: | ppt |
javafirstdaywithobjects.ppt | |
File Size: | 338 kb |
File Type: | ppt |
ap_class_methods.pptx | |
File Size: | 5120 kb |
File Type: | pptx |
Focused Note Taking on ObjectsClick on 'Intro to Objects' and take notes on Chapter 25 and 26.
Some of the Vocabulary Object, Class, Static Methods, Dot Notation, Constructors, primitive, reference variable, garbage, .equals, == |
Overview of three Focused Note Taking Strategies |
introtoobjectsstudent.ppt | |
File Size: | 2566 kb |
File Type: | ppt |
|
|
|
objectsstaticfieldsfunctionoverloading.ppt | |
File Size: | 389 kb |
File Type: | ppt |
|
|
|
|
|
|
|
|
Magpie Videos
Introduction
|
|
|
Magpie Activity 5
After completing Magpie Parts 1-4, use the 'Arrays Getting Started' link below to become familiar with arrays. Then complete Magpie Activity 5.
|
|
arraysstudent.ppt | |
File Size: | 409 kb |
File Type: | ppt |
javaarraysdaytwo.ppt | |
File Size: | 362 kb |
File Type: | ppt |
apjavapracticemidtermTwo.docx | |
File Size: | 30 kb |
File Type: | docx |
apcs1_7_2020.pptx | |
File Size: | 40 kb |
File Type: | pptx |
|
selectionsort.pptx | |
File Size: | 75 kb |
File Type: | pptx |
|
|
End of Semester Q3
insertionsort.ppt | |
File Size: | 416 kb |
File Type: | ppt |
ap_java_methodsinsertionsort.pptx | |
File Size: | 124 kb |
File Type: | pptx |
commonarrayalgorithms-sieve12-14.ppt | |
File Size: | 436 kb |
File Type: | ppt |
arraylists.ppt | |
File Size: | 380 kb |
File Type: | ppt |
arraylists11_30_2018.ppt | |
File Size: | 290 kb |
File Type: | ppt |
arraylist12-3-2018.pptx | |
File Size: | 44 kb |
File Type: | pptx |
arraylist12-3-2018.pptx | |
File Size: | 44 kb |
File Type: | pptx |
arraysdaytwo12_10_2018.ppt | |
File Size: | 158 kb |
File Type: | ppt |
javaarraysday12-12-2018.ppt | |
File Size: | 368 kb |
File Type: | ppt |
|
|
TestFormatterFRQ.pdf | |
File Size: | 37 kb |
File Type: |
|
|
apcstestcorrections.docx | |
File Size: | 15 kb |
File Type: | docx |
|
|
csbinary.ppt | |
File Size: | 310 kb |
File Type: | ppt |
First Semester Practice Final
javapracticefinal1-19.doc | |
File Size: | 55 kb |
File Type: | doc |
java2darraysmagicsquare1-17-2017.ppt | |
File Size: | 840 kb |
File Type: | ppt |
ap-java12-10-2015ObjectsFractionClass.ppt | |
File Size: | 189 kb |
File Type: | ppt |
ap_java12-15-2015contnuefractionclass.ppt | |
File Size: | 216 kb |
File Type: | ppt |
apjavaumldiagramtextformatterclass1-5-2016student.ppt | |
File Size: | 452 kb |
File Type: | ppt |
freeresposepracticeHiddenWord.docx | |
File Size: | 50 kb |
File Type: | docx |
inheritance1-11-2016.ppt | |
File Size: | 503 kb |
File Type: | ppt |
ap_javainheritancedayThree1-14-2016.pptx | |
File Size: | 66 kb |
File Type: | pptx |