Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

AP Computer Science Principles > AP Exam > Flashcards

AP Exam Flashcards

1
Q

computer science

A

the study of information and information processes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

binary numbers

A

study it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

list the binary numbers in order from least to greatest

A

1 2 4 8 16 32 64 128

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the value of the binary number 1111 1111?

A

255; not 256

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

computing innovation

A

a novel or improved idea, device, product, or the development that includes a computer and/or program code as an integral part of its functionality

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

information

A

Details, Facts, Figures, Statistics…
Sounds, Expressions, Smells…
Text, Images, Video, Audio…

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the big idea with binary numbers?

A

All digital information can be represented with just 0’s and 1’s

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

demo devices

A

A lot if information is shared between computers - images, videos, emails, passwords, etc.
Instead of a new system for each piece of information, they can do so using a very basic system.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What number do computer scientists start counting at

A

0; not 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Flippy Do

A

The paper device used for beginner computer scientists trying to learn binary

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

bit

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

byte

A

8 bits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

nibble

A

4 bits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

decimal number

A

a base 10 number with ten possible different digits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

How many numbers can be represented with two binary bits?

A

3 numbers; 01, 10, 11

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

representing decimals in binary

A

used with a decimal point; 1000.0110; exponents are negative; some numbers, like 0.39 can’t be represented

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

overflow error

A

Error from attempting to represent a number that is too large

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Round-off Error

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

abstraction

A

text -> ASCII -> binary

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

ASCII

A

the most common character encoding format for text data in computers and on the internet

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

analog data

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Digital Data

A

Data that changes discreetly through a finite set of possible values

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

sampling

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

hexadecimal

A

Hexadecimal is a numbering system with base 16. It can be used to represent large numbers with fewer digits. In this system there are 16 symbols or possible digit values from 0 to 9, followed by six alphabetic characters – A, B, C, D, E and F

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
meta data
data that describes other data
26
abstraction layers in color images
digital image layer -> sample layer -> pixel layer -> binary layer
27
lossless compression
A process for reducing the number of bits needed to represent something without losing any information. This process is reversible.
28
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.
29
computing device
a machine that can run a program, including computers, tablets, servers, routers, and smart sensors
30
computing system
a group of computing devices and programs working together for a common purpose
31
computing network
a group of interconnected computing devices capable of sending or receiving data.
32
path
the series of connections between computing devices on a network starting with a sender and ending with a receiver.
33
bandwidth
the maximum amount of data that can be sent in a fixed amount of time, usually measured in bits per second
34
protocol
An agreed-upon set of rules that specify the behavior of some system
35
Internet Protocol (IP)
a protocol for sending data across the Internet that assigns unique numbers (IP addresses) to each connected device
36
IP Address
The unique number assigned to each device on the Internet
37
router
A type of computer that forwards data across a network
38
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
39
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
40
User Datagram Protocol (UDP)
A protocol for sending packets quickly with minimal error-checking and no resending of dropped packets
41
Transmission Control Protocol (TCP)
A protocol for sending packets that does error-checking to ensure all packets are received and properly ordered
42
datastream
Information passed through the internet in packets
43
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
44
packet metadata
Data added to packets to help route them through the network and reassemble the original message
45
scalability
the capacity for the system to change in size and scale to meet new demands
46
The Domain Name System (DNS)
the system responsible for translating domain names like example.com into IP addresses
47
World Wide Web
a system of linked pages, programs, and files
48
Hypertext Transfer Protocol (HTTP)
a protocol for computers to request and share the pages that make up the world wide web on the Internet
49
digital divide
differing access to computing devices and the Internet, based on socioeconomic, geographic, or demographic characteristics. Can affect both individual and groups. Raises ethical concerns of equity, access, and influence globally and locally. Affected by the actions of individuals, organizations, and governments.
50
net neutrality
the principle that internet service providers should enable access to all content and applications regardless of the source, and without favoring or blocking particular products or websites.
51
internet censorship
the legal control or suppression of what can be accessed, published, or viewed on the Internet
52
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
53
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
54
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
55
sequential programming
program statements run in order, from top to bottom. No user interaction Code runs the same way every time
56
event-driven programming
some program statements run when triggered by an event, like a mouse click or a key press
57
debugging strategies
keep your code clean, run your code frequently, use classmates and resources
58
documentation
a written description of how a command or piece of code works or was developed
59
comment
form of program documentation written into the program to be read by people and which do not affect how a program runs
60
iteration
a sequence of instructions that is continually repeated
61
IDE
An integrated development environment (IDE) is a software application that helps programmers develop software code efficiently
62
API
application programming interface; a way for two or more computer programs to communicate with each other
63
expression
a combination of operators and values that evaluates to a single value
64
variable
a reference to a value or expression that can be used repeatedly throughout a program; holds one value at a time
65
assignment operator
allows a program to change the value represented by a variable
66
boolean value
a data type that is either true or false
67
comparison operators
<, >, <=, >=, ==, != indicate a Boolean expression
68
boolean expression
evaluates to either true or false
69
function
a named group of programming instructions. Also referred to as a “procedure”
70
function call
a command that executes the code within a function
71
global variable
Permanent. Can be used anywhere in your code.
72
local variable
Temporary. Can be used only in the part of the code where it was created, like inside an onEvent(). Deleted once the onEvent() is done running.
73
transversals
A way to travel through all the elements of a list.
74
intellectual property
a work or invention that is the result of creativity, such as a manuscript or a design, to which one has rights and for which one may apply for a patent, copyright, trademark, etc.
75
abstraction
the process of removing elements of a code or program that aren't relevant or that distract from more important elements
76
high vs. low level programming languages
A high-level language is one that is user-oriented in that it has been designed to make it straightforward for a programmer to convert an algorithm into program code. A low-level language is machine-oriented. Low-level programs are expressed in terms of the machine operations that must be performed to carry out a task.
77
parameter
subvalue within a line of code example: function addNumber ( x , y ) -> x and y would be the parameters
78
concetanate
the operation of joining two strings together
79
HyperText Markup Language
HTML; the standard markup language for documents designed to be displayed in a web browser
80
algorithm
A series of steps to follow to accomplish a task.
81
Algorithms' three building blocks
sequencing - putting steps in order selection - deciding which steps to do next ( if else statement) iteration - doing some steps over and over (loop)
82
elegant style
when you achieve the maximally satisfactory effect with minimal effort, materials, or steps
83
programming style
a term used to describe the effort a programmer should take to make his or her code easy to read and understand
84
efficiency
a measure of how many steps are needed to complete an algorithm
85
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.
86
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
87
Reasonable Time
Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time
88
unreasonable time
Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time
89
polynomial
n-squared makes the graph curve up reasonable
90
exponential
“2 to the n” term the graph curves up very quickly.
91
Decision Problems
“Is there a path?”
92
Optimization Problems
“What’s the shortest path”?
93
Heuristic
provides a "good enough" solution to a problem when an actual solution is impractical or impossible
94
Undecidable Problem
a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer

AP Computer Science Principles (5 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions