Data Types and Structures
Programming Concepts
Software and Network Infrastructure
Security and Privacy
Data Handling and Compression
100

List

a Data structure that contains a collection of data items in a sequence.

100

Modularity 

What is: The subdivision of a computer program into separate subprograms is called modularity.

100

Bandwidth

What is: Bandwidth is the maximum amount of data that can be sent in a fixed amount of time (for digital data, it is measured in bits per second). Higher bandwidth is better because the data will travel more quickly

100

Firewall

What is: A firewall is a security system that controls the kinds of connections that can be made between a computer or network and the outside world.

100

Bit

What is: a single unit of data that can only have one of two values. We usually represent the two values as 0 (off) and 1 (on). The word "bit" is an abbreviation for binary digit. Byte - A byte is eight bits

200

Variable

What is: A variable is like a box that can hold one value at a time, such as one word, one costume, or one list (which can contain many things). You can look at what's inside as many times as you want

200

Initialize

What is: Setting the starting value of a variable.

200

The Cloud

What is: Storing data in the cloud means storing it somewhere on the Internet, but you don't know where. The cloud service provider (Google, Dropbox, Amazon, Snap!, etc.) manages the actual storage location.

200

Malware

What is: Malware is software that was designed to harm or take partial control over your computer.

200

Binary Sequence

What is: A binary sequence (also called a bitstream) is a string of ones and zeros.

300

Boolean Value

What is: A Boolean value is either TRUE or FALSE. 

300

Selection

What is: Selection means deciding (selecting) which part of an algorithm to run based on whether a condition is true or false. Every algorithm can be constructed using sequencing (following steps in order), selection (deciding), and iteration (repeating).

300

Redundancy

What is: Redundancy is the inclusion of back-up elements in case one part fails

300

Encryption

What is: Encryption is the process of encoding data to prevent unauthorized access.

300

Analog

What is: Analog data have values that change smoothly, unlike digital data which change in discrete intervals.

400

API 

What is: An application program interface (API) documents what a programmer needs to know about using a library: it's a description of each procedure's purpose, inputs, and outputs (but not its algorithms)

400

Conditional

What is: The if and if-else blocks are called conditionals because they control the code based on a true-or-false condition.

400

Open Access

What is: Open access scholarly research reports are available for free download, rather than requiring the permission of a journal publisher.

400

DDoS Attack

What is: A DDoS (Distributed Denial of Service) attack uses a virus to flood a server with many requests from many computers at once so that users of that server are denied service.

400

Lossless Compression

What is: Lossless data compression algorithms (such as PNG) are reversible (there is no loss in quality); you can reconstruct the original data

500

Abstraction

What is: Data abstraction provides a separation between the abstract properties of a data type and the concrete details of its representation. Data abstractions manage complexity in programs by giving a collection of data a name without referencing the specific details of the representation (Think lists)

500

Nested Conditional Statement

What is: A nested conditional statement is an if or if else statement inside another if else statement.

500

Creative Commons

What is: Creative Commons is a specific family of copyright licenses that allow others to use, share, maybe sell, and maybe revise your work.

500

Rogue Access Point 

What is: A rogue access point is a wireless access point that gives access to a secure network without the authorization of the network administrator.

500

Lossy compression 

What is: Lossy data compression algorithms are not fully reversible; you can reconstruct only an approximation of the original data