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

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