Back to marketplace

1.3 Exchanging data

No description yet. This curated deck is ready for daily study.

Total cards: 24•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (24)

#1
Front (Question)

What is compression?

Back (Answer)

the process used to reduce storage space required by a file

#2
Front (Question)

What is the purpose of compression? (4)

Back (Answer)

-reduce file sizes -reduce download times -reduce storage requirements -make best use of bandwidth (amount of data sent at a time)

#3
Front (Question)

What are the two categories of compression?

Back (Answer)

-lossy -lossless

#4
Front (Question)

What do we mean by lossy compression?

Back (Answer)

a type of compression that reduces sizes of files by removing some of its information e.g. a more pixelated image/less clear audio recording

#5
Front (Question)

What type of files are used for lossy compression?

Back (Answer)

-sound files -image files

#6
Front (Question)

What do we mean by lossless compression?

Back (Answer)

a type of compression where the original file can be recovered

#7
Front (Question)

What type of files are used for lossless compression?

Back (Answer)

-text files -executable files

#8
Front (Question)

What are the two methods to use lossless compression?

Back (Answer)

-run length encoding -dictionary encoding

#9
Front (Question)

What is run length encoding?

Back (Answer)

a form of lossless compression where repeated values are removed and replaced with the single data item followed by the number of times it should be repeated e.g. AAAAABCCC would give A5B1C3

#10
Front (Question)

What is an inefficiency when using run length encoding?

Back (Answer)

-relies on consecutive pieces of data being the same - little repetition = little reduction in file size

#11
Front (Question)

What is dictionary encoding?

Back (Answer)

a form of lossless compression which replaces commonly repeated data with an index and saves the compressed data together with a dictionary that links the frequently repeated data to their corresponding index e.g. I 1 went 2 to 3 the 4 park 5 . 6 [space] 7 this dictionary would then help decode 17273747576

#12
Front (Question)

What is something to remember about dictionary encoding?

Back (Answer)

if the compressed data isn’t transferred alongside its dictionary, the data cannot be used

#13
Front (Question)

What do we mean by encryption?

Back (Answer)

the process of encoding a message so it can be read only the sender and the intended recipient

#14
Front (Question)

What do we mean by encoding a message?

Back (Answer)

converting the message from plain text to cyphertext

#15
Front (Question)

What are the two types of encryption?

Back (Answer)

-symmetric -asymmetric

#16
Front (Question)

How does symmetric encryption work?

Back (Answer)

-both sender and receiver share the same private key - key is used for both encrypting and decrypting data

#17
Front (Question)

How can symmetric encryption by intercepted? (2)

Back (Answer)

-interception of the key -duplicating the key to have a copy

#18
Front (Question)

How does asymmetric encryption work?

Back (Answer)

-two keys used: public & private -public key can be published anywhere but private must be secret (together known as a key pair) -messages encrypted with public key can only be decrypted with the corresponding private key

#19
Front (Question)

What is hashing?

Back (Answer)

a process where an input (called a key) is turned into a fixed sized value (a hash)

#20
Front (Question)

How are keys turned into a hash?

Back (Answer)

uses algorithms called hash functions

#21
Front (Question)

What is something to know about hashing?

Back (Answer)

-one way process: the output of a hash function cant be reversed to form the key -the key cant be reversed to gain the passwords

#22
Front (Question)

What are hash tables?

Back (Answer)

a data structure which holds key-value pairs

#23
Front (Question)

What do we mean by a collision?

Back (Answer)

when two keys produce a same hash

#24
Front (Question)

How can we overcome collisions?

Back (Answer)

-storing items in a list under a new hash value -using a second hash function to generate a new hash