Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

AP Computer Science A

Index AP Computer Science A

Advanced Placement Computer Science A (also called AP Comp Sci, AP Comp Sci A, or AP Java) is an AP Computer Science course and examination offered by the College Board to high school students as an opportunity to earn college credit for a college-level computer science course. [1]

103 relations: Abstract data type, Abstraction (computer science), Algorithm, AP Computer Science, AP Computer Science A, Array data structure, Assertion (software development), Associative array, Auxiliary memory, Best, worst and average case, Big O notation, Binary search algorithm, Binary tree, Boolean data type, C++, Central processing unit, Class (computer programming), Colgate University, College, College Board, Compiler, Computer data storage, Computer network, Computer science, Conditional (computer programming), Control flow, Conway's Game of Life, Data structure, Data type, Debugging, Declaration (computer programming), Double-precision floating-point format, Encapsulation (computer programming), Exception handling, Fire Emblem, Floating-point arithmetic, Four Lords of the Diamond, GeekWire, Glossary of computer science, Has-a, Hash function, Heap (data structure), Heapsort, Implementation, Information space analysis, Inheritance (object-oriented programming), Input/output, Insertion sort, Integer, Integer (computer science), ..., Intellectual property, Interface (computing), Invariant (computer science), Is-a, Iteration, Iterator, Java (programming language), Java (software platform), Java applet, Linear search, Linked list, Logic error, Memory management, Merge sort, Method (computer programming), Microsoft, Null pointer, Object (computer science), Object-oriented analysis and design, Object-oriented programming, Operating system, Pac-Man, Parameter (computer programming), Pascal (programming language), Peripheral, Postcondition, Precondition, Primitive data type, Priority queue, Queue (abstract data type), Quicksort, Radix, Recursion, Recursion (computer science), Reliability engineering, Round-off error, Search algorithm, Secondary school, Selection sort, Sequence, Set (abstract data type), Software development process, Software testing, Sorting algorithm, Stack (abstract data type), Syntax error, System console, Technology Education and Literacy in Schools, Tetris, Top-down and bottom-up design, Tree (data structure), Variable (computer science), Virtual machine. Expand index (53 more) »

Abstract data type

In computer science, an abstract data type (ADT) is a mathematical model for data types, where a data type is defined by its behavior (semantics) from the point of view of a user of the data, specifically in terms of possible values, possible operations on data of this type, and the behavior of these operations.

New!!: AP Computer Science A and Abstract data type · See more »

Abstraction (computer science)

In software engineering and computer science, abstraction is.

New!!: AP Computer Science A and Abstraction (computer science) · See more »

Algorithm

In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.

New!!: AP Computer Science A and Algorithm · See more »

AP Computer Science

In the United States, Advanced Placement Computer Science is a suite of Advanced Placement courses and examinations covering areas of computer science.

New!!: AP Computer Science A and AP Computer Science · See more »

AP Computer Science A

Advanced Placement Computer Science A (also called AP Comp Sci, AP Comp Sci A, or AP Java) is an AP Computer Science course and examination offered by the College Board to high school students as an opportunity to earn college credit for a college-level computer science course.

New!!: AP Computer Science A and AP Computer Science A · See more »

Array data structure

In computer science, an array data structure, or simply an array, is a data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key.

New!!: AP Computer Science A and Array data structure · See more »

Assertion (software development)

In computer programming, an assertion is a statement that a predicate (Boolean-valued function, i.e. a true–false expression) is always true at that point in code execution.

New!!: AP Computer Science A and Assertion (software development) · See more »

Associative array

In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection.

New!!: AP Computer Science A and Associative array · See more »

Auxiliary memory

Auxiliary memory, also known as auxiliary storage, secondary storage, secondary memory or external memory, is a non-volatile memory (does not lose stored data when the device is powered down) that is not directly accessible by the CPU, because it is not accessed via the input/output channels (it is an external device).

New!!: AP Computer Science A and Auxiliary memory · See more »

Best, worst and average case

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.

New!!: AP Computer Science A and Best, worst and average case · See more »

Big O notation

Big O notation is a mathematical notation that describes the limiting behaviour of a function when the argument tends towards a particular value or infinity.

New!!: AP Computer Science A and Big O notation · See more »

Binary search algorithm

In computer science, binary search, also known as half-interval search,logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array.

New!!: AP Computer Science A and Binary search algorithm · See more »

