Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

university year 1 > omis ch1-4 > Flashcards

omis ch1-4 Flashcards

1
Q

data about data, labels, give context

A

metadata

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

Processes transaction data from terminal

A

Transaction processing system (TPS)

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

Integrates all functional areas of the organization

A

Enterprise resource planning
(ERP)

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

Supports the activities within specific functional area

A

Functional area IS

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

Provides access to data and analysis tools

A

Decision support system

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

Mimics human expert in a particular area and makes decisions

A

Expert system (ES)

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

Present structured, summarized information about aspects of business important to executives

A

Dashboards

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

Manages flows of products, services, and information among organizations

A

Supply chain management system

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

Enables transactions among organizations and between organizations and customers

A

Electronic commerce system

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

Information systems that connect two or more organizations

A

Interorganizational Information Systems (IOSs)

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

lowest level of data measurement. Numbers representing nominal data can be used only to classify or categorize. (arithmetic operations don’t make sense)

A

Nominal

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

ordinal-level measurement can be used to classify, categorize, rank or order objects, qualitative data, imprecise measurements, distance between ranks not always equal, arithmetic still doesn’t make sense but excellent > poor

A

Ordinal

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

where the distances between consecutive numbers have meaning and the data are always numerical, quantitative, arithmetic operations can be performed, zero has a meaning (not an absence)

A

Interval

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

Highest level of data measurement. Ratio data has the same properties as interval data, but ratio data have an absolute zero and the ratio of two numbers is meaningful, quantitative, defined zero point that means absence of characteristic being studied

A

Ratio

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

require that data be interval or ratio

A

Parametric statistics

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

data values are nominal or ordinal

A

Non-parametric statistics

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

takes traditional data and describes what has happened or is happening in a business

A

Descriptive analytics

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

finds relationships in the data that are not readily apparent with descriptive analytics

A

Predictive analytics

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

follows descriptive and predictive analytics in an attempt to find the best course of action under certain circumstances

A

Prescriptive analytics

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

process of collecting, exploring, and analyzing large volumes of data in an effort to uncover hidden patterns and/or relationships that can be used to enhance business decision-making

A

Data mining

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

data quality, correctness and accuracy

A

Veracity

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

-32,768 to 32,767, 16 bits

A

Short value

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

-(2^63) to 2^63, 64 bits

A

Long value

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

~ 7 decimal digits, 32 bits

A

Float

26
Q

~ 16 decimal digits, 64 bits

A

Double

27
Q

variable that can only hold positive values

A

Unsigned

28
Q

variable that can hold negative and positive values

A

Signed

29
Q

can only have 2 outcomes, T/F

A

Boolean

30
Q

stores any string of letters, numbers and symbols

A

Char

31
Q

systematic way of organizing & accessing data

A

Data structure

32
Q

sequence of characters, position of first character is 0

A

String

33
Q

an ordered collection of values with two main characteristics: Ordered and fixed length
Homogenous: every value in the array must be of the same type

A

Array

34
Q

Individual values in array

A

Elements

35
Q

order in which function calls/instructions/statements are executed when a program is running

A

Control flow

36
Q

Each element’s relative position number, usually begins with 0

A

Index

37
Q

Sequential execution: statements executed one after another as they appear
Conditional execution: if statements
Repetition: loops, repeats set of statements multiple times
Nested control structures: combining conditional statements and loops

A

Types of control flow

38
Q

LIFO, 3 basic stack commands, 3 basic stack commands, Push: insert a data item on the stack, Pop: Remove an item from the top of the stack, Peek: read the value of an item from the top of the stack without removing it

A

Stack

39
Q

FIFO, Enqueue: putting items in
Dequeue: removing items from queue

A

Queue

40
Q

can be used to define connections, hierarchy, has nodes w/ parent child relationship

A

Trees

41
Q

node without parent

A

Root

42
Q

link between any two nodes

A

Edge

43
Q

node with at least one child

A

Internal node

44
Q

node without children

A

External node (leaf)

45
Q

parent, grandparent, great grandparent etc.

A

Ancestors of a node

46
Q

number of ancestors (number of edges from root to the node)

A

Depth of a node

47
Q

maximum depth of any node to leaf

A

Height of a tree

48
Q

child, grandchild, great grandchild etc.

A

Descendant of a node

49
Q

each internal node has at most two children, children of a node are an ordered pair

A

Binary tree

50
Q

collection of nodes that have data and are connected to other nodes, can also be used to illustrate examples

A

Graph data structure

51
Q

vertex is said to be adjacent if there is an edge connecting them

A

Adjacency

52
Q

sequence of edges that allows you to go from vertex a to vertex b [0-1, 1-2]

A

Path

53
Q

a graph in which an edge (u,v) doesn’t necessarily mean that there’s an edge (v,u), also edges are represented by arrow to show direction

A

Directed graph

54
Q

aka maps/dictionaries, abstract data type that can hold data in (key, value) pairs, e.g. phonebook

A

Associative arrays

55
Q

implements an associative array, but uses a hash function to compute an index aka hash code into an array from which the desired value can be found

A

Hash table

56
Q

allows access to data in a meaningful way

A

Key

57
Q

put into bins based on their suits (key) and then sort inside of the bins into order

A

Bucket technique

58
Q

when the hash function generates the same index for multiple keys

A

Hash collision

59
Q

can fix collision by creating a linked list in that index, can be multiple chaining

A

Chaining

university year 1 (6 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions