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

AP CSP Vocab Part 1 Flashcards | StudBud

AP CSP Vocab Part 1

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