Advanced Placement Computer Science (also called APCS) is the name of two distinct Advanced Placement courses and examinations offered by the College Board to high school students as an opportunity to earn college credit for a college-level computer science course. AP Computer Science A is meant to be the equivalent of a first-semester course in computer science, while AP Computer Science AB equates to a full year. The AP exam currently tests students on their knowledge of Java. The Advanced Placement Program is a program that offers college level courses at high schools across the United States and Canada. ... Each May, participating Canadian, American, and some international educational institutions offer the Advanced Placement examinations, the natural focal point of the Advanced Placement program. ... The CollegeBoard offers several awards to students who take AP exams. ... The Advanced Placement Program, commonly known as Advanced Placement, or AP, is a United States and Canada-based program that offers high school students the opportunity to receive university credit for their work during high school. ... AP Biology is a course offered by the College Board to high school students in the United States to earn credit for a college-level biology course. ... This article or section does not cite any references or sources. ... The Advanced Placement Chemistry (or AP Chemistry) course and the corresponding exam offered by the College Board as a part of the Advanced Placement Program allows United States high school students to potentially earn college-level credit in chemistry. ... The Advanced Placement Chinese Language and Culture (commonly known as AP Chinese Language and Culture or AP Chinese) course is offered by the College Board as a part of the Advanced Placement Program. ... This college-level course is both a survey of the various forms of government found throughout the world and an in-depth study of specific governments and approaches to politics. ... Advanced Placement English Language and Composition (or AP English Language and Composition or AP Lang ) is a course and examination offered by the College Board as part of the Advanced Placement Program. ... This article or section does not cite any references or sources. ... AP Environmental Science is for highly motivated students with interest in interdisciplinary science. ... This article or section cites very few or no references or sources. ... This course is for foreign language students interested in college-level courses or gaining advanced college credit. ... This course is for foreign language students interested in college-level work or credit. ... Categories: | ... This college-level course introduces students to the systematic study of patterns and processes that have shaped human understanding, use, and alteration of Earths surface. ... Categories: | ... Categories: | ... This course prepares students for the AP Latin Literature test. ... This article or section does not adequately cite its references or sources. ... This course is for advanced students interested in college-level work in economics and/or gaining advanced standing in college. ... Categories: | ... AP Physics B is an advanced placement science course that is separated into five different sections of study: Newtonian Mechanics, Electricity and Magnetism, Fluid Mechanics and Thermal Physics, Waves and Optics, and Atomic and Nuclear Physics. ... This article relates to the AP test. ... In collaboration with the College Board and with funding from the U.S. Department of Education and the National Security Education Program, an AP Russian Language and Culture course and exam is under development through the American Council of Teachers of Russian (ACTR). ... The AP Spanish Language exam is part of the College Boards Advanced Placement Program. ... The AP Spanish Literature exam is part of the College Boards Advanced Placement Program. ... AP Statistics students engage in the exploratory analysis of data, using graphical and numerical techniques. ... This article or section does not cite any references or sources. ... This article or section does not cite any references or sources. ... AP United States Government and Politics is a college-level course offered through the College Boards Advanced Placement Program, which surveys the structure and function of American government and politics that begins with an analysis of the Constitution, the foundation of the American political system. ... This article does not cite any references or sources. ... Advanced Placement (AP) is the term used to describe high school classes that are taught at a college level. ... The College Board is a not-for-profit examination board in the United States that was formed in the nineteenth century as the College Entrance Examination Board (CEEB). ... For other uses, see High school (disambiguation). ... College (Latin collegium) is a term most often used today to denote an educational institution. ... Computer science, or computing science, is the study of the theoretical foundations of information and computation and their implementation and application in computer systems. ... Java refers to a number of computer software products and specifications from Sun Microsystems (the Javaâ„¢ technology) that together provide a system for developing and deploying cross-platform applications. ...

AP Computer Science A

Advanced Placement Computer Science A emphasizes object-oriented programming methodology with an emphasis on problem solving and algorithm development. It also includes the study of data structures and abstraction, but these topics are not covered to the extent that they are covered in AP Computer Science AB. Object-oriented programming (OOP) is a programming paradigm that uses objects to design applications and computer programs. ... In mathematics, computing, linguistics, and related disciplines, an algorithm is a finite list of well-defined instructions for accomplishing some task that, given an initial state, will terminate in a defined end-state. ...

AP Computer Science AB

