the smallest unit of data in a computer. Has a value of 0 or 1
2
New cards
Byte
a unit of data that is eight binary digits long.
3
New cards
Binary
A way of representing information using only two options.
4
New cards
Algorithm
a complete, well-defined sequence of steps for completing a task or solving a problem
5
New cards
Program
a sequence of instructions or steps, written in a language that can be understood by a computer, that will be used by the computer to complete a task or solve a problem
6
New cards
Blocks
Puzzle-piece shapes that are used to create code.
7
New cards
Scripts
Different types of blocks linked together
8
New cards
Sprites
An object in some programming languages which performs functions controlled by scripts
9
New cards
Stage
The background of a project, performs functions through scripts
10
New cards
Logic Error
a mistake in the algorithm or program that causes it to behave incorrectly or unexpectedly.
11
New cards
Tracing
Going through the execution of program code by hand to manually verify that it works correctly
12
New cards
Debugging
The process of identifying and removing errors from computer hardware or software
13
New cards
ASCII
A character encoding standard for electronic communication.
14
New cards
Overflow Error
an error that occurs when calculated data cannot fit within the designated field
15
New cards
Roundoff Error
Error that is produced when a computer is used to perform real number calculations because many real numbers can not be represented exactly on a computer.
16
New cards
Underflow Error
occurs in a computer or similar device when a mathematical operation results in a number which is smaller than what the device is capable of storing.
17
New cards
pixel
a minute area of illumination on a display screen, one of many from which an image is composed.
18
New cards
RGB
refers to a system for representing the colors to be used on a computer display.
19
New cards
Heurisitic
a problem solving approach (algorithm) to find a satisfactory solution where finding an optimal or exact solution is impractical or impossible.
20
New cards
Lossless Compression
a data compression algorithm that allows the original data to be perfectly reconstructed from the compressed data.
21
New cards
Lossy Compression
a data encoding and compression technique that deliberately discards some data in the compression process
22
New cards
Creative Commons
A collection of public copyright licenses that enable the free distribution of an otherwise copyrighted work, used when an author wants to give people the right to share, use, and build upon a work that they have created
23
New cards
Open Source
programs that are made freely available and may be redistributed and modified
24
New cards
Open Access
online research output free of any and all restrictions on access and free of many restrictions on use, such as copyright or license restrictions
25
New cards
Abstraction
Hiding some details so that the programmer can focus a manageable amount of complexity at a time
26
New cards
Iteration
a process wherein a set of instructions or structures are repeated in a sequence a specified number of times or until a condition is met
27
New cards
Parameters
a formal argument, is a special kind of variable, used in a subroutine to refer to one of the pieces of data provided as input to the subroutine
28
New cards
TCP/IP
a suite of communication protocols used to interconnect network devices on the internet
29
New cards
Protocol
A set of rules
30
New cards
IP Address
a numerical label assigned to each device connected to a computer network that uses the Internet Protocol for communication
31
New cards
HTTP
defines how messages are formatted and transmitted, and what actions Web servers and browsers should take in response to various commands
32
New cards
Computing Device
a machine that can run a program, including computers, tablets, servers, routers, and smart sensors
33
New cards
Computing System
a group of computing devices and programs working together for a common purpose
34
New cards
Computing Network
a group of interconnected computing devices capable of sending or receiving data.
35
New cards
Path
the series of connections between computing devices on a network starting with a sender and ending with a receiver.
36
New cards
Bandwidth
The maximum amount of data that can pass from one point to another in a unit of time
37
New cards
URL
An easy-to-remember address for calling a web page (like www.code.org).
38
New cards
Packet
A chunk of data sent over a network. Larger messages are divided into packets that may arrive at the destination in order, out-of-order, or not at all.
39
New cards
Redundancy
When there are multiple pathways among physical connections of the internet
40
New cards
Hierarchical
Levels used for organization. For example: Internet Addressing Systems (like domain names and IP addresses)
41
New cards
Internet Protocol
a protocol for sending data across the Internet that assigns unique numbers (IP addresses) to each connected device
42
New cards
Fault-tolerance
the property that enables a system to continue operating properly in the event of the failure of (or one or more faults within) some of its components
43
New cards
Router
a device that forwards data packets between computer networks
44
New cards
Data Stream
a sequence of digitally encoded coherent signals used in a transmission
45
New cards
TCP
a standard that defines how to establish and maintain a network conversation via which application programs can exchange data
46
New cards
UDP
is used to send short messages called datagrams but overall, it is an unreliable, connectionless protocol
47
New cards
Scalability
the capacity for the system to change in size and scale to meet new demands
48
New cards
DNS
the system responsible for translating domain names like example.com into IP addresses
49
New cards
World Wide Web
a system of linked pages, programs, and files
50
New cards
Digital Divide
differing access to computing devices and the Internet, based on socioeconomic, geographic, or demographic characteristics
51
New cards
Expression
a combination of operators and values that evaluates into a single value
52
New cards
Variable
an abstraction inside the program that can hold a value.
53
New cards
Assignment operator
allows a program to change the value represented by a variable
54
New cards
Increment
add one to a number
55
New cards
Assignment
Storing or updating a value in a named variable
56
New cards
Polygon
A closed plane figure made up of line segments
57
New cards
Statement
a line of executable code
58
New cards
Sequential
execution of an algorithm or program, step by step, from top to bottom, where one line of code finishes before the one below it begins.
59
New cards
Operators
used to script math equations and string handling
60
New cards
Pseudocode
a high level textual algorithm written in informative text that mimics a programming language but cannot be executed by a computer.
61
New cards
High-Level Programming Language
easier to use, may incorporate natural language and hide or automate some processes
62
New cards
Natural Langauge
language that is spoken and understood by humans but cannot be processed by the computer
63
New cards
Machine Language
a collection of binary digits or bits that the computer reads and interprets.
64
New cards
Compiler
a software program that translates a programming language to machine language so a computer can understand
65
New cards
Procedure
reusable collection of statements, also referred to as methods, functions, or blocks. They can be created by the programmer or defined within a library.
66
New cards
Nested Iteration
a loop inside another loop
67
New cards
Modular Math
The operation of dividing integers and the result being the remainder of that division.
68
New cards
Random Numbers
Numbers for which there is no identifiable pattern or sequence. Computers approximate this using pseudo-random numbers.
69
New cards
Order of Operations
Operator precedence in an expression
70
New cards
Unicode
an international encoding standard for use with different languages and scripts, by which each letter, digit, or symbol is assigned a unique numeric value that applies across different platforms and programs.
71
New cards
Boolean Operators
AND, OR and NOT are some examples
72
New cards
Predicate Function
a function that returns True or False
73
New cards
Relational Operator
used to compare the relation between two operands
74
New cards
Conditional Statement
a statement or expression that is evaluated to determine an outcome (if, repeat until, while)
75
New cards
Procedural Abstraction
a reusable collection of statements that decrease the lines of code in a program, increase the readability of the program and decrease the chance of errors or bugs inside a program. Procedures don't make it easier for computers to run a program, but they do make it much easier for humans to make complicated programs.
76
New cards
Flowchart
a simple diagram with symbols showing the "flow" of a process
77
New cards
Simulations
simplified representations of more complex objects of phenomena that are developed to explain the subject, allow further study of the subject, allow for the testing of different conditions on the subject, or to formulate and research hypotheses about the subject
78
New cards
Code Segment
A collection of program statements that is part of a program.
79
New cards
index
identifies a value's unique position on a list.
80
New cards
element
81
New cards
list
data structure that stores one or more similar types of data in a single value.
82
New cards
Traversing
performing the same operation on each item of a list, sequentially
83
New cards
Append
Add an element to the end of a list
84
New cards
Remove/Delete
Remove an element from a list
85
New cards
Insert
Add an element to a list at a certain index
86
New cards
Replace
Update the contents of an element
87
New cards
For Each Loop
control structure designed to iterate over each element of a list and repeat the same operation on each element
88
New cards
Linear Search
An algorithm that iterates through each item in a list until it finds the target value.
89
New cards
Return Statement
terminates the execution of a procedure and RETURNS to the calling procedure.
90
New cards
Temporary variable
has a short lifetime, usually to hold data that will soon be discarded
91
New cards
Binary Search
An algorithm that searches a sorted list for a value by repeatedly splitting the list in half.
92
New cards
Algorithmic Efficiency
a measure of execution time and memory usage while still yielding a correct answer.
93
New cards
Array
A type of list or data structure that stores a collection of data
94
New cards
Undecidable Problem
a problem that may have some instances that have an algorithmic solution, but there is no algorithmic solution that could solve all instances of the problem.
95
New cards
Decidable Problem
is a decision problem for which an algorithm can be written to produce a correct output for all inputs
96
New cards
Library
contains existing procedures that may be used in creating new programs
97
New cards
API
provides details or specifications on how the procedures behave and can be used.
98
New cards
function
A section of code that performs some specific task that may or may not return a value. This section of code can be reused multiple times.
99
New cards
Syntax Error
An error in the source code of a program. Typically small grammatical mistakes, sometimes limited to a single character and prevent the program from compiling and running
100
New cards
comments
a form of program documentation written into the program to be read by people and do not affect how a program runs.