Brainscape's Knowledge GenomeTM

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


See full index

Computer Science > Unit 4 - Exchanging Data > Flashcards

Unit 4 - Exchanging Data Flashcards

1
Q

what is lossy compression

A

non-essential data is permanently removed

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

how does lossy compression work on images

A

different shades of the same colour in an image will be made into a single shade

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

how does lossy compression work on sound files

A

frequencies outside the human hearing range are removed

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

what is lossless compression

A

patterns in the data are spotted and summarised in a shorter format without permanently removing any information

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

what is run length encoding

A

a basic method of compression that summaries consecutive patterns of the same data. this works well with image and sound where data can be repeated many times

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

what is dictionary compression

A

spots regularly occurring data and stores it separately in a dictionary. the reference to the entry in the dictionary is stored in the main file thereby reducing the original data stored

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

what is encryption

A

the transformation of data from one form to another to prevent an unauthorised third party from being able to understand it

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

what is plain text

A

the original data or message

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

what is cipher text

A

the encrypted data

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

what is the cipher

A

the encryption method or algorithm

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

what is the key

A

the secret information to lock or unlock the message

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

give an overview of the caesar cipher

A

a type of substitution cipher that works by shifting the letters of the alphabet along by a given number of characters

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

give an overview of the vernam cipher

A

the one-time pad (key) must be equal or longer in characters than the plaintext, random and only used once. one-time pads are used in pairs where the sender and recipient are both party to the key

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

what is symmetric encryption

A
  • private key
  • the same key is used to encrypt and decrypt
  • this means that the key must also be transferred to the recipient
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

what is asymmetric encryption

A
  • public key
  • one key is made public so that others wishing to send you data can use this key to encrypt it
  • the public key cannot decrypt the data
  • a private key is used to decrypt the data
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

what is hashing

A

hashing turns your password or PIN into a short sting of letters and/or numbers using a hashing algorithm

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

what is a database

A

a database is an organised store of data usually controlled by a DBMS

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

what is a flat file database

A

consisting of information about a single entity

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

define entity

A

an entity is a category, object, person, event or thing of interest about which data needs to be recorded

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

define field

A

a field is one piece of information about the object (columns)

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

define record

A

a record is all of the fields about the individual object within an entity (rows)

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

how is an entity represented

A

table

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

define attribute

A

attributes define what type of data is stored in an entity

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

what is a primary key (entity identifier)

A
  • each entity needs an identifier which uniquely identifies a particular record
  • in a relational database, the identifier is knows as the primary key
  • it is underlined in the entity description
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

what is the secondary key

A
  • the primary key is automatically indexed so that any particular record can be found very quickly
  • in some databases, searches may often need to be made on many fields
  • so a secondary key is introduced
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

what is a composite primary key

A
  • sometimes one or more attributes are needed to uniquely define a record
  • in this case there is still one primary key, but made up of data from two or more fields
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

what are the three different relationships between entities

A
  • one-to-one
  • one-to-many
  • many-to-many
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

how does a relational database work

A

a separate table is created for each entity identified in the system. where a relationship exists between entities, an extra field called a foreign key links the two tables

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

what is a foreign key

A
  • a foreign key is an attribute that creates a join between two tables (relation)
  • it is the attribute that is common to both tables
  • the primary key in one table is the foreign key in the table to which it is linked
30
Q

what entity relationship doesn’t work in databases

A

many-to-many

31
Q

how to get around a many-to-many relationship

A

introduce a new table to split the many-to-many relationship

32
Q

what is referential integrity

A

no foreign key in one table can reference a non-existent record in a related table

33
Q

what is normalisation

A

a process used to come up with the best possible design for a relational database

34
Q

how should a normalised table be organised

A
  • no data is unnecessarily duplicated
  • data is consistent throughout the database. consistency should be an automatic consequence if not holding any duplicated data
  • structure is flexible
  • users should be able to make complex queries
35
Q

what is a complex query

A

involves two or more search criteria

36
Q

what is first normal form

A
  • no repeating attributes or groups of attributes
  • all attributes must be atomic - a single attribute cannot consist of two data items such as a first name and surname
37
Q

what is second normal form

A
  • must be in 1NF
  • contains no partial dependencies
  • this can only occur if the primary key is a composite key
38
Q

what is third normal form

A
  • must be in 2NF
  • contains no non -key dependencies
  • “all attributes are dependent on the key, the whole key not nothing but the key”
39
Q

advantages of normalisation

A
  • maintaining and modifying the database
  • faster sorting and searching
  • deleting records
40
Q

what is SQL

A

structured query language - a declarative language used for querying and updating tables in a relational database. it can also be used to create tables.

41
Q

SELECT…FROM…WHERE

A

used to extract a collection of fields from a given table

42
Q

