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

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