Binary tree

In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the and the.

New!!: AP Computer Science A and Binary tree · See more »

Boolean data type

In computer science, the Boolean data type is a data type that has one of two possible values (usually denoted true and false), intended to represent the two truth values of logic and Boolean algebra.

New!!: AP Computer Science A and Boolean data type · See more »

C++

C++ ("see plus plus") is a general-purpose programming language.

New!!: AP Computer Science A and C++ · See more »

Central processing unit

A central processing unit (CPU) is the electronic circuitry within a computer that carries out the instructions of a computer program by performing the basic arithmetic, logical, control and input/output (I/O) operations specified by the instructions.

New!!: AP Computer Science A and Central processing unit · See more »

Class (computer programming)

In object-oriented programming, a class is an extensible program-code-template for creating objects, providing initial values for state (member variables) and implementations of behavior (member functions or methods).

New!!: AP Computer Science A and Class (computer programming) · See more »

Colgate University

Colgate University is a private liberal arts college located on in Hamilton Village, Hamilton Township, Madison County, New York, United States.

New!!: AP Computer Science A and Colgate University · See more »

College

A college (Latin: collegium) is an educational institution or a constituent part of one.

New!!: AP Computer Science A and College · See more »

College Board

College Board is an American non-profit organization that was formed in December 1899 as the College Entrance Examination Board (CEEB) to expand access to higher education.

New!!: AP Computer Science A and College Board · See more »

Compiler

A compiler is computer software that transforms computer code written in one programming language (the source language) into another programming language (the target language).

New!!: AP Computer Science A and Compiler · See more »

Computer data storage

Computer data storage, often called storage or memory, is a technology consisting of computer components and recording media that are used to retain digital data.

New!!: AP Computer Science A and Computer data storage · See more »

Computer network

A computer network, or data network, is a digital telecommunications network which allows nodes to share resources.

New!!: AP Computer Science A and Computer network · See more »

Computer science

Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.

New!!: AP Computer Science A and Computer science · See more »

Conditional (computer programming)

In computer science, conditional statements, conditional expressions and conditional constructs are features of a programming language, which perform different computations or actions depending on whether a programmer-specified boolean condition evaluates to true or false.

New!!: AP Computer Science A and Conditional (computer programming) · See more »

Control flow

In computer science, control flow (or flow of control) is the order in which individual statements, instructions or function calls of an imperative program are executed or evaluated.

New!!: AP Computer Science A and Control flow · See more »

Conway's Game of Life

The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.

New!!: AP Computer Science A and Conway's Game of Life · See more »

Data structure

In computer science, a data structure is a data organization and storage format that enables efficient access and modification.

New!!: AP Computer Science A and Data structure · See more »

Data type

In computer science and computer programming, a data type or simply type is a classification of data which tells the compiler or interpreter how the programmer intends to use the data.

New!!: AP Computer Science A and Data type · See more »

Debugging

Debugging is the process of finding and resolving defects or problems within a computer program that prevent correct operation of computer software or a system.

New!!: AP Computer Science A and Debugging · See more »

Declaration (computer programming)

In computer programming, a declaration is a language construct that specifies properties of an identifier: it declares what a word (identifier) "means".

New!!: AP Computer Science A and Declaration (computer programming) · See more »

Double-precision floating-point format

Double-precision floating-point format is a computer number format, usually occupying 64 bits in computer memory; it represents a wide dynamic range of numeric values by using a floating radix point.

New!!: AP Computer Science A and Double-precision floating-point format · See more »

Encapsulation (computer programming)

In object oriented programming languages, encapsulation is used to refer to one of two related but distinct notions, and sometimes to the combination thereof.

New!!: AP Computer Science A and Encapsulation (computer programming) · See more »

Exception handling

Exception handling is the process of responding to the occurrence, during computation, of exceptions – anomalous or exceptional conditions requiring special processing – often changing the normal flow of program execution.

New!!: AP Computer Science A and Exception handling · See more »

Fire Emblem

Fire Emblem is a tactical role-playing game franchise developed by Intelligent Systems and published by Nintendo.

New!!: AP Computer Science A and Fire Emblem · See more »

Floating-point arithmetic

In computing, floating-point arithmetic is arithmetic using formulaic representation of real numbers as an approximation so as to support a trade-off between range and precision.

New!!: AP Computer Science A and Floating-point arithmetic · See more »

