quizlet.com/910860495/print

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/101

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

102 Terms

1
New cards

decimal

A base-10 number system that uses ten distinct symbols 0-9 to represent numbers.

2
New cards

binary

A way of representing information using only two options.

3
New cards

bit

A contraction of "Binary Digit"; the single unit of information in a computer, typically represented as a 0 or 1

4
New cards

byte

The standard fundamental unit (or "chunk size") underlying most computing systems today. One equals eight bits.

5
New cards

overflow error

Error from attempting to represent a number that is too large.

6
New cards

round-off error

Error from attempting to represent a number that is too precise. The value is rounded.

7
New cards

RGB

The color model that uses varying intensities of red, green, and blue light added together to produce a broad array of colors.

8
New cards

protocol

A set of rules governing the exchange or transmission of data between devices.

9
New cards

ASCII

The universally recognized raw text format that any computer can understand.

10
New cards

abstraction

A simplified representation of something more complex. It allow you to hide details to help you manage complexity, focus on relevant concepts, and reason about problems at a higher level.

11
New cards

image

A type of data used for graphics or pictures.

12
New cards

pixel

Short for "picture element" it is the fundamental unit of a digital image, typically a tiny square or dot which contains a single point of color of a larger image.

13
New cards

analog data

Data with values that change continuously, or smoothly, over time. Some examples of include music, colors of a painting, or position of a sprinter during a race.

14
New cards

digital data

Data that changes discretely (individually separate or distinct) through a finite set of possible values.

15
New cards

sampling

A process for creating a digital representation of analog data by measuring the analog data at regular intervals called samples.

16
New cards

lossless compression

A data compression algorithm that allows the original data to be perfectly reconstructed from the compressed data. Used for text compression and .gif images.

17
New cards

copyright

The exclusive legal right given to a creator to print, publish, perform, film, or record literary, artistic, or musical material, and to authorize others to do the same.

18
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.

19
New cards

open access

Online research output that is free of any and all restrictions on access and free of many restrictions on use, such as copyright or license restrictions.

20
New cards

open source

Computer programs that are made freely available and may be redistributed and modified.

21
New cards

lossy compression

A compression method in which some of the information is lost or thrown away. This process is not reversible.

22
New cards

path

The series of connections between computing devices on a network starting with a sender and ending with a receiver.

23
New cards

bandwidth

The maximum amount of data that can be sent in a fixed amount of time, usually measured in bits per second.

24
New cards

IP Address

The unique number assigned to each device on the Internet.

25
New cards

Internet

A computer network consisting of interconnected networks that use standardized, open (nonproprietary) communication protocols.

26
New cards

router

A type of computer that forwards data across a network.

27
New cards

redundancy

The inclusion of extra components so that a system can continue to work even if individual components fail, for example by having more than one path between any two connected devices in a network.

28
New cards

fault tolerant

Can continue to function even in the event of individual component failures. This is important because elements of complex systems like a computer network fail at unexpected times, often in groups.

29
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.

30
New cards

Transmission Control Protocol (TCP)

A protocol for sending packets that does error-checking to ensure all packets are received and properly ordered.

31
New cards

User Datagram Protocol (UDP)

A protocol for sending packets quickly with minimal error-checking and no resending of dropped packets.

32
New cards

scalability

The capacity for the system to change in size and scale to meet new demands.

33
New cards

Domain Name System (DNS)

The system responsible for translating domain names like example.com into IP addresses.

34
New cards

HyperText Transfer Protocol (HTTP)

The protocol used for transmitting web pages over the Internet.

35
New cards

World Wide Web

A system of linked pages, programs, and files.

36
New cards

digital divide

The differing access to computing devices and the Internet, based on socioeconomic, geographic, or demographic characteristics.

37
New cards

user interface

The inputs and outputs that allow a user to interact with a piece of software.

38
New cards

input

Data that are sent to a computer for processing by a program.

39
New cards

output

Any data that are sent from a program to a device.

40
New cards

program statement

A command or instruction. Sometimes also referred to as "code."

41
New cards

program

A collection of program statements.

42
New cards

sequential programming

A description of how program statements run in order, from top to bottom.

43
New cards

event

An action that occurs when a program is running and supplies input into the program.

44
New cards

comment

A form of program documentation written into the program to be read by people and which do not affect how a program runs

45
New cards

pair programming

A collaborative programming style in which two programmers switch between the roles of writing code and tracking progress.

46
New cards

bug

An error or deficiency in a computer program.

47
New cards

debugging

Finding and fixing problems in an algorithm or program.

48
New cards

algorithm

A set of steps used to solve a problem

49
New cards

incremental development

A software development approach that breaks the process of developing an application into smaller parts. The system may include choosing a topic, designing the user interface, and adding functionality.

50
New cards

iterative development