SQL: dates

A
  • # …# (dates in american format)
43
Q

SQL: not equal to

A

<>

44
Q

SQL: JOIN

A

an alternative method for combining records (rows) from two or more tables

45
Q

SQL: defining a database table

A

CREATE TABLE tblProduct
(
Product ID CHAR(4) NOT NULL PRIMARY KEY,
Description VARCHAR(20) NOT NULL,
Price CURRENCY
)

46
Q

SQL: CHAR(n)

A

character string of fixed length n

47
Q

SQL: VARCHAR(n)

A

character string variable length, max. n

48
Q

SQL: adding a column in a table

A

ALTER TABLE tblProduct
ADD QtyInStock INTEGER

49
Q

SQL: deleting or altering a table structure

A

to delete a column:
ALTER TABLE tblProduct
DROP QtyInStock

to change the data type of a column:
ALTER TABLE tblProduct
MODIFY COLUMN Description VARCHAR(30) NOT NULL

50
Q

SQL: defining linked tables

A

CREATE TABLE ProductComponent
(ProductID. CHAR(4) NOT NULL,
CompID CHAR(6) NOT NULL,
Quantity INTEGER,
FOREIGN KEY ProductID REFERENCES Product(ProductID)
FOREIGN KEY CompID REFERENCES Component(CompID)
PRIMARY KEY (ProductID, CompID)

51
Q

SQL: inserting data

A

INSERT INTO Product(ProductID, Description,Price),
VALUES (“A345”, “Pink Rabbit”, 7.50)

52
Q

SQL: updating a table

A

UPDATE Product,
SET Description = “Blue Rabbit”, Price = 8.25

53
Q

SQL: deleting a record

A

DELETE FROM Product

54
Q

manual methods of data capture

A

forms (filled out by hand)

55
Q

automated methods of data capture

A
  • smart card readers
  • barcode readers
  • scanners
  • optical character recognition
  • sensors
56
Q

examples of inputting data

A
  • automatically using the DMBS software
  • typing it in
  • importing form a spreadsheet or file
  • using EDI
57
Q

what is EDI

A

electronic data interchange - the computer-to-computer exchange of documents
- it replaces post, email or fax
- all documents must be in a standard form so that the computer can understand them

58
Q

how is data selected

A

data may be selected if it matches certain criteria. can be done using SQL, for example, Query by Example in Access

59
Q

what is transaction processing

A

in the context of databases, a single logical operation is defined as a transaction. it may consist of several operations

60
Q

what is ACID

A

this is a set of properties to ensure that the integrity of the database is maintained under all circumstances. it guarantees that transactions are processed reliably

61
Q

define A in ACID

A

atomicity - this property requires that a transaction is processed in its entirety or not all. in any situation, including power cuts or hard disk crashes it is not possible to process only part of a transaction

62
Q

define C in ACID

A

consistency - this property ensures that no transaction can violate any of the defined validation rules. referential integrity, specified when the database is set up, will always be upheld

63
Q

define I in ACID

A

isolation - ensures that concurrent execution of transactions leads to the same result as if the transactions were processed one after the other. this is crucial in a multi user database

64
Q

define D in ACID

A

durability - this ensures that once a transaction has been committed, it will remain so, even in the event of a power cut. as each part of the transaction is completed, it is held in a buffer in the disk until all elements of the transaction are completed. only then will the changes to the database tables be made

65
Q

what is record locking

A

record locking prevent simultaneous access to objects in a database in order to prevent updates being lost or inconsistencies in the data arising. using record locking, a record is locked when a data is retrieved for editing and updating. anyone else attempting to retrieve it is denied access until the transaction is completed or cancelled

66
Q

problems with record locking

A

if two users are attempting to update two records, a situation can arise in which neither can proceed, known as deadlock

67
Q

what is serialisation

A

ensures that transactions do not overlap in time and therefore cannot integrate with each other or lead to updates being lost

68
Q

what is time stamp ordering

A

every object in the database has a read timestamp and a write timestamp. these are updated whenever an object is read or written. when a user tries to save the update, if the read timestamp is not the same as it was when they started the transaction, the DBMS knows another user has accessed the same object.

69
Q

what is commitment ordering

A

this is another serialisation technique to ensure that no transactions are lost if two clients are simultaneously trying to update a record. transactions are ordered in terms of their dependencies on one another as well as the time they were initiated. it can be used to prevent deadlock by blocking one request until another is complete.

70
Q

what is redundancy

A

many organisations cannot afford to have their computer systems go down for even a short time. therefore, they have built-in redundancy in their computer systems - this is called a failover system. it is duplicate hardware, located in different geographical areas, mirrors every transaction that takes place on the main system. if this fails, the backup system automatically takes over.

Computer Science (12 decks)

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