Four Lords of the Diamond

The Four Lords of the Diamond is a series of four science fiction novels by author Jack L. Chalker.

New!!: AP Computer Science A and Four Lords of the Diamond · See more »

GeekWire

GeekWire is an American technology news website that covers startups and established technology companies.

New!!: AP Computer Science A and GeekWire · See more »

Glossary of computer science

Most of the terms listed in Wikipedia glossaries are already defined and explained within Wikipedia itself.

New!!: AP Computer Science A and Glossary of computer science · See more »

Has-a

In database design, object-oriented programming and design (see object oriented program architecture), has-a (has_a or has a) is a composition relationship where one object (often called the constituted object, or part/constituent/member object) "belongs to" (is part or member of) another object (called the composite type), and behaves according to the rules of ownership.

New!!: AP Computer Science A and Has-a · See more »

Hash function

A hash function is any function that can be used to map data of arbitrary size to data of a fixed size.

New!!: AP Computer Science A and Hash function · See more »

Heap (data structure)

In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. The node at the "top" of the heap (with no parents) is called the root node.

New!!: AP Computer Science A and Heap (data structure) · See more »

Heapsort

In computer science, heapsort is a comparison-based sorting algorithm.

New!!: AP Computer Science A and Heapsort · See more »

Implementation

Implementation is the realization of an application, or execution of a plan, idea, model, design, specification, standard, algorithm, or policy.

New!!: AP Computer Science A and Implementation · See more »

Information space analysis

Information space analysis is a deterministic method, enhanced by machine intelligence, for locating and assessing resources for team centric efforts.

New!!: AP Computer Science A and Information space analysis · See more »

Inheritance (object-oriented programming)

In object-oriented programming, inheritance is the mechanism of basing an object or class upon another object (prototypal inheritance) or class (class-based inheritance), retaining the same implementation.

New!!: AP Computer Science A and Inheritance (object-oriented programming) · See more »

Input/output

In computing, input/output or I/O (or, informally, io or IO) is the communication between an information processing system, such as a computer, and the outside world, possibly a human or another information processing system.

New!!: AP Computer Science A and Input/output · See more »

Insertion sort

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time.

New!!: AP Computer Science A and Insertion sort · See more »

Integer

An integer (from the Latin ''integer'' meaning "whole")Integer 's first literal meaning in Latin is "untouched", from in ("not") plus tangere ("to touch").

New!!: AP Computer Science A and Integer · See more »

Integer (computer science)

In computer science, an integer is a datum of integral data type, a data type that represents some range of mathematical integers.

New!!: AP Computer Science A and Integer (computer science) · See more »

Intellectual property

Intellectual property (IP) is a category of property that includes intangible creations of the human intellect, and primarily encompasses copyrights, patents, and trademarks.

New!!: AP Computer Science A and Intellectual property · See more »

Interface (computing)

In computing, an interface is a shared boundary across which two or more separate components of a computer system exchange information.

New!!: AP Computer Science A and Interface (computing) · See more »

Invariant (computer science)

In computer science, an invariant is a condition that can be relied upon to be true during the execution of a program, or during some portion of it.

New!!: AP Computer Science A and Invariant (computer science) · See more »

Is-a

In knowledge representation, object-oriented programming and design (see object-oriented program architecture), is-a (is_a or is a) is a subsumption relationship between abstractions (e.g. types, classes), wherein one class A is a subclass of another class B (and so B is a superclass of A).

New!!: AP Computer Science A and Is-a · See more »

Iteration

Iteration is the act of repeating a process, to generate a (possibly unbounded) sequence of outcomes, with the aim of approaching a desired goal, target or result.

New!!: AP Computer Science A and Iteration · See more »

Iterator

In computer programming, an iterator is an object that enables a programmer to traverse a container, particularly lists.

New!!: AP Computer Science A and Iterator · See more »

Java (programming language)

Java is a general-purpose computer-programming language that is concurrent, class-based, object-oriented, and specifically designed to have as few implementation dependencies as possible.

New!!: AP Computer Science A and Java (programming language) · See more »

Java (software platform)

Java is a set of computer software and specifications developed by James Gosling at Sun Microsystems, which was later acquired by the Oracle Corporation, that provides a system for developing application software and deploying it in a cross-platform computing environment.

New!!: AP Computer Science A and Java (software platform) · See more »

Java applet

