3.1.1 - 3.2.3 Notes Flashcards

1
Q

program that helps to efficiently organize/find trends in information

A

spreadsheets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

the collection of facts/patterns that are extracted from data

A

information

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

an association between two or more things, digitally processed data may show it, but it is not certain to also show causation

A

correlation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

varying smoothly from one value to another, opposite of discrete

A

continuous data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

continuous method used to represent data

A

analog data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

jumping from one value to another without taking on all intermediate values, opposite of continuous

A

discrete data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

where algorithms check each element in a list until desired value is found

A

linear search

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

works on sorted data, compares middle element of data to determine next search, cuts the search set in half at each destination

A

binary search

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

data beyond the resources of one computer to store, especially intensive to analyze, when data is too large or complex

A

big data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

when storage or processing is handled by multiple independent machines in a coordinated fashion.

A

distributed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

intelligent behavior demonstrated by machines, in contrast to natural intelligence of humans

A

artificial intelligence (AI)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

estimation of the amount of computational resources used by an algorithm, efficiency is typically represented as a function of the size of the input, and describes how quickly an algorithm executes

A

algorithmic efficiency

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

information about data, or data about data

A

metadata

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

general description of task that cannot be solved algorithmically

A

problem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

algorithms with efficiencies that grow at a polynomial rate or slower, are said to run in like this

A

reasonable time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly