Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

Computer Science > Exchanging Data > Flashcards

Exchanging Data Flashcards

1
Q

Lossy Compression

A

Actual data is removed from the file in order to reduce its size. An algorithm is used to strip out the least important data. The original file cannot be restored as data is physically removed.

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

Lossless Compression

A

Reduces the file size but allows the original data be perfectly reconstructed from the compressed data. Actual data is still removed however the data is encoded in such a way that the original can be recreated.
Less effect at reducing file size than lossy.

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

Run Length Encoding

A

Run length encoding is used when there is repeated redundant data. It stores the item once and then an index with how often the item is repeated.

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

Dictionary Coding

A

Dictionary coding is when an index is built where every data item in the file is recorded along with an indexed reference. The final compressed file will just consist of the dictionary index along with the sequence of occurrences needed to recreate the original file.

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

Purpose of Compression

A
  1. Reduce download times
  2. Reduce requirements on file storage
  3. Make best use of bandwidth
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

uses of lossy

A

multimedia files e.g. MP3, JPEG, MPEG

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

uses of lossless

A

text files and computer programs

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

Encryption

A

Encryption is the process of encoding a message so that it can be read only by the sender and the intended recipient.

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

Symmetric Encryption

A

Symmetric Encryption is when the same key is used to encrypt and decrypt the message. Both party’s must know the key and also keep it secret.

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

Negatives of Symmetric encryption

A

There is a security risk as the key may be intercepted or the process of creating the key may be duplicated meaning the data can be decrypted by a third party.

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

Asymmetric Encryption

A

Asymmetric Encryption (Public Key Cryptography) is when a public key and a private key is used. The public key is used to encrypt the data and the private key is used to decrypt the data. If you use person X’s public key to encrypt the data only person X’s private key will be able to decrypt it

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

Hashing

A

Hashing is the process used to transform a data item into something different. A hashing function provides a mapping between an arbitrary length input and a fixed length output. It is a one-way transformation meaning you cannot get back to the original form.

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

Uses of Hashing

A
  • generating disk address

- storing and checking passwords

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

digital signature

A

Data is encrypted using the users private key. If the receiver can decryptit using the senders public key they know that the message is authentic

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

Uses of assymetric encryption

A

used for transfering data e.g. online shopping

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

Uses of symmetric encryption

A

Used when the same person is accessing and saving data e.g. for backing up

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

benefits of symmetric

A
  • encrypted very quickly

- simple and easy

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

Benefits of asymmetric

A
  • no movement of keys, more secure

- can be used for digital signatures

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

drawbacks of assymmetric

A
  • not as fast
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Database

A

Databases are structured, persistent collections of data.

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

Flat File

A

single table database. It is inefficient as it is difficult to query and leads to data redundancy which can cause errors.

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

Relational Database

A

A relational database has more than one related table. It is more efficient that a flat file database as no data is duplicated meaning querying is easier.

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

Entity Relationship Modelling

A

when the relationships between tables are shown in abstracted view.

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

