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

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