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

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