Advanced Placement Computer Science AB includes all the topics of AP Computer Science A, as well as a more formal and a more in-depth study of algorithms, data structures, and data abstraction. For example, binary trees are studied in AP Computer Science AB but not in AP Computer Science A. The use of recursive data structures and dynamically allocated structures is fundamental to AP Computer Science AB. Flowcharts are often used to represent algorithms. ... A binary tree, a simple type of branching linked data structure. ... In computer science, abstraction refers to two related, but different concepts. ... In computer science, a binary tree is an ordered tree data structure in which each node has at most two children. ... A common method of simplification is to divide a problem into subproblems of the same type. ... Dynamic Allocation, often called heap memory, is one of the types of memory allocation that happens inside of a computer program. ...

Topic Outline

• Object-Oriented Program Design
  • Problem Design
    • Read and understand a problem's description, purpose, and goals.
    • Specify the purpose and goals for a problem. (AB only)
    • Apply data abstraction and encapsulation.
    • Read and understand class specifications and relationships among the classes ("is-a", "has-a" relationships).
    • Decompose a problem into classes, define relationships and responsibilities of those classes. (AB only)
    • Understand and implement a given class hierarchy.
    • Identify reusable components from existing code using classes and class libraries.
  • Class Design
    • Design and implement a class.
    • Design and implement a set of interacting classes. (AB only)
    • Design an interface.
    • Choose appropriate data representation and algorithms.
    • Choose appropriate advanced data structures and algorithms. (AB only)
    • Apply functional decomposition.
    • Extend a given class using inheritance.
• Program Implementation
  • Implementation techniques
    • Methodology
      • Object-oriented development
      • Top-down development
      • Encapsulation and information holding
      • Procedural abstraction
  • Programming constructs
    • Primitive types vs. objects
    • Declaration
      • Constant declarations
      • Variable declarations
      • Class declarations
      • Interface declarations
      • Method declarations
      • Parameter declarations
    • Console output (System.out.print/println)
    • Control
      • Methods
      • Sequential
      • Conditional
      • Iterations
      • Recursion
  • Java library classes (included in the A or AB-level AP Java Subset)
• Program Analysis
  • Testing
    • Test classes and libraries in isolation
    • Identify boundary cases and generate appropriate test data
    • Perform integration testing
  • Debugging
    • Categorize errors: compile time, runtime, logic
    • Identify and correct errors
    • Techniques: use a debugger, add extra output statements, hand-trace code
  • Understand and modify existing code
  • Extend existing code using inheritance
  • Understand error handling
    • Understand runtime exceptions
    • Throw runtime exceptions (AB only)
  • Reason about programs
    • Preconditions and postconditions
    • Assertions
    • Invariants (AB only)
  • Analysis of algorithms
    • Informal comparisons of running times
    • Exact calculation of statement execution counts
    • Big-O notation (AB only)
    • Worst-case and average-case time and space analysis (AB only)
  • Numerical representations and limits
    • Representations of numbers in different bases
    • Limitations of finite representations (e.g., integer bounds, imprecision of floating-point representations, and round-off error)
• Standard Data Structures
  • Simple data types (int, boolean, double)
  • Classes
  • One-dimensional arrays
  • Two-dimensional arrays (AB only)
  • Linked lists (singly, doubly, circular) (AB only)
  • Stacks (AB only)
  • Queues (AB only)
  • Trees (AB only)
  • Heaps (AB only)
  • Priority queues (AB only)
  • Sets (AB only)
  • Maps (AB only)
• Standard Algorithms
  • Operations on data structures listed above
    • Traversals
    • Insertions
    • Deletions
    • Iterators (AB only)
  • Searching
    • Sequential
    • Binary
    • Hashing (AB only)
  • Sorting
    • Selection
    • Insertion
    • Mergesort
    • Quicksort (AB only)
    • Heapsort (AB only)
• Computing in Context
  • Major hardware components
    • Primary and secondary memory
    • Processors
    • Peripherals
  • System software
    • Language translators/compilers
    • Virtual machines
    • Operating systems
  • Types of systems
    • Single-user systems
    • Networks
  • Responsible use of computer systems
    • System reliability
    • Privacy
    • Legal issues and intellectual property
    • Social and ethical ramifications of computer use

Object-oriented analysis and design (OOAD) is often part of the development of large scale systems and programs often using the Unified Modeling Language (UML). ... In computing, an abstract data type (ADT) is a specification of a set of data and the set of operations that can be performed on the data. ... In computer science, the term inheritance may be applied to a variety of situations in which certain characteristics are passed on from one context to another. ... In database design and program architecture, Has-a is a relationship where one object belongs to another object, and behaves according to the rules of ownership. ... Look up Implementation in Wiktionary, the free dictionary. ... This does not cite any references or sources. ... Object-oriented programming (OOP) is a programming paradigm that uses objects to design applications and computer programs. ... Top-down and bottom-up are strategies of information processing and knowledge ordering, mostly involving software, and by extension other humanistic and scientific system theories (see systemics). ... In computer science, abstraction is a mechanism and practice to reduce and factor out details so that one can focus on a few concepts at a time. ... In computer science, primitive types, as distinct from composite types - are datatypes provided by a programming language as basic building blocks. ... In strictly mathematical branches of computer science the term object is used in a purely mathematical sense to refer to any thing. While this interpretation is useful in the discussion of abstract theory, it is not concrete enough to serve as a primitive datatype in the discussion of more concrete... In computer science, a declaration specifies a variables dimensions, identifier, type, and other aspects. ... In computer science and mathematics, a variable (IPA pronunciation: ) (sometimes called a pronumeral) is a symbolic representation denoting a quantity or expression. ... In computer science and mathematics, a variable (IPA pronunciation: ) (sometimes called a pronumeral) is a symbolic representation denoting a quantity or expression. ... In object-oriented programming, a class is a programming language construct that is used to group related instance variables and methods. ... An interface defines the communication boundary between two entities, such as a piece of software, a hardware device, or a user. ... In object-oriented programming, the term method refers to a subroutine that is exclusively associated either with a class (called class methods, static methods, or factory methods) or with an object (called instance methods). ... A parameter is a variable which can be accepted by a subroutine. ... Knoppix system console showing the boot process The system console, root console or simply console is the text entry and display device for system administration messages, particularly those from the BIOS or boot loader, the kernel, from the init system and from the system logger. ... // Information processing In information processing, output is the process of transmitting information by an object (verb usage). ... In computer science control flow (or alternatively, flow of control) refers to the order in which the individual statements, instructions or function calls of an imperative or functional program are executed or evaluated. ... Exit numbers on Interstate 4 in Volusia County, Florida. ... In computer science, conditional statements are a vital part of a programming language. ... Iteration is the repetition of a process, typically within a computer program. ... A visual form of recursion known as the Droste effect. ... Software testing is the process used to measure the quality of developed computer software. ... Debugging is a methodical process of finding and reducing the number of bugs, or defects, in a computer program or a piece of electronic hardware thus making it behave as expected. ... A syntax error refers to a mistake in a statements syntax. ... With a runtime error the program begins running, but then crashes or gets stuck pursuing a never ending calculation. ... Exception handling is a programming language construct or computer hardware mechanism designed to handle the occurrence of some condition that changes the normal flow of execution. ... In logic a precondition is a condition that has to be met, before a main argument can have any value. ... A postcondition is a fact that must always be true just after the execution of some section of code. ... The braces are included in the comment in order to help distinguish this use of a comment from other uses. ... In computer science, optimising compilers and the methodology of design by contract pay close attention to invariant quantities in computer programs, where the set of transformations involved is the execution of the steps of the computer program. ... The Big O notation is a mathematical notation used to describe the asymptotic behavior of functions. ... In computer science, best, worst and average cases of a given algorithm express what the resource usage is at least, at most and on average, respectively. ... YEH SAB JHOOT HAI>>>> DONT BELIVE THIS WRITER>>>>Information space analysis is a deterministic method, enhanced by machine intelligence, for locating and assessing resources for team centric efforts. ... The radix (Latin for root), also called base, is the number of various unique symbols (or digits or numerals) a positional numeral system uses to represent numbers. ... The integers are commonly denoted by the above symbol. ... This article or section is in need of attention from an expert on the subject. ... A round-off error, also called rounding error, is the difference between the calculated approximation of a number and its exact mathematical value. ... A binary tree, a simple type of branching linked data structure. ... On computer science, a datatype (often simply type) is a name or label for a set of values and some operations which can be performed on that set of values. ... In computer science, the term integer is used to refer to any data type which can represent some subset of the mathematical integers. ... The adjective Boolean [], coined in honour of George Boole, is used in many contexts: An evaluation that results in either of the truth values true or false. A Boolean value is a truth value, either true or false, often coded 1 and 0, respectively. ... In computing, double precision is a computer numbering format that occupies two storage locations in computer memory at address and address+1. ... In object-oriented programming, a class is a programming language construct that is used to group related instance variables and methods. ... In computer programming, an array, also known as a vector or list, is one of the simplest data structures. ... In computer science, a linked list is one of the fundamental data structures used in computer programming. ... Simple representation of a stack In computer science, a stack is a temporary abstract data type and data structure based on the principle of Last In First Out (LIFO). ... In providing services in computer science, transport, and operations research a queue (pronounced kyew) is a buffer where various entities such as data, objects, persons, or events are stored and waiting to be processed. ... A simple example unordered tree In computer science, a tree is a widely-used data structure that emulates a tree structure with a set of linked nodes. ... Example of a complete binary max heap In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if B is a child node of A, then key(A) ≥ key(B). ... A priority queue is an abstract data type supporting the following two operations: add an element to the queue with an associated priority remove the element from the queue that has the highest priority, and return it The simplest way to implement a priority queue data type is to keep... In computer science, the set is a collection of certain values without any particular order. ... An associative array (also map, hash, dictionary, finite map, lookup table, and in query-processing an index or index file) is an abstract data type composed of a collection of keys and a collection of values, where each key is associated with one value. ... In computer science, an iterator is an object which allows a programmer to traverse through all the elements of a collection, regardless of its specific implementation. ... In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. ... In computer science, linear search is a search algorithm, also known as sequential search, that is suitable for searching a set of data for a particular value. ... A binary search algorithm (or binary chop) is a technique for finding a particular value in a sorted list. ... A hash function is a reproducible method of turning some kind of data into a (relatively) small number that may serve as a digital fingerprint of the data. ... In computer science and mathematics, a sorting algorithm is an algorithm that puts elements of a list in a certain order. ... Selection sort is a sorting algorithm, specifically an in-place comparison sort. ... Example of insertion sort sorting a list of random numbers. ... In computer science, merge sort or mergesort is a sort algorithm for rearranging lists (or any other data structure that can only be accessed sequentially, e. ... Quicksort in action on a list of random numbers. ... A run of the heapsort algorithm sorting an array of randomly permuted values. ... Primary storage is a category of computer storage, often called main memory. ... In computer storage, secondary storage, or external memory, is computer memory that is not directly accessible to the central processing unit of a computer, requiring the use of computers input/output channels. ... A CPU The processor sub-system of a data processing system processes received information after it has been encoded into data by the input sub-system. ... For an account of the words periphery and peripheral as they are used in biology, sociology, politics, computer hardware, and other fields, see the periphery disambiguation page. ... A compiler is a computer program that translates a computer program written in one computer language (called the source language) into an equivalent program written in another computer language (called the output or the target language). ... In general terms, a virtual machine in computer science is software that creates an environment between the computer platform and the end user in which the end user can operate software. ... In computing, an operating system (OS) is the system software responsible for the direct control and management of hardware and basic system operations. ... This article or section is in need of attention from an expert on the subject. ... Reliable system design is the design of systems with high levels of reliability and availability. ... For the 2006 film, see Intellectual Property (film). ...

