AP Computer Science A 2/6/2018.

Slides:



Advertisements
Similar presentations
2.1 Program Construction In Java
Advertisements

Final and Static Keywords. Creating constants  There will be occasions where data items in a program have values that do not change.  Maximum score.
Introduction to Computers and Programming Lecture 4: Mathematical Operators New York University.
1 Modularity In “C”. 2 What is Modularity?  Modularity, is the heart of the high level, structured languages.  Means breaking down a big problem into.
JAVA: An Introduction to Problem Solving & Programming, 5 th Ed. By Walter Savitch and Frank Carrano. ISBN © 2008 Pearson Education, Inc., Upper.
Invitation to Computer Science, Java Version, Second Edition.
Summary of what we learned yesterday Basics of C++ Format of a program Syntax of literals, keywords, symbols, variables Simple data types and arithmetic.
CHAPTER 4: CONTROL STRUCTURES - SEQUENCING 10/14/2014 PROBLEM SOLVING & ALGORITHM (DCT 1123)
1 INTRODUCTION TO PROBLEM SOLVING AND PROGRAMMING.
Introduction to Methods Shirley Moore CS 1401 Spring 2013 cs1401spring2013.pbworks.com April 1, 2013.
Chapter 3: Developing Class Methods Object-Oriented Program Development Using Java: A Class-Centered Approach.
Building java programs, chapter 3 Parameters, Methods and Objects.
CHAPTER 2 PROBLEM SOLVING USING C++ 1 C++ Programming PEG200/Saidatul Rahah.
Chapter 4: More Object Concepts. Objectives Understand blocks and scope Overload a method Avoid ambiguity Create and call constructors with parameters.
CS100Lecture 61 Announcements Homework P1 due on Thursday Homework P2 handed out.
Chapter VII: Arrays.
Andrew(amwallis) Classes!
CS1010 Programming Methodology
Test 2 Review Outline.
3.1 Fundamentals of algorithms
Passing Objects to Methods
Structures Revisited what is an aggregate construct? What aggregate constructs have we studied? what is a structure? what is the keyword to define a structure?
3 Introduction to Classes and Objects.
Introduction to Classes and Objects
Chapter 6: Modular Programming
Lecture 7: Repeating a Known Number of Times
GC211Data Structure Lecture2 Sara Alhajjam.
Testing and Debugging.
Chapter 5 Functions DDC 2133 Programming II.
Chapter 5 Function Basics
Wrapper Classes ints, doubles, and chars are known as primitive types, or built-in types. There are no methods associated with these types of variables.
Methods The real power of an object-oriented programming language takes place when you start to manipulate objects. A method defines an action that allows.
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Class Constructor Recall: we can give default values to instance variables of a class The “numberOfPlayers” variable from the “PlayerData” class before.
Welcome to the Computer Science classes
7 Arrays.
Chapter 5 Function Basics
Programming Funamental slides
Writing Methods AP Computer Science A.
Video 6: Practice Papers for
Group Status Project Status.
Programming Funamental slides
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Unit 3 Test: Friday.
Problem Solving Skill Area 305.1
Recursion Chapter 11.
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Chapter 6 Methods.
Arrays, Part 1 of 2 Topics Definition of a Data Structure
CISC181 Introduction to Computer Science Dr
Solving Absolute Value Equations
Summary of what we learned yesterday
Fundamental Programming
2009 Test Key.
The Selection Structure
Classes and Objects Imran Rashid CTO at ManiWeber Technologies.
Solving Absolute Value Equations
AP Free Response Strategies
Solving Absolute Value Equations
Review of Previous Lesson
Solving Absolute Value Equations
Solving Absolute Value Equations
ENERGY 211 / CME 211 Lecture 8 October 8, 2008.
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Review for Midterm 3.
Selection Sort Insertion Sort if time
Welcome to the Computer Science classes
Solving Absolute Value Equations
Presentation transcript:

AP Computer Science A 2/6/2018

Learning Objectives Be able to solve AP Free Response Questions that involve one- and two- dimensional arrays. Be able to evaluate your solutions using the AP Computer Science A rubric

Outline Read over FRQ: ArrayTester (Found in the Assignments Folder. ArrayTester2_6_2019) Determine what it is asking Tasks: Write a summary of what the problem is asking Pre-condition for each method Post-condition for each method Pair, share, Improve (2X) Get up, meet someone, listen to their understanding of the problem, describe how you understand the problem. Modify your understanding as needed How will you solve it? Pseudo-code, algorithm Write a summary of how you propose to solve the problem Pair, Share, Improve Get up, meet someone, listen to their proposed solution, describe your proposed solution. Modify your solution as needed Write your final solution Pair, share, improve Grade your solution using the AP Rubric

AP FRQ Scoring Guidelines Apply the question assessment rubric first, which always takes precedence. Penalty points can only be deducted in a part of the question that has earned credit via the question rubric. No part of a question (a, b, c) may have a negative point total. A given penalty can be assessed only once for a question, even if it occurs multiple times or in multiple parts of that question. A maximum of 3 penalty points may be assessed per question. 1-Point Penalty v) Array/collection access confusion ([] get) w) Extraneous code that causes side-effect (e.g., printing to output, incorrect precondition check) x) Local variables used but none declared y) Destruction of persistent data (e.g., changing value referenced by parameter) z) void method or constructor that returns a value

No Penalty o Extraneous code with no side-effect (e.g., valid precondition check, no-op) o Spelling/case discrepancies where there is no ambiguity* o Local variable not declared provided other variables are declared in some part o private or public qualifier on a local variable o Missing public qualifier on class or constructor header o Keyword used as an identifier o Common mathematical symbols used for operators (× • ÷ < > <> ≠) o [] vs. () vs. <> o = instead of == and vice versa o length/size confusion for array, String, List, or ArrayList; with or without ( ) o Extraneous [] when referencing entire array o [i,j] instead of [i][j] o Extraneous size in array declaration, e.g., int[size] nums = new int[size]; o Missing ; where structure clearly conveys intent o Missing { } where indentation clearly conveys intent o Missing ( ) on parameter-less method or constructor invocations o Missing ( ) around if or while conditions

Other Scoring Notes *Spelling and case discrepancies for identifiers fall under the “No Penalty” category only if the correction can be unambiguously inferred from context, for example, “ArayList” instead of “ArrayList.” As a counterexample, note that if the code declares “int G=99, g=0;”, then uses “while (G < 10)” instead of “while (g < 10)”, the context does not allow for the reader to assume the use of the lower case variable.

Second Array FRQ: DiverseArray2015 Located in the Assignments Folder (DiverseArrayFRQ2_6_2019.pdf) Solve the problem as if you are taking the AP Exam. After you have completed the solution by hand Test your solution by adding the methods you created into the diversearray2015.java file found on the class website. Grade your solution using the AP Scoring Rubric