omis ch5-9 Flashcards
step by step process for performing a task in a finite amount of time, has a certain output
Algorithm
the ability of a system to gracefully accommodate growing sizes of inputs/amounts of workload
Scalability
how long it takes to perform a task
Running time
T(n) = maximum time of algorithm on any input of size n
Worst case running time
= O(n)
Linear search
= O(logn), only if input is sorted
BInary search
theoretical definition of complexity of an algorithm as a function of the size, Order of magnitude of complexity
Big O
search methods with most inefficient performance
exponential and factorial runtime
walk down list, comparing adjacent elements, swapping them if they are in the wrong order until list is sorted
Bubble sort algorithm
internal sources, personal sources, external sources, new sources
sources of data
what goes wrong with data
lost, stolen, deleted, hacked
data increases exponentially, data scattered, outdated, new sources
difficulties managing data
people/processes and procedures of data in order to improve data security, increase consistency and reduce fines
Data governance
semi permanent data or permanent data that you want records of e.g. customer name, telephone number
master data
activities or events
transaction data
Database management systems minimize 3 problems
Data redundancy
Data isolation (security)
Data inconsistency
Database management systems maximize 3 problems
Data integrity
Data security
Data independence