A Java applet was a small application that is written in the Java programming language, or another programming language that compiles to Java bytecode, and delivered to users in the form of Java bytecode.

New!!: AP Computer Science A and Java applet · See more »

Linear search

In computer science, linear search or sequential search is a method for finding a target value within a list.

New!!: AP Computer Science A and Linear search · See more »

Linked list

In computer science, a linked list is a linear collection of data elements, whose order is not given by their physical placement in memory.

New!!: AP Computer Science A and Linked list · See more »

Logic error

In computer programming, a logic error is a bug in a program that causes it to operate incorrectly, but not to terminate abnormally (or crash).

New!!: AP Computer Science A and Logic error · See more »

Memory management

Memory management is a form of resource management applied to computer memory.

New!!: AP Computer Science A and Memory management · See more »

Merge sort

In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm.

New!!: AP Computer Science A and Merge sort · See more »

Method (computer programming)

A method in object-oriented programming (OOP) is a procedure associated with a message and an object.

New!!: AP Computer Science A and Method (computer programming) · See more »

Microsoft

Microsoft Corporation (abbreviated as MS) is an American multinational technology company with headquarters in Redmond, Washington.

New!!: AP Computer Science A and Microsoft · See more »

Null pointer

In computing, a null pointer has a value reserved for indicating that the pointer does not refer to a valid object.

New!!: AP Computer Science A and Null pointer · See more »

Object (computer science)

In computer science, an object can be a variable, a data structure, a function, or a method, and as such, is a value in memory referenced by an identifier.

New!!: AP Computer Science A and Object (computer science) · See more »

Object-oriented analysis and design

Object-oriented analysis and design (OOAD) is a popular technical approach for analyzing and designing an application, system, or business by applying object-oriented programming, as well as using visual modeling throughout the development life cycles to foster better stakeholder communication and product quality.

New!!: AP Computer Science A and Object-oriented analysis and design · See more »

Object-oriented programming

Object-oriented programming (OOP) is a programming paradigm based on the concept of "objects", which may contain data, in the form of fields, often known as attributes; and code, in the form of procedures, often known as methods. A feature of objects is that an object's procedures can access and often modify the data fields of the object with which they are associated (objects have a notion of "this" or "self").

New!!: AP Computer Science A and Object-oriented programming · See more »

Operating system

An operating system (OS) is system software that manages computer hardware and software resources and provides common services for computer programs.

New!!: AP Computer Science A and Operating system · See more »

Pac-Man

, stylized as PAC-MAN, is an arcade game developed by Namco and first released in Japan as Puck Man in May 1980.

New!!: AP Computer Science A and Pac-Man · See more »

Parameter (computer programming)

In computer programming, a parameter (often called formal parameter or formal argument) is a special kind of variable, used in a subroutine to refer to one of the pieces of data provided as input to the subroutine.

New!!: AP Computer Science A and Parameter (computer programming) · See more »

Pascal (programming language)

Pascal is an imperative and procedural programming language, which Niklaus Wirth designed in 1968–69 and published in 1970, as a small, efficient language intended to encourage good programming practices using structured programming and data structuring. It is named in honor of the French mathematician, philosopher and physicist Blaise Pascal. Pascal was developed on the pattern of the ALGOL 60 language. Wirth had already developed several improvements to this language as part of the ALGOL X proposals, but these were not accepted and Pascal was developed separately and released in 1970. A derivative known as Object Pascal designed for object-oriented programming was developed in 1985; this was used by Apple Computer and Borland in the late 1980s and later developed into Delphi on the Microsoft Windows platform. Extensions to the Pascal concepts led to the Pascal-like languages Modula-2 and Oberon.

New!!: AP Computer Science A and Pascal (programming language) · See more »

Peripheral

A peripheral device is "an ancillary device used to put information into and get information out of the computer." Three categories of peripheral devices exist based on their relationship with the computer.

New!!: AP Computer Science A and Peripheral · See more »

Postcondition

In computer programming, a postcondition is a condition or predicate that must always be true just after the execution of some section of code or after an operation in a formal specification.

New!!: AP Computer Science A and Postcondition · See more »

Precondition

In computer programming, a precondition is a condition or predicate that must always be true just prior to the execution of some section of code or before an operation in a formal specification.

New!!: AP Computer Science A and Precondition · See more »

Primitive data type

In computer science, primitive data type is either of the following.

