APCS TERM TEST

5.0(1)
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/129

flashcard set

Earn XP

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

130 Terms

1
New cards
Bit
A contraction of "Binary Digit"; the single unit of information in a computer, typically represented as a 0 or 1
2
New cards
Byte
8 bits
3
New cards
Overflow Error
Error from attempting to represent a number that is too large
4
New cards

Round-off Error

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

5
New cards
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.
6
New cards
Digital Data
Data that changes discreetly through a finite set of possible values.
7
New cards
Sampling
A process for creating a digital representation of analog data at regular intervals called samples.
8
New cards
Lossless Compression
A process for reducing the number of bits needed to represent something without losing any information. This process is reversible.
9
New cards
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.
10
New cards
Binary
A way of representing information using only two options
11
New cards
Creative Commons
A collection of public copyright licenses that enable the free distribution of an otherwise copyrighted work, used when an author wants to give people the right to share, use, and build upon a work that they have created
12
New cards
Data Compression
A process for reducing the number of bits needed to represent a piece of information.
13
New cards
Decimal
A system for representing numbers using combinations of the digits 0
14
New cards
intellectual property
A work or invention that is the result of creativity, such as a piece of writing or design, to which one has rights and for which one may apply for a patent, copyright, trademark, etc.
15
New cards
Open Access
Online research output free of any and all restrictions on access and free of many restrictions on use, such as copyright or license restrictions
16
New cards
Open Source
Programs that are made freely available and may be redistributed and modified
17
New cards
Computing Device
a machine that can run a program, including computers, tablets, servers, routers, and smart sensors
18
New cards
Computing System
a group of computing devices and programs working together for a common purpose
19
New cards
Computing Network
a group of interconnected computing devices capable of sending or receiving data.
20
New cards
Path
the series of connections between computing devices on a network starting with a sender and ending with a receiver.
21
New cards
Bandwidth
the maximum amount of data that can be sent in a fixed amount of time, usually measured in bits per second.
22
New cards
Protocol

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

23
New cards
IP Address
The unique number assigned to each device on the Internet.
24
New cards
Internet Protocol (IP)
a protocol for sending data across the Internet that assigns unique numbers (IP addresses) to each connected device
25
New cards
Router
A type of computer that forwards data across a network
26
New cards
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.
27
New cards
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
28
New cards
HTTP (Hypertext Transfer Protocol)
the protocol used for transmitting web pages over the Internet
29
New cards
Internet
a computer network consisting of interconnected networks that use standardized, open (nonproprietary) communication protocols.
30
New cards
Packet
A chunk of data sent over a network. Larger messages are divided into packets that may arrive at the destination in order, out
31
New cards
Packet Metadata
Data added to packets to help route them through the network and reassemble the original message
32
New cards
Routing
the process of finding a path from sender to receiver.
33
New cards

UDP (User Datagram Protocol)

A protocol used on the internet for fast transmission of information but with minimal error checking

34
New cards
World Wide Web
a system of linked pages, programs, and files.
35
New cards
Certificate authority
issue digital certificates that validate the ownership of encryption keys used in secure communications and are based on a trust model
36
New cards
Digital Divide
differing access to computing devices and the Internet, based on socioeconomic, geographic, or demographic characteristics
37
New cards
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.
38
New cards
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
39
New cards
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.
40
New cards
Program Statement
a command or instruction. Sometimes also referred to as a code statement.
41
New cards
Program
a collection of program statements. Programs run (or "execute") one command at a time.
42
New cards
Sequential Programming
program statements run in order, from top to bottom.
43
New cards
Event Driven Programming
some program statements run when triggered by an event, like a mouse click or a key press
44
New cards
Documentation
a written description of how a command or piece of code works or was developed.
45
New cards
Comment
form of program documentation written into the program to be read by people and which do not affect how a program runs
46
New cards
Pair Programming
a collaborative programming style in which two programmers switch between the roles of writing code and tracking or planning high level progress
47
New cards
Debugging
Finding and fixing problems in an algorithm or program.
48
New cards
Development process
the steps or phases used to create a piece of software. Typical phases include investigating, designing, prototyping, and testing
49
New cards
Event
associated with an action and supplies input data to a program. Can be generated when a key is pressed, a mouse is clicked, a program is started, or by any other defined action that affects the flow of execution.
50
New cards
Incremental Development Process
a design approach that breaks the problem into smaller pieces and makes sure each piece works before adding it to the whole.
51
New cards
Iterative Development Process
a design approach requires refinement and revision based on feedback, testing, or reflection throughout the process. This may require revisiting earlier phases of the process.
52
New cards
Plagiarism
The use of material created by someone else without permission and presented as one's own
53
New cards
Program Requirements
descriptions how a program functions and may include a description of user interactions that a program must provide.
54
New cards
Program specification
a description of all the requirements for the program
55
New cards
Syntax Error
a mistake in the program where the rules of the programming language are not followed.
56
New cards
Software
A program or a collection of programs
57
New cards
Assignment Operator
allows a program to change the value represented by a variable
58
New cards
Variable
a named reference to a value that can be used repeatedly throughout a program
59
New cards
Boolean Value
a data type that is either true or false
60
New cards

