1.3.2 Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

what are the problems with adding a second entry of the same customer on a flat file

A

only one customer entry is allowed so would not be able to add a second entry
customer data would be repeated resulting in wasted space

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

how can we ensure that the database is in 1NF

A

data is atomic
no repeating fields
has a primary key

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

how can a database be considered to be in 2NF

A

it has to be in 1NF
every field is dependent on the primary key

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

how can a database be considered to be in 3NF

A

it has to be in 2NF
transitive relationship

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

what is meant by the term hash

A

when a value is entered into an algorithm and it is converted into another value

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

what is a primary key

A

A field which uniquely identifies a record

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

what is a transaction

A

a single operation executed on data

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

what is redundancy

A

when a copy of data is created in more than one physical location

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

what are the advantages of hash

A

the process cannot be reversed, so the initial value cannot be discovered

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

what is referential integrity

A

ensures that information is not removed if it is required anywhere else in the linked table
ensures that data is accurate and consistent within a relationship

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

what is a relational database

A

uses different tables for different entities

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

what is record locking

A

prevents simultaneous access of records in a database

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

what does Atomicity mean

A

a transaction is either processed completely or not at all

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

what does Consistency mean

A

A transaction must maintain referential integrity rules

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

what does Isolation mean

A

simultaneous executions of transactions must lead to the same result

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

what does Durability mean

A

once a transaction is executed it must be saved regardless of any system failure