New!!: AP Computer Science A and Primitive data type · See more »

Priority queue

In computer science, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it.

New!!: AP Computer Science A and Priority queue · See more »

Queue (abstract data type)

In computer science, a queue is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue.

New!!: AP Computer Science A and Queue (abstract data type) · See more »

Quicksort

Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.

New!!: AP Computer Science A and Quicksort · See more »

Radix

In mathematical numeral systems, the radix or base is the number of unique digits, including zero, used to represent numbers in a positional numeral system.

New!!: AP Computer Science A and Radix · See more »

Recursion

Recursion occurs when a thing is defined in terms of itself or of its type.

New!!: AP Computer Science A and Recursion · See more »

Recursion (computer science)

Recursion in computer science is a method of solving a problem where the solution depends on solutions to smaller instances of the same problem (as opposed to iteration).

New!!: AP Computer Science A and Recursion (computer science) · See more »

Reliability engineering

Reliability engineering is a sub-discipline of systems engineering that emphasizes dependability in the lifecycle management of a product.

New!!: AP Computer Science A and Reliability engineering · See more »

Round-off error

A round-off error, also called rounding error, is the difference between the calculated approximation of a number and its exact mathematical value due to rounding.

New!!: AP Computer Science A and Round-off error · See more »

Search algorithm

In computer science, a search algorithm is any algorithm which solves the search problem, namely, to retrieve information stored within some data structure, or calculated in the search space of a problem domain.

New!!: AP Computer Science A and Search algorithm · See more »

Secondary school

A secondary school is both an organization that provides secondary education and the building where this takes place.

New!!: AP Computer Science A and Secondary school · See more »

Selection sort

In computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort.

New!!: AP Computer Science A and Selection sort · See more »

Sequence

In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed.

New!!: AP Computer Science A and Sequence · See more »

Set (abstract data type)

In computer science, a set is an abstract data type that can store unique values, without any particular order.

New!!: AP Computer Science A and Set (abstract data type) · See more »

Software development process

In software engineering, a software development process is the process of dividing software development work into distinct phases to improve design, product management, and project management.

New!!: AP Computer Science A and Software development process · See more »

Software testing

Software testing is an investigation conducted to provide stakeholders with information about the quality of the software product or service under test.

New!!: AP Computer Science A and Software testing · See more »

Sorting algorithm

In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order.

New!!: AP Computer Science A and Sorting algorithm · See more »

Stack (abstract data type)

In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations.

New!!: AP Computer Science A and Stack (abstract data type) · See more »

Syntax error

In computer science, a syntax error is an error in the syntax of a sequence of characters or tokens that is intended to be written in a particular programming language.

New!!: AP Computer Science A and Syntax error · See more »

System console

The system console, computer console, root console, operator's 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.

New!!: AP Computer Science A and System console · See more »

Technology Education and Literacy in Schools

Technology Education and Literacy in Schools (TEALS) is a program that pairs high schools with software engineers who serve as part-time computer science teachers.

New!!: AP Computer Science A and Technology Education and Literacy in Schools · See more »

Tetris

Tetris (Тетрис) is a tile-matching puzzle video game, originally designed and programmed by Russian game designer Alexey Pajitnov.

New!!: AP Computer Science A and Tetris · See more »

Top-down and bottom-up design

Top-down and bottom-up are both strategies of information processing and knowledge ordering, used in a variety of fields including software, humanistic and scientific theories (see systemics), and management and organization.

New!!: AP Computer Science A and Top-down and bottom-up design · See more »

Tree (data structure)

In computer science, a tree is a widely used abstract data type (ADT)—or data structure implementing this ADT—that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.

New!!: AP Computer Science A and Tree (data structure) · See more »

Variable (computer science)

In computer programming, a variable or scalar is a storage location (identified by a memory address) paired with an associated symbolic name (an identifier), which contains some known or unknown quantity of information referred to as a value.

New!!: AP Computer Science A and Variable (computer science) · See more »

Virtual machine

In computing, a virtual machine (VM) is an emulation of a computer system.

New!!: AP Computer Science A and Virtual machine · See more »

Redirects here:

AP CSA, AP Computer Science AB, Grid World, Grid world, GridWorld, GridWorld Case Study, Gridworld.

References

[1] https://en.wikipedia.org/wiki/AP_Computer_Science_A

OutgoingIncoming
Hey! We are on Facebook now! »