Comparison Operators

indicate a Boolean expression: <, >, <=, >=, ==, !=

61
New cards
Function
a named group of programming instructions. Also referred to as a "procedure".
62
New cards
Function Call
a command that executes the code within a function
63
New cards
Arithmetic operator
part of most programming languages and include addition, subtraction, multiplication, division, and modulus operators
64
New cards
Boolean Expression
evaluates to either true or false
65
New cards
Concatenation
joins together two or more strings end
66
New cards
Conditional Statement
affect the sequential flow of control by executing different statements based on the value of a Boolean expression.
67
New cards
Evaluate
Expressions are evaluated to produce a single value.
68
New cards
Expression
a programming statement that can consist of a value, a variable, an operator, or a procedure call that returns a value.
69
New cards
Logical operator
NOT, AND, and OR, which evaluate to a Boolean value.
70
New cards
Procedure
a named group of programming instructions that may have parameters and return values.
71
New cards
Relational operator
used to test the relationship between two variables, expressions, or values. A comparison using a relational operator evaluates to a Boolean value. For example: =, ≠, >,
72
New cards
Selection
determines which parts of an algorithm are executed based on a condition being true or false
73
New cards
String
an ordered sequence of characters.
74
New cards
List
an ordered collection of elements
75
New cards
Element
an individual value in a list that is assigned a unique index
76
New cards
Index
a common method for referencing the elements in a list or string using numbers
77
New cards
Iteration
a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met.
78
New cards
infinite loop
occurs when the ending condition will never evaluate to true.
79
New cards
Traversal
the process of accessing each item in a list one at a time
80
New cards
Append
add elements to the end of a list
81
New cards
Data abstraction
manage complexity in programs by giving a collection of data a name without referencing the specific details of the representation.
82
New cards
Loops (iteration statements)
change the sequential flow of control by repeating a set of statements zero or more times, until a stopping condition is met
83
New cards
Logic Error
a mistake in the algorithm or program that causes it to behave incorrectly or unexpectedly.
84
New cards
Simulation
abstractions of more complex objects or phenomena for a specific purpose
85
New cards
Substring
part of an existing string
86
New cards
Problem
a general description of a task that can (or cannot) be solved with an algorithm
87
New cards
Algorithm
a finite set of instructions that accomplish a task.
88
New cards
Efficiency
a measure of how many steps are needed to complete an algorithm
89
New cards
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.
90
New cards
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.
91
New cards
Reasonable Time
Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time
92
New cards
Unreasonable Time
Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time.
93
New cards
Heuristic
provides a "good enough" solution to a problem when an actual solution is impractical or impossible
94
New cards
Undecidable Problem
a problem for which no algorithm can be constructed that is always capable of providing a correct yes
95
New cards
Sequential Computing
a model in which programs run in order, one command at a time.
96
New cards
Parallel Computing
a model in which programs are broken into small pieces, some of which are run simultaneously
97
New cards
Distributed Computing
a model in which programs are run by multiple devices
98
New cards
Speedup
the time used to complete a task sequentially divided by the time to complete a task in parallel
99
New cards
Decision Problem
a problem with a yes/no answer (e.g., is there a path from A to B?)
100
New cards
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?)