A software development approach that uses a system to repeatedly refine your work. The system may include planning, designing, implementing, and testing steps.

51
New cards

bias

A tendency to believe that some things, people, ideas, etc., are better than others that may result in treating some people unfairly.

52
New cards

variable

A named memory reference to a value that can be used repeatedly throughout a program.

53
New cards

string

An ordered sequence of characters - letters, numbers, symbols, spaces.

54
New cards

assignment operator

Represented by a single equal sign (=). Allows a program to change the value represented by the variable its left side.

55
New cards

concatenate

The process of joining two strings together using the + operator.

56
New cards

Boolean value

true or false value

57
New cards

selection (conditional) statement

Affects the sequential flow of control by executing different statements based on the value of a Boolean expression.

58
New cards

logical operator

Symbols that evaluate to a Boolean value:

NOT, AND, OR

59
New cards

procedure

A named group of programming commands.

60
New cards

procedure call

A command that executes code within a procedure

61
New cards

global variable

A variable that can be used anywhere in your code. Create them outside events and other procedures.

62
New cards

list

An ordered collection of data elements stored and accessed in a program.

63
New cards

element

An individual value in a list that is assigned a unique index.

64
New cards

index

A common method for referencing the elements in a list or string using sequential numbers.

65
New cards

append

Add elements to the end of a list.

66
New cards

iterating

Repeating a portion of an algorithm a specified number of times or until a given condition is met.

67
New cards

infinite loop

Occurs when the ending condition of a loop will never evaluate to true

68
New cards

simulation

Imitation of a real world situation that allow us to test solutions or run experiments in a way that is usually cheaper, safer, and often times faster.

69
New cards

traversal

The process of accessing each item in a list or string one element at a time.

70
New cards

substring

Part of an existing string.

71
New cards

efficiency

A measure of how many steps are needed to complete an algorithm.

72
New cards

linear search

A search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.

73
New cards

binary search

A search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated.

74
New cards

reasonable time

Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time.

75
New cards

unreasonable time

Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time.

76
New cards

heuristic

Provides a "good enough" solution to a problem when an actual solution is impractical or impossible.

77
New cards

optimization problem

A problem with the goal of finding the "best" solution among many (Ex, What is the shortest path from A to B?)

78
New cards

undecidable problem

A problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer.

79
New cards

sequential computing

A model in which programs run in order, one command at a time.

80
New cards

parallel computing

A model in which programs are broken into small pieces, some of which are run simultaneously.

81
New cards

distributed computing

A model in which programs are run by multiple devices.

82
New cards

speedup

The time used to complete a task sequentially divided by the time to complete a task in parallel.

83
New cards

metadata

data about data

84
New cards

cleaning data

The process that makes data uniform without changing its meaning (e.g., replacing all equivalent abbreviations, spellings, and capitalizations with the same word).

85
New cards

data filtering

Choosing a smaller subset of a data set to use for analysis, for example by eliminating / keeping only certain rows in a table.

86
New cards

citizen science

Scientific research conducted in whole or part by distributed individuals, many of whom may not be scientists, who contribute relevant data to research using their own computing devices.

87
New cards

crowdsourcing

The practice of obtaining input or information from a large number of people via the Internet.

88
New cards

machine learning

How computers recognize patterns and make decisions without being explicitly programmed.

89
New cards

data bias

Data that does not accurately reflect the full population or phenomenon being studied.

90
New cards

computing innovation

Includes a program as an integral part of its function. Can be physical (e.g. self-driving car), non-physical computing software (e.g. picture editing software), or non-physical computing concepts (e.g., e-commerce).

91
New cards

data mining

The practice of analyzing large databases in order to find patterns and relationships to generate some new information. Data mining may be used to access a user's password by guessing based on publicly available information about the user.

92
New cards

decryption

The process that takes a secret message and reproduces the original plain text.

93
New cards

encryption

The process of encoding messages to keep them secret, so only "authorized" parties can read it.

94
New cards

keylogging

The use of a program to record every keystroke made by a computer user in order to gain fraudulent access to passwords and other confidential information.

95
New cards

malware

Software intended to damage a computing system or to take partial control over its operation.

96
New cards

multi-factor authentication

A system that requires at least two steps to unlock protected information; each step adds a new layer of security that must be broken to gain unauthorized access.

97
New cards

Personally Identifiable Information (PII)

Information about an individual that identifies, links, relates, or describes them.

98
New cards

phishing

A technique that attempts to trick a user into providing personal information. That personal information can then be used to access sensitive online resources, such as bank accounts and emails

99
New cards

public key encryption

Encryption method that pairs a public key for encryption and a private key for decryption. The sender does not need the receiver's private key to encrypt a message, but the receiver's private key is required to decrypt the message.

100
New cards

rogue access point

A wireless access point that gives unauthorized access to secure networks.