AP CSP Vocab Part 1

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

AP CSP Vocab Part 1 Flashcards | StudBud

AP CSP Vocab Part 1

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