class revision Flashcards

1
Q

difference between redundant data and data redundancy

A
  • redundant data is BAD(repeated data in the database)
  • data redundancy is when copies of the database are made so they can be used in case something happens
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

when does a datanase have RI (2)

A
  • relationships are consistent
  • each foreign key links to an existing primary key
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

what is a foreign key

A

a key in another table which references the primary key

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

what is a constraint in a database

A

a set of ules set by the programmer such as defining the primary key and the foreign key.

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

what enforces data integrity

A

ACID

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

what happens when data moves down layers

A

it is further encapsulated (headers and addresses are added)

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

what performance modelling

A

when simulations are produced to model situations before implementing these into the real world

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

what are the advantages to caching(2)

A
  • faster response times as data doesn’t need to be read from disk
  • reduces the load on a system(fewer data access movements)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

what are the disadvantages to caching(2)

A
  • very hard to program and apply successfully
  • if the wrong data is cached the program could end up running slower
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

what are the 4 chategories of development methodologies

A
  • linear
  • ## iterative
  • predictive(documebt focused)
  • adaptive(code focused)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

what is a global variable

A

a variable which is defined in the main program

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

what is a local variable

A

a variable which is defined in a procedure/function

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

how does ByValue work

A

a copy of the variable’s data is passed into the subroutine

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

how does ByReference work

A

a pointer to the variable’s
memory location is passed

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

what is the purpose of the address bus

A

to transmit the address of data to be read from or written to RAM

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

where is the data stored when the address bus reads from it

A

in the MAR

17
Q

what is the purpose of the data bus

A

to transmit data between CPU and RAM

18
Q

what are the protocols involved in the application layer

A

HTTP and DNS

19
Q

what is the role of the HTTP

A

sends requests to webpages

20
Q

what is the protocol involved in the transport layer and what does it do

A

TCP, creates a reliable connection between the nodes and the server

21
Q

what happens in the transport layer

A
  • headers and port numbers are added to data packets
  • packets are reordered as they arrive at the destination
22
Q

what protocol is involved in the internet layer

23
Q

what happens in the internet layer

A
  • routers use IP addresses to direct data packets across networks
  • headers are added to packets
24
Q

what is the protocol involved in the link layer

25
what happens in the link layer
data packets travel through cables
26
what are the 3 steps to packets switching
1. data is split into equal sized blocks, called packets, each packet has a header of information(destination address) 2. each packet is placed on the network and each packet may take a different route 3. packets are reordered at the destination
27
what does the TCP protocol stand for
Transmission Control Protocol
28
3 properties of a good hashing algorithm
- reduced chances of collisions - even distribution - fast execution
29
what is linear probing
the value is placed in the next empty bucket(index)
30
what is chaining
when each bucket in the in the hash table has its own linked list,that points to the next value added to that bucket
31
what is the value in the index called when chainnig is used
pointer to memory location