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

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