AP Computer Science exam

The AP exam currently tests students on their knowledge of Java. From 1999 to 2003, the exam tested students on their knowledge of C++ instead. Before 1999, the AP exam tested students on their knowledge of Pascal. Java refers to a number of computer software products and specifications from Sun Microsystems (the Javaâ„¢ technology) that together provide a system for developing and deploying cross-platform applications. ... C++ (pronounced see plus plus, IPA: ) is a general-purpose programming language with high-level and low-level capabilities. ... Pascal is an imperative computer programming language, developed in 1970 by Niklaus Wirth as a language particularly suitable for structured programming. ...

Although there are two AP Computer Science tests (A and AB), the format for both is exactly the same, composed of two sections:

• Section I: Multiple Choice [1 hour and 15 minutes for 40 multiple-choice questions]
• Section II: Free-Response [1 hour and 45 minutes for 4 problems involving extended reasoning]

Marine Biology Simulation Case Study

The Marine Biology Simulation Case Study is intended to be a substitute for writing a single large program as a culminating project. Due to obvious time restraints during the exam, the Marine Biology Simulation is provided by the College Board[1] to students prior to the exam. They are expected to be familiar with the classes and interfaces (and how they interact) before taking the exam. The case study is divided into five sections, the last of which is only tested on the AB exam.

Roughly five multiple-choice questions in Sections I are devoted to the MBSCS, and it is the topic of one free response question in Section II.

Starting in the 2007-08 school year, the MBCS has been replaced by GridWorld.

Grade distributions for AP Computer Science A

In the 2006 administration, 14,662 students took the exam from 2,101 schools. The mean score was a 2.91. The grade distribution for 2006 was:

Grade distributions for AP Computer Science AB

In the 2006 administration, 4,939 students took the exam from 1,144 schools. The mean score was a 3.38. The grade distribution for 2006 was:

External links

• College Board: AP Computer Science A
• College Board: AP Computer Science AB
• College Board: Marine Biology Case Study