Design approach that breaks the problem into smaller pieces and makes sure each piece works as it is added to the whole.

Incremental Development Process

studbud

AP CSP Vocab Part 1

100 termsStudBud Administration17 plays

Part 1 of the entirety of Vocab from AP CSP 2021. Through Unit 6 of Code.org

Flashcards100 cardsFPractice quizPHost liveL

Questions 100

Answers

1
Design approach that breaks the problem into smaller pieces and makes sure each piece works as it is added to the whole.
Iterative Development Process
Agile Development Process
Incremental Development Process
User Feedback Testing
2
a measure of how many steps are needed to complete an algorithm
Allocated Timeline Analysis
RunTime Error
Effeciency
Distributed Computing
3
Algorithms with exponential or factorial efficiencies are examples of algorithms that are:
Reasonable Time
Coefficient Time
Unreasonable time
Efficient Time
4
an ordered sequence of characters.
Concatenation
Variable
Statement
String
5
Abstractions of more complex objects or phenomena for a specific purpose.
Modified Memory Applications
Organic Field Depth
Traversal Applications
Simulation
6
a collection of program statements. Programs run (or “execute”) one command at a time.
Program statement
Comment
Program
Documentation
7
the process of finding a path from sender to receiver.
Sampling
Arguments
Routing
Pathfinding
8
a system for representing numbers using combinations of the digits 0 - 9
Virus
Decimal
Hexadecimal
Binary
9
a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer
Undecidable Problem
Difficult To Answer
The Answer is 42
Infinite Loop
10
the application of each step of an algorithm in the order in which the code statements are given
Order Run Time Environment
Event Driven Programming
Route Driven Tool
Sequencing
11
Data that are sent from a program to a device. Variety of forms, such as tactile interaction, audio, visuals, or text.
Input
Comment
Output
Tactile Flow
12
Error from attempting to represent a number that is too large.
Lossy Compression
Overflow Error
Sampling Error
Round-Off Error
13
a named group of programming instructions. Also referred to as a “procedure” or "method".
Function
Boolean Expression
Library
Variable
14
a data type that is either true or false.
Boolean value
Function
Variable
True-False Statement
15
a protocol for sending data across the Internet that assigns unique numbers (IP addresses) to each connected device
Lossless Routing
Just In Time Protocol
IP Protocol
Cdoe.org
16
8 bits constitute a...
Hornswaggle
Bitted
Byte
Digital Data
17
a description of all the requirements for the program.
User Guide
Program Specifications
Specified Documents
Program outline
18
The unique number assigned to each device on the Internet.
DHCP
Temporary Assignment
Hard Address
IP Address
19
a general description of a task that can (or cannot) be solved with an algorithm
Test
Solution
Question
Problem
20
evaluates to either true or false
Boolean Expression
Function
Arithmetic Operator
Selection Protocol
21
used to test the relationship between values. Evaluates to a Boolean value. For example: =, ≠, >, <, ≥, and ≤
Relational Operator
Geometric Function
Arithmetic Operator
PEMDAS Operator
22
a named reference to a value that can be used repeatedly throughout a program.
Variable
Boolean Value
Arithmetic Operator
Function
23
A protocol used on the internet for fast transmission of information but with minimal error checking. Send and Forget.
FTP
UDP
IP
TCP
24
affect the sequential flow of control by executing different statements based on the value of a Boolean expression.
Boolean Expression
Logical Flow Statement
Argumentative Control
Conditional Statement
25
joins together two or more strings end-to-end to make a new string.
Join
Synergistic Analysis
Function
Concatenation
26
a system of linked pages, programs, and files.
Global Communication Platform
Wifi
Browser
World Wide Web
27
Associated with an action and supplies input data to a program. Examples include: key is pressed, a mouse is clicked.
Object Oriented Programming
Event
Reception
Wifi Password
28
A contraction of "Binary Digit"; the single unit of information in a computer, typically represented as a 0 or 1
Digital Data
Byte
Bit
Analog Data
29
the maximum amount of data that can be sent in a fixed amount of time, usually measured in bits per second.
Bandwidth
Lossy Network
Connection
Bytewidth
30
provides a "good enough" solution to a problem when an actual solution is impractical or impossible
ManMade Algorithm
Ai Driven Analysis
Google Maps
Heuristic
31
a machine that can run a program, including computers, tablets, servers, routers, and smart sensors
Arduino
Switch
Router
Computing Device
32
Descriptions how a program functions and may include a description of user interactions that a program must provide.
Rubric
Program Requirements
User Guide
Supplemental Materials
33
an ordered collection of elements
Collective Reference
List
Function
Loop
34
determines which parts of an algorithm are executed based on a condition being true or false
Function
Relational Operator
Selection
Iterative Loop
35
a named group of programming instructions that may have parameters and return values.
Procedure, Method, or Function
First in/First Out Programming
Incremental Programming
Sequential Programming
36
the process of accessing each item in a list one at a time
For Loop
Finite Loop
Transversal
If/Then Conclusion
37
Data used for processing by a program. A variety of forms, such as tactile interaction, audio, visuals, or text.
Input
Documentation
Event Handler
Output
38
Part of an existing string
Character Mass
Allocated Memory Index
Substring
Mass Index Odometer
39
Online research output free of any and all restrictions on access and free of many restrictions on use.
Open Source
Closed Source
Closed Access
Open Access
40
Inputs and outputs that allow a user to interact with a piece of software. buttons, menus, images, text, and graphics.
Sequential Programmin
Program Statement
User Interface (UI)
Event Handler
41
a computer network consisting of interconnected networks that use standardized, open (nonproprietary) protocols.
Internet
TCP/IP
LAN
Wifi
42
A process for reducing the number of bits needed to represent a piece of information
Data Compression
Lossy vs Lossless Compression
Zipped
Unzipping
43
a command or instruction. Sometimes also referred to as a code statement.
Comment
Documentation
User Interface (UI)
Program Statement
44
the inclusion of extra components so that a system can continue to work even if individual components fail.
Redundancy
Safety
Emergency backup
Habitable Protocol
45
a problem with a yes/no answer (e.g., is there a path from A to B?)
Analyzed Return Function
Decision Problem
Problem Decision Matrix
Analysis Paralysis
46
A chunk of data sent over a network. May arrive at the destination in order, out-of-order, or not at all.
Packet
UDP
Bytes
Holographic Text
47
a mistake in the program where the rules of the programming language are not followed.
Just in Time Compiling
Syntax Error
Language Error
Run Time Error
48
a combination of operators and values that evaluates to a single value
Variable
Expression
Boolean Statement
Statement
49
Design approach requires refinement and revision based on feedback, testing, or reflection throughout the process.
User Feedback Implementation
Holistic Design Process
Iterative Design Process
Incremental Design Process
50
Some program statements run when triggered by an event, like a mouse click or a key press
User Driven Programming
Event Driven Programming
Programming is Hard
Sequential programming
51
a group of computing devices and programs working together for a common purpose
Computing System
Computing Device
Bandwidth
Computing Network
52
a finite set of instructions that accomplish a task.
Efficiency
Algorithm
Problem
Expression
53
add elements to the end of a list
Looped Insertion
Insert
Remote
Append
54
the time used to complete a task sequentially divided by the time to complete a task in parallel
StopTime
Accelerated Return Curve
Speedup
Slowdown
55
Reducing the number of bits needed to represent something without losing any information. This process is reversible.
Lossy Compression
Compression Style
Lossless Compression
Zipped
56
Can continue to function even in the event of individual component failures.
Routed
Protocol
Redundancy
Fault Tolerant
57
allows a program to change the value represented by a variable
Boolean Statement
Comparison Operator
Variable
Assignment Operator ( = or <-)
58
a command that executes the code within a function
Function Call
Transactional Operator
Meta Data Analysis
Boolean Expression
59
A type of computer that forwards and routes data across a network
Network Card
Hub
Router
Switch
60
Data that changes discretely through a finite set of possible values
Value Data
Digital Data
Lossy Data
Analog Data
61
Change the sequential flow of control by repeating a set of statements, until a stopping condition is met
Eternal Return
Loops (Iteration statements)
Abstactive Usage Index
Infinite Recursion
62
Occurs when the ending condition will never evaluate to true.
Syntax Error
Infinite Loop
Just In Time Error
Finite Loop
63
a model in which programs are run by multiple devices
Random Access Memory
Networked Computing
Allocated Memory Management
Distributed Computing
64
a group of interconnected computing devices capable of sending or receiving data.
Computing system
computing source
Computing Device
Computing Network
65
The use of material created by someone else without permission and presented as one’s own
Plagiarism
Cheating
Lying
IP Theft
66
a model in which programs run in order, one command at a time.
Bug
Computational Artifact
Sequential Computing
Inconsequential Programming
67
A way of representing information using only two options.
Analog
Byte
Binary
Trinary
68
Reducing the number of bits needed to represent something. Some information is lost or thrown away. Not reversible.
Lossless Compression
Analog Data
Zipped
Lossy Compression
69
Finding and fixing problems in an algorithm or program.
Stress Inducing Homework
The Avatar is Underrated.
Debugging
Hunt And Peck Style
70
Expressions are evaluated to produce a single value.
Transmogrify
Modify
Evaluate
Elementary Reduction
71
an individual value in a list that is assigned a unique index
i
Element
Index
variable
72
program statements run in order, from top to bottom.
Pair Programming
Programming is Hard
Event Driven Programming
Sequential Programming
73
a written description of how a command or piece of code works or was developed.
Infographic
Documentation
Comment
Research Utility
74
Collaborative programming style in which two programmers switch between the roles of writing code and tracking/planning
Think-Pair-Share
Programming is Fun!
Pair Programming
Watch and Learn Programming
75
a common method for referencing the elements in a list or string using numbers
For/While Loops
Index
Iterative Loop
Output
76
a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met.
Transactional Method
Append
Engineering Design Sequence
Iteration
77
the series of connections between computing devices on a network starting with a sender and ending with a receiver.
Road
Google Maps
Path
Sample
78
NOT, AND, and OR, which evaluate to a Boolean value.
Fallacy Objective
Relational Operator
Logical Operator
Transcendent Expression
79
a problem with the goal of finding the "best" solution among many (e.g., what is the shortest path from A to B?)
Difficult Problem
Memory Out of Bounds Limitation
Route Framework Problem
Optimization Problem
80
Issue digital certificates that validate the ownership of encryption keys used in secure communications. Trust model .
Digital Divide
Amalgamation
Certificate Authority
Encyption
81
programs that are made freely available and may be redistributed and modified
Closed Source
Open Source
Trademarked
Open Access
82
manage complexity in programs by giving a collection of data a name without referencing the specific details.
Summative Index
Data Abstration
Index Reversal
Data Summary
83
HyperText Transfer Protocol - the protocol used for transmitting web pages over the Internet
TCP/IP
FTP
HTTP
UDP
84
Steps or phases used to create a piece of software. Include investigating, designing, prototyping, and testing
UserFeedback Deployment
Engineering Process
Development Process
Agile Development
85
form of program documentation written into the program to be read by people and which do not affect how a program runs.
Event Driven
Documentation
Comment
Human Based Information System
86
Search algorithm which checks each element of a list, in order, until the desired value is found or all elements viewed
Binary search
Linear Search
Google Search
Reasonable Search
87
A program or a collection of programs
Hardware
Adode Lightcloud
Firmware
Software
88
Public licenses enabling free use of a copyrighted work. Allows people the right to share, use, and build upon a work.
Trademarks
Material Law
Intellectual Property
Creative Commons
89
Data with values that change continuously, or smoothly, over time. Like colors of a painting, or position during a race.
Digital Data
Lossless Data
Gigabytes
Analog Data
90
Creating a digital representation of analog data by measuring the analog data at regular intervals called samples.
Compression Sample
Sampling
Binary
Digital Data
91
<, >, <=, >=, ==, != indicate a Boolean expression
Comparison Operators
Variable Analysis
Arithmetic Operators
If then statement
92
A search begins at middle of a sorted set of numbers and removes half of the data; repeats until desired value is found
Google Search
Linear Search
Binary Search
Divisional search
93
Data added to packets to help route them through the network and reassemble the original message.
IP Address
Packet MetaData
A Priori Information
From-To
94
An agreed-upon set of rules that specify the behavior of some system
Protocol
Sample
Lossless Compression
Handshake
95
part of most programming languages and include addition, subtraction, multiplication, division, and modulus operators.
Arithmetic Operator
Concatenation
Boolean Expression
Assignment Operator
96
a programming statement that can consist of a value, a variable, an operator, or a procedure call that returns a value.
Assignment Operator
Contitional Statement
Additional Arguments
Expression
97
Model in which programs are broken into small pieces, some of which are run simultaneously
Parallel Computing
Ad-Hoc Design
Artifact Model Representation
Simultaneous Executive Function
98
Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.)
Unreasonable Time
Reasonable Time
Coefficient
Efficient
99
a mistake in the algorithm or program that causes it to behave incorrectly or unexpectedly.
Syntax Error
Logic/RunTime Error
Element Reference Failure
Simulative Error
100
differing access to computing devices or Internet, based on socioeconomic, geographic, or demographic characteristics
Old vs Young
Rich vs Poor
Digital Divide
Slow Internet

