1 / 21

Agenda

AP Computer Science exam Ap Exam question types Ap scores calculation Topics for the AP exam Reviews of last semester materials homework. Agenda. AP Comp Sci exam schedule. May 7, 2013, Tuesday For more information on AP exam schedule and fees, follow the link below:

salvador-frederick
Download Presentation

Agenda

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. AP Computer Science exam • Ap Exam question types • Ap scores calculation • Topics for the AP exam • Reviews of last semester materials • homework Agenda

  2. AP Comp Sci exam schedule • May 7, 2013, Tuesday • For more information on AP exam schedule and fees, follow the link below: http://apcentral.collegeboard.com/apc/public/exam/calendar/index.html

  3. AP Exam • Section I time – 1 hours and 15 minutes number of questions - 40 percent of total grade – 50 • Section II time – 1 hours and 45 minutes number of questions - 4 percent of total grade – 50

  4. AP scores Multiple choices • Number correct(out of 40) = _____________ • ¼ x number wrong = _____________ • Raw score = line 1 – line 2 = ___________<=score 1 Free Response Question 1 _______________ Question 2 _______________ Question 3 _______________ Question 4 _______________ total ____ x 1.11 = ___________<=score 2

  5. Score 1 + score 2 = final score(round to nearest whole number) Equivalent AP grade Score range AP grade 60 - 80 5 45 - 59 4 33 – 44 3 25 – 32 2 0 – 24 1

  6. Topics covered in the exam I. Object-Oriented Program Design II. Program Implementation III. Program Analysis IV. Standard Data Structures VI. Computing in Context

  7. Exam strategies • Points are not deducted for incorrect answers => students are encouraged to answer all multiple-choice • The AP Computer Science A Exam will include several multiple choice questions based on the AP Computer Science Case Study • Materials testable/not testable: Refer to “ap-computer-science-course-description.pdf” file from my website under link downloads; Appendix A/B

  8. Materials need to be covered for the test • Representatins of numbers in different bases • Exceptions • String class + methods • Standard search: sequential vs binary • Standard sorts: selection, insertion and Merge sort • Data structure:simple data type, classes, lists, arrays • Standard algorithm- accessing array (traversing, inserting, deleting an array)

  9. IV. Standard Data Structures Data structures are used to represent information within a program. Abstraction is an important theme in the development and application of data structures. A. Simple data types (int, boolean, double) B. Classes C. Lists D. Arrays

  10. V. Standard Algorithms A. Operations on data structures previously listed 1. Traversals 2. Insertions 3. Deletions B. Searching 1. Sequential 2. Binary C. Sorting 1. Selection 2. Insertion 3. Mergesort

  11. Reviews • Variable types – primitive vs reference • Strings • If/switch statement • methods • loop structures • Arrays • Classes/objects • GridWrold

  12. Variable types • Primitive data types? • Reference data types? • Where do you put the data types? • What is the differences between these two types?

  13. Strings • Strictly speaking, not a primitive type, although we can write a statement like String aWord = “hello”; • Concatenation operator + converts any non-String data to a String object before joining the strings More about String class later in this semester

  14. If/switch • if <condition> { <statement>; } • switch (choice) { case 1: <statement>; break; case 4: …. } • switch (choice) { case ‘y’: <statement>; break; case ‘n’: …. }

  15. methods <access _ level> <return _ type> <name>(<parameters>) { <statements> } public double FromFarenheitToCelsius(double fTemp) { return (double)5/(double)9*(fTemp - 32); } How to call methods in the main program?

  16. Loop structure • while loop • do while loop • for loop • Enhanced for loop

  17. Arrays • 1 dimensional array int [] intArry = new int[10]; char[] charArry = new char[3]; Car[] carArry = new Car[2]; • 2 dimensional array int[][] intArry = new int[2][3]; char[][] charArry = new char[1][2]; Car[][] carArry = new Car[3][2];

  18. Class vs object • Class has property and behavior. Property => state/instance variables Behaviors => methods(accessor method, mutator methods, helper methods) • Object is an instance of a class • “is-a” relationship: Inheritance; classes that are derived from existing classes => • “has-a” relationship: Classes that contains a class member variable.

  19. GridWorld Grid <interface> Actor Location Flower Bug Critter Rock AbstractGrid BoxBug ChameleonCritter BoundedGrid UnboundedGrid

  20. Homework • Preview BPJ 14, Barron’s P54-56 • BPJ 35 Matrix Multiplication project Level 1 – put the 3 tables into 3 2-dimensional arrays and use two for loops to print them out. Level 2 – level 1 work + contest type problems. Level 3 – write the whole project, but you don’t need to write the class, just use main() to do everything; follow my algorithm mentioned in class to write the codes, otherwise you got only half score.

  21. Matrix Multiplication • Look at Appendix AA [ 1 2 -2 0] [-1 3 ] [-3 43] [-3 4 7 2] X [ 0 9 ] = [18 -60] [6 0 3 1 ] [ 1 -11] [ 1 -5 ] [ 4 -5 ] 1*(-1) + 2*0 + (-2) * 1 + 0 * 4 = -3 c(0,0) = a(0,0) * b(0,0) + a(0,1) *b(1,0)+a(0,2)*b(2,0) + a(0,3) * b(4,0)

More Related