AP Comp sci principles vocabulary (copy)

Algorithm

a finite set of instructions that accomplish a task

API Application Program Interface

Specifications for how functions in a library behave and can be used

Argument

The value passed to the parameter (EX: drawCharacter (150,200))

Assignment Operator

allows a program to change the value represented by a variable (EX: +,-,MOD)

Bandwidth

The maximum amount of data that can be sent in a fixed amount of time, usually measured in bits per second

Binary Search

a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated

Boolean Value

a data type that is either true or false

Citizen Science

scientific research conducted in whole or part by distributed individuals, many of whom may not be scientists, who contribute relevant data to research using their own computing devices.

Cleaning Data

a process that makes the data uniform without changing its meaning (e.g., replacing all equivalent abbreviations, spellings, and capitalizations with the same word).

Comment

form of program documentation written into the program to be read by people and which do not affect how a program runs

Comparison Operator

Computer Virus Scanning Software

protects a computing system against infection

Computing Device

a machine that can run a program, including computers, tablets, servers, routers, and smart sensors

Computing Innovation

includes a program as an integral part of its function. Can be physical (e.g. self-driving car), non-physical computing software (e.g. picture editing software), or non-physical computing concepts (e.g., e-commerce).

Computing Network

a group of interconnected computing devices capable of sending or receiving data.

Computing System

a group of computing devices and programs working together for a common purpose

Conditional Statement

affects the sequential flow of control by executing different statements based on the value of a Boolean expression (If…else)

Correlation

a relationship between two pieces of data, typically referring to the amount that one varies in relation to the other (NOT causation)

Crowdsourcing

the practice of obtaining input or information from a large number of people via the Internet

Data Abstraction

Manage complexity in programs by giving a collection of data a name without referencing the specific details of the representation (EX: Being able to drive a car w/o knowing every detail abt how it operates)

Data Bias

Data that does not accurately reflect the full population or phenomenon being studied

Data Filtering

Choosing a smaller subset of a data set to use for analysis, for example by eliminating / keeping only certain rows in a table

Debugging

Finding and fixing problems in an algorithm or program

Decision Problem

a problem with a yes/no answer (e.g., is there a path from A to B?)

Decryption

a process that reverses encryption, taking a secret message and reproducing the original plain text

Development Process

The steps or phases used to create a piece of software. Typical phases include investigating, designing, prototyping, and testing.

Digital Divide

Differing access to computing devices and the Internet, based on socioeconomic, geographic, or demographic characteristics

Distributed Computing

A model in which programs are run by multiple devices

Documentation

A written description of how a command or piece of code works or was developed

Domain Name System (DNS)

The system responsible for translating domain names like example.com into IP addresses

Efficiency

A measure of how many steps are needed to complete an algorithm (Divided into reasonable and unreasonable runtimes)

Element

an individual value in a list that is assigned a unique index

Encryption

a process of encoding messages to keep them secret, so only "authorized" parties can read it

Event Driven Programming

some program statements run when triggered by an event, like a mouse click or a key press

Expression

a combination of operators and values that evaluates to a single value

Fault Tolerant

Can continue to function even in the event of individual component failures. This is important because elements of complex systems like a computer network fail at unexpected times, often in groups.

Function

a named group of programming instructions. Also referred to as a “procedure”.

Function Call

a command that executes the code within a function

Heuristic

provides a "good enough" solution to a problem when an actual solution is impractical or impossible

HyperText Transfer Protocol (HTTP)

the protocol used for transmitting web pages over the Internet

Index

a common method for referencing the elements in a list or string using numbers

Infinite Loop

occurs when the ending condition will never evaluate to true

Information

the collection of facts and patterns extracted from data

Input

data that are sent to a computer for processing by a program. Can come in a variety of forms, such as tactile interaction, audio, visuals, or text.

Internet Protocol (IP)

a protocol for sending data across the Internet that assigns unique numbers (IP addresses) to each connected device

IP Address

The unique number assigned to each device on the Internet

Iteration

a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met

Iteration

a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met

Keylogging

the use of a program to record every keystroke made by a computer user in order to gain fraudulent access to passwords and other confidential information

Library

a group of functions (procedures) that may be used in creating new programs

Linear Search

a search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked

List

an ordered collection of elements

Logical Operator

NOT, AND, and OR, which evaluate to a Boolean value

Malware

software intended to damage a computing system or to take partial control over its operation

Metadata

data about data

Modularity

the subdivision of a computer program into separate subprograms

Multifactor Authentication

a system that requires at least two steps to unlock protected information; each step adds a new layer of security that must be broken to gain unauthorized access

Optimization Problem

a problem with the goal of finding the "best" solution among many (e.g., what is the shortest path from A to B?)

Output

any data that are sent from a program to a device. Can come in a variety of forms, such as tactile interaction, audio, visuals, or text.

Packet

A chunk of data sent over a network. Larger messages are divided into packets that may arrive at the destination in order, out-of-order, or not at all

Pair Programming

a collaborative programming style in which two programmers switch between the roles of writing code and tracking or planning high level progress

Parallel Computing

a model in which programs are broken into small pieces, some of which are run simultaneously

Parameter

A variable in a function definition. Used as a placeholder for values that will be passed through the function (EX: drawCharacter(x,y,size))

Path

the series of connections between computing devices on a network starting with a sender and ending with a receiver

Personally Identifiable Information (PII)

information about an individual that identifies, links, relates, or describes them (ex: social security number or address)

Phishing

a technique that attempts to trick a user into providing personal information. That personal information can then be used to access sensitive online resources, such as bank accounts and emails

Problem

a general description of a task that can (or cannot) be solved with an algorithm

Procedural Abstraction

a process and allows a procedure to be used only knowing what it does, not how it does it. Procedural abstraction allows a solution to a large problem to be based on the solution of smaller subproblems. This is accomplished by creating procedures to solve each of the subproblems.

Program

a collection of program statements. Programs run (or “execute”) one command at a time.

Program Statement

a command or instruction. Sometimes also referred to as a code statement.

Protocol

An agreed-upon set of rules that specify the behavior of some system

Public Key Encryption

pairs a public key for encryption and a private key for decryption. The sender does not need the receiver’s private key to encrypt a message, but the receiver’s private key is required to decrypt the message

Reasonable Time

Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time

Redundancy

The inclusion of extra components so that a system can continue to work even if individual components fail, for example by having more than one path between any two connected devices in a network

Return

used to return the flow of control to the point where the procedure (also known as a function) was called and to return the value of expression (ends the program)

Rouge Access Point

a wireless access point that gives unauthorized access to secure networks

Router

A type of computer that forwards data across a network

Selection

deciding which steps to do next (if…else)

Sequencing

putting steps in an order

Sequential Computing

a model in which programs run in order, one command at a time

Sequential Programming

program statements run in order, from top to bottom

Speedup

the time used to complete a task sequentially divided by the time to complete a task in parallel

String

an ordered sequence of characters

Symmetric Key Encryption

Involves one key for both encryption and decryption

Traversal

the process of accessing each item in a list one at a time

Undecidable Problem

a problem for which no algorithm can be constructed that is always capable of providing a correct yes

Unreasonable Time

Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time (2^n, n^n)

User Interface

the inputs and outputs that allow a user to interact with a piece of software. User interfaces can include a variety of forms such as buttons, menus, images, text, and graphics.

Variable

a named reference to a value that can be used repeatedly throughout a program

World Wide Web

a system of linked pages, programs, and files

Binary

A way of representing information using only two options. (EX: 2^0, 2^1, 2²)

Decimal

A way of representing information using ten options (What we use)

Bit

Short for “Binary Digit”; the single unit of information in a computer, typically, represented as a 0 or 1

Overflow error

Error from attempting to represent a number that is too large.

Round off error

 Error from attempting to represent a number that is too precise. The value is rounded.

Analog Data

Data with values that change continuously, or smoothly, over time. Some examples of analog data include music, colors of a painting, or position of a sprinter during a race.

Digital Data

Data that changes discretely through a finite set of possible values

Sampling

 A process for creating a digital representation of analog data by measuring the analog data at regular intervals called samples.

Lossless Compression

 A process for reducing the number of bits needed to represent something without losing any information. This process is reversible.

Lossy Compression

A process for reducing the number of bits needed to represent something in which some information is lost or thrown away. This process is not reversible.