relationships

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
25
primary key
A field that uniquely identifies each record
26
Foreign key
a foreign key is a field in one table that uniquely identifies a row of another table
27
composite key
A composite key is a combination of two or more columns in a table that can be used to uniquely identify a row.
28
Secondary key
any field in a database which is not a primary, candidate or foreign key. They are used to order queries.
29
Method of capturing data (Automated)
barcode readers, scanners, sensors, magnetic ink character recognition, smart card readers
30
Method of capturing data (Manual)
Paper data capture form (read by OCR & OMR or typed in manually)
31
Data redundancy
The unnecessary duplication of data in a database
32
Variable length fields
an element may use a different number of bytes to another element for example a different number of characters. Means it only uses the necessary amount of storage
33
Hashing Databases
transforms a string of characters in a record into a shortened form that can be used as a disk address
34
Attribute/field
the columns (describes the characteristics of each record)
35
Record/Tuple
the rows (a data set that applies to one item)
36
Normalisation
Organising the attributes and relations of a relational database to minimise redundancy
37
Atomic
data is in its lowest level of detail and cannot be split into separate attributes
38
partial key dependency
When a secondary key is dependent on another secondary key. (Not the primary key).
39
non key dependency
where the value of an attribute is determined by the value of another attribute which is not part of the key.
40
all attributes are dependent on..
the key, the whole key, and nothing but the key
41
first normal form
1. Eliminate duplicate columns 2. Get rid of any groups of repeating data 3. Identify the primary key 4. Separate out any attributes which are not atomic into separate attributes
42
second normal form
1. Check the data is already in 1NF 2. Remove any partial dependencies 3. ‘fix’ any many to many relationships you discover
43
third normal form
1. Check the data is already in 2NF | 2. Check there are no non-key-dependencies
44
SQL
SQL is a language which allows for fast, efficient querying and reporting of vast amounts of data held in a relational database. It is a very high-level language.
45
create a new table SQL
CREATE TABLE tblName
46
Insert data into a table SQL
INSERT INTO tblName
47
Query SQL
SELECT * FROM tblName WHERE conditions
48
Order Queried data SQL
ORDER BY
49
update attribute SQL
SET
50
Condition between two values SQL
WHERE x BETWEEN a AND b
51
Check if an attribute is similar to a given value SQL
LIKE
52
Data Integrity
Data integrity is the maintenance and consistency of data in a data store. The data store must reflect the reality that it represents.
53
Referential Integrity
Referential Integrity is where table relationships must always be consistent. Any foreign key field must agree with the primary key that is referenced by the foreign key. Thus, any changes to the primary key field must be applied to all foreign keys in another table, or not at all.
54
Transaction Processing
any information processing which is divided into individual, indivisible operations each operation must secede or fail as a complete unit.
55
ACID
Atomicity Consistency Isolation Durability
56
Atomicity
a change to a database is either completely performed or not performed at all. A half-completed change MUST NOT be saved back to the database.
57
Consistency
Any change in the database must retain the overall state of the database.
58
Isolation
a transaction must not be able to be interrupted by anther transaction. The transaction must occur in isolation so that other users or processes cannot have access to the data concerned.
59
Durability
Once a change has been made to a database it must not be lost due to a system failure.
60
Record Locking
Recording Locking prevents simultaneous access to objects in a database in order to prevent updates being lost or inconsistencies in the data arising.
61
Database Management System
software that handles the data that is stored in secondary storage.
62
What does the DMBS provide
``` Security backups index updating enforcement of referential integrity facilities to update and query the database ```
63
Why Do RISC processors result in increased battery life
- smaller instruction set - fewer transistors/ less complex circuitry - less power required
64
Composite Key
A unique identifier made from different fields
65
Secondary Key
Any field which isn't a primary/composite key which can help make a query more efficient
66
Methods of sending data
- Electronic Data Interchange (EDI) - Application Programming Interface (API) - A URL to a file
67
EDI
Is the computer-to-computer exchange of business documents in a standard electronic format between business partners.
68
API
a prewritten set of subroutines that provide access to the | companies data
69
Formats of data
- CSV (Comma Separated Value) - XML (eXstensible Markup Language) - SQL (Structured Query Language)
70
CSV (Comma Separated Value)
A text file/format with values separated by | commas
71
XML (eXstensible Markup Language)
A markup language that uses tags to denote data
72
SQL (Structured Query Language)
A language for creating/querying databases
73
SQL query
SELECT FROM WHERE
74
SQL similar elements
LIKE
75
delete rows of a table
DELETE FROM WHERE
76
insert items into a table
INSERT INTO table_name (column....) | VALUES (value...)
77
delete full tables SQL
DROP TABLE table_name;
78
combine rows from multiple rows
JOIN
79
wildcard
*, selects all the elements
80
positives of the DBMS?
- provide security - provide automatic backup - enforce data integrity rules - control data redundancy - provide users with controlled access to data they need
81
what does security keeping data safe from?
- accidental or deliberate loss | - malicious access
82
Data integrity is the state of data being
as intended and accurate
83
persistent
the data remains for as long as its required
84
structured
the data is organised in a logical way
85
indexing
used to quickly access and locate data in a table
86
Data redundancy
the unnecessary duplication of data in a database. When updates occur, all the instances of a data item must be changed. This leads to errors and also wastes storage space.
87
relational databases
multiple tables linked together
88
deadlock
when both users try and access the database at the exact same time meaning neither can edit it
89
Timestamp ordering
every object has a read timestamp and a write timestamp meaning if the read timestamps are not the same the DBMS knows another user has accessed the same object
90
how is redundancy used usefully
organisations build in redundancy e.g. duplicate hardware so that if the main system fails the backup can take over
91
Two characteristics to look for in a hashing algorithm
- quick to calculate - minimizes the collisions - provides a smaller output than input
92
EDI
Electronic data interchange is the computer to computer exchange of documents. All documents must be in a standard format/
93
Serialisation techniques
Timestamp ordering | Commitment ordering
94
Serialisation
The process of ensuring transactions do not overlap in time and therefore cannot interfere with each other
95
why is removing many-to-many relationships good?
- takes the table to 3NF | - reduces data inconsistencies/ redundancies
96
Uses of sequential files
address/ telephone books
97
Uses of serial files
storing transactions of a shop
98
structured
Data arranged in a logical and consistent pattern
99
Benefits of fixed length fields
- easier to write the software - easier to search - file size can be estimated or planned
100
what order are records stored in a database
no order, whichever order they're inputted
101
Why are primary keys neccessary?
- to identify a row unambiguously | - To link to the foreign keys of other tables
102
Difference between data redundancy and data integrity
- Data redundancy is unnecessary repetition of data | - Data integrity is accurate data which reflects reality

Computer Science (15 decks)

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