AP CSP Vocab Part 1 Flashcards | StudBud

AP CSP Vocab Part 1

100 termsStudBud Administration17 plays

Part 1 of the entirety of Vocab from AP CSP 2021. Through Unit 6 of Code.org

Flashcards100 cardsFPractice quizPHost liveL

Questions 100

Answers

1
Design approach that breaks the problem into smaller pieces and makes sure each piece works as it is added to the whole.
Iterative Development Process
Agile Development Process
Incremental Development Process
User Feedback Testing
2
a measure of how many steps are needed to complete an algorithm
Allocated Timeline Analysis
RunTime Error
Effeciency
Distributed Computing
3
Algorithms with exponential or factorial efficiencies are examples of algorithms that are:
Reasonable Time
Coefficient Time
Unreasonable time
Efficient Time
4
an ordered sequence of characters.
Concatenation
Variable
Statement
String
5
Abstractions of more complex objects or phenomena for a specific purpose.
Modified Memory Applications
Organic Field Depth
Traversal Applications
Simulation
6
a collection of program statements. Programs run (or “execute”) one command at a time.
Program statement
Comment
Program
Documentation
7
the process of finding a path from sender to receiver.
Sampling
Arguments
Routing
Pathfinding
8
a system for representing numbers using combinations of the digits 0 - 9
Virus
Decimal
Hexadecimal
Binary
9
a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer
Undecidable Problem
Difficult To Answer
The Answer is 42
Infinite Loop
10
the application of each step of an algorithm in the order in which the code statements are given
Order Run Time Environment
Event Driven Programming
Route Driven Tool
Sequencing
11
Data that are sent from a program to a device. Variety of forms, such as tactile interaction, audio, visuals, or text.
Input
Comment
Output
Tactile Flow
12
Error from attempting to represent a number that is too large.
Lossy Compression
Overflow Error
Sampling Error
Round-Off Error
13
a named group of programming instructions. Also referred to as a “procedure” or "method".
Function
Boolean Expression
Library
Variable
14
a data type that is either true or false.
Boolean value
Function
Variable
True-False Statement
15
a protocol for sending data across the Internet that assigns unique numbers (IP addresses) to each connected device
Lossless Routing
Just In Time Protocol
IP Protocol
Cdoe.org
16
8 bits constitute a...
Hornswaggle
Bitted
Byte
Digital Data
17
a description of all the requirements for the program.
User Guide
Program Specifications
Specified Documents
Program outline
18
The unique number assigned to each device on the Internet.
DHCP
Temporary Assignment
Hard Address
IP Address
19
a general description of a task that can (or cannot) be solved with an algorithm
Test
Solution
Question
Problem
20
evaluates to either true or false
Boolean Expression
Function
Arithmetic Operator
Selection Protocol
21
used to test the relationship between values. Evaluates to a Boolean value. For example: =, ≠, >, <, ≥, and ≤
Relational Operator
Geometric Function
Arithmetic Operator
PEMDAS Operator
22
a named reference to a value that can be used repeatedly throughout a program.
Variable
Boolean Value
Arithmetic Operator
Function
23
A protocol used on the internet for fast transmission of information but with minimal error checking. Send and Forget.
FTP
UDP
IP
TCP
24
affect the sequential flow of control by executing different statements based on the value of a Boolean expression.
Boolean Expression
Logical Flow Statement
Argumentative Control
Conditional Statement
25
joins together two or more strings end-to-end to make a new string.
Join
Synergistic Analysis
Function
Concatenation
26
a system of linked pages, programs, and files.
Global Communication Platform
Wifi
Browser
World Wide Web
27
Associated with an action and supplies input data to a program. Examples include: key is pressed, a mouse is clicked.
Object Oriented Programming
Event
Reception
Wifi Password
28
A contraction of "Binary Digit"; the single unit of information in a computer, typically represented as a 0 or 1
Digital Data
Byte
Bit
Analog Data
29
the maximum amount of data that can be sent in a fixed amount of time, usually measured in bits per second.
Bandwidth
Lossy Network
Connection
Bytewidth
30
provides a "good enough" solution to a problem when an actual solution is impractical or impossible
ManMade Algorithm
Ai Driven Analysis
Google Maps
Heuristic
31
a machine that can run a program, including computers, tablets, servers, routers, and smart sensors
Arduino
Switch
Router
Computing Device
32
Descriptions how a program functions and may include a description of user interactions that a program must provide.
Rubric
Program Requirements
User Guide
Supplemental Materials
33
an ordered collection of elements
Collective Reference
List
Function
Loop
34
determines which parts of an algorithm are executed based on a condition being true or false
Function
Relational Operator
Selection
Iterative Loop
35
a named group of programming instructions that may have parameters and return values.
Procedure, Method, or Function
First in/First Out Programming
Incremental Programming
Sequential Programming
36
the process of accessing each item in a list one at a time
For Loop
Finite Loop
Transversal
If/Then Conclusion
37
Data used for processing by a program. A variety of forms, such as tactile interaction, audio, visuals, or text.
Input
Documentation
Event Handler
Output
38
Part of an existing string
Character Mass
Allocated Memory Index
Substring
Mass Index Odometer
39
Online research output free of any and all restrictions on access and free of many restrictions on use.
Open Source
Closed Source
Closed Access
Open Access
40
Inputs and outputs that allow a user to interact with a piece of software. buttons, menus, images, text, and graphics.
Sequential Programmin
Program Statement
User Interface (UI)
Event Handler
41
a computer network consisting of interconnected networks that use standardized, open (nonproprietary) protocols.
Internet
TCP/IP
LAN
Wifi
42
A process for reducing the number of bits needed to represent a piece of information
Data Compression
Lossy vs Lossless Compression
Zipped
Unzipping
43
a command or instruction. Sometimes also referred to as a code statement.
Comment
Documentation
User Interface (UI)
Program Statement
44
the inclusion of extra components so that a system can continue to work even if individual components fail.
Redundancy
Safety
Emergency backup
Habitable Protocol
45
a problem with a yes/no answer (e.g., is there a path from A to B?)
Analyzed Return Function
Decision Problem
Problem Decision Matrix
Analysis Paralysis
46
A chunk of data sent over a network. May arrive at the destination in order, out-of-order, or not at all.
Packet
UDP
Bytes
Holographic Text
47
a mistake in the program where the rules of the programming language are not followed.
Just in Time Compiling
Syntax Error
Language Error
Run Time Error
48
a combination of operators and values that evaluates to a single value
Variable
Expression
Boolean Statement
Statement
49
Design approach requires refinement and revision based on feedback, testing, or reflection throughout the process.
User Feedback Implementation
Holistic Design Process
Iterative Design Process
Incremental Design Process
50
Some program statements run when triggered by an event, like a mouse click or a key press
User Driven Programming
Event Driven Programming
Programming is Hard
Sequential programming
51
a group of computing devices and programs working together for a common purpose
Computing System
Computing Device
Bandwidth
Computing Network
52
a finite set of instructions that accomplish a task.
Efficiency
Algorithm
Problem
Expression
53
add elements to the end of a list
Looped Insertion
Insert
Remote
Append
54
the time used to complete a task sequentially divided by the time to complete a task in parallel
StopTime
Accelerated Return Curve
Speedup
Slowdown
55
Reducing the number of bits needed to represent something without losing any information. This process is reversible.
Lossy Compression
Compression Style
Lossless Compression
Zipped
56
Can continue to function even in the event of individual component failures.
Routed
Protocol
Redundancy
Fault Tolerant
57
allows a program to change the value represented by a variable
Boolean Statement
Comparison Operator
Variable
Assignment Operator ( = or <-)
58
a command that executes the code within a function
Function Call
Transactional Operator
Meta Data Analysis
Boolean Expression
59
A type of computer that forwards and routes data across a network
Network Card
Hub
Router
Switch
60
Data that changes discretely through a finite set of possible values
Value Data
Digital Data
Lossy Data
Analog Data
61
Change the sequential flow of control by repeating a set of statements, until a stopping condition is met
Eternal Return
Loops (Iteration statements)
Abstactive Usage Index
Infinite Recursion
62
Occurs when the ending condition will never evaluate to true.
Syntax Error
Infinite Loop
Just In Time Error
Finite Loop
63
a model in which programs are run by multiple devices
Random Access Memory
Networked Computing
Allocated Memory Management
Distributed Computing
64
a group of interconnected computing devices capable of sending or receiving data.
Computing system
computing source
Computing Device
Computing Network
65
The use of material created by someone else without permission and presented as one’s own
Plagiarism
Cheating
Lying
IP Theft
66
a model in which programs run in order, one command at a time.
Bug
Computational Artifact
Sequential Computing
Inconsequential Programming
67
A way of representing information using only two options.
Analog
Byte
Binary
Trinary
68
Reducing the number of bits needed to represent something. Some information is lost or thrown away. Not reversible.
Lossless Compression
Analog Data
Zipped
Lossy Compression
69
Finding and fixing problems in an algorithm or program.
Stress Inducing Homework
The Avatar is Underrated.
Debugging
Hunt And Peck Style
70
Expressions are evaluated to produce a single value.
Transmogrify
Modify
Evaluate
Elementary Reduction
71
an individual value in a list that is assigned a unique index
i
Element
Index
variable
72
program statements run in order, from top to bottom.
Pair Programming
Programming is Hard
Event Driven Programming
Sequential Programming
73
a written description of how a command or piece of code works or was developed.
Infographic
Documentation
Comment
Research Utility
74
Collaborative programming style in which two programmers switch between the roles of writing code and tracking/planning
Think-Pair-Share
Programming is Fun!
Pair Programming
Watch and Learn Programming
75
a common method for referencing the elements in a list or string using numbers
For/While Loops
Index
Iterative Loop
Output
76
a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met.
Transactional Method
Append
Engineering Design Sequence
Iteration
77
the series of connections between computing devices on a network starting with a sender and ending with a receiver.
Road
Google Maps
Path
Sample
78
NOT, AND, and OR, which evaluate to a Boolean value.
Fallacy Objective
Relational Operator
Logical Operator
Transcendent Expression
79
a problem with the goal of finding the "best" solution among many (e.g., what is the shortest path from A to B?)
Difficult Problem
Memory Out of Bounds Limitation
Route Framework Problem
Optimization Problem
80
Issue digital certificates that validate the ownership of encryption keys used in secure communications. Trust model .
Digital Divide
Amalgamation
Certificate Authority
Encyption
81
programs that are made freely available and may be redistributed and modified
Closed Source
Open Source
Trademarked
Open Access
82
manage complexity in programs by giving a collection of data a name without referencing the specific details.
Summative Index
Data Abstration
Index Reversal
Data Summary
83
HyperText Transfer Protocol - the protocol used for transmitting web pages over the Internet
TCP/IP
FTP
HTTP
UDP
84
Steps or phases used to create a piece of software. Include investigating, designing, prototyping, and testing
UserFeedback Deployment
Engineering Process
Development Process
Agile Development
85
form of program documentation written into the program to be read by people and which do not affect how a program runs.
Event Driven
Documentation
Comment
Human Based Information System
86
Search algorithm which checks each element of a list, in order, until the desired value is found or all elements viewed
Binary search
Linear Search
Google Search
Reasonable Search
87
A program or a collection of programs
Hardware
Adode Lightcloud
Firmware
Software
88
Public licenses enabling free use of a copyrighted work. Allows people the right to share, use, and build upon a work.
Trademarks
Material Law
Intellectual Property
Creative Commons
89
Data with values that change continuously, or smoothly, over time. Like colors of a painting, or position during a race.
Digital Data
Lossless Data
Gigabytes
Analog Data
90
Creating a digital representation of analog data by measuring the analog data at regular intervals called samples.
Compression Sample
Sampling
Binary
Digital Data
91
<, >, <=, >=, ==, != indicate a Boolean expression
Comparison Operators
Variable Analysis
Arithmetic Operators
If then statement
92
A search begins at middle of a sorted set of numbers and removes half of the data; repeats until desired value is found
Google Search
Linear Search
Binary Search
Divisional search
93
Data added to packets to help route them through the network and reassemble the original message.
IP Address
Packet MetaData
A Priori Information
From-To
94
An agreed-upon set of rules that specify the behavior of some system
Protocol
Sample
Lossless Compression
Handshake
95
part of most programming languages and include addition, subtraction, multiplication, division, and modulus operators.
Arithmetic Operator
Concatenation
Boolean Expression
Assignment Operator
96
a programming statement that can consist of a value, a variable, an operator, or a procedure call that returns a value.
Assignment Operator
Contitional Statement
Additional Arguments
Expression
97
Model in which programs are broken into small pieces, some of which are run simultaneously
Parallel Computing
Ad-Hoc Design
Artifact Model Representation
Simultaneous Executive Function
98
Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.)
Unreasonable Time
Reasonable Time
Coefficient
Efficient
99
a mistake in the algorithm or program that causes it to behave incorrectly or unexpectedly.
Syntax Error
Logic/RunTime Error
Element Reference Failure
Simulative Error
100
differing access to computing devices or Internet, based on socioeconomic, geographic, or demographic characteristics
Old vs Young
Rich vs Poor
Digital Divide
Slow Internet