Back to marketplace

Unit 1 Data Representation

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

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

Card preview (18)

#1
Front (Question)

Binary systems

Back (Answer)

Computer uses binary. Has transistors which have 1s and 0s which are located in the integrated circuits.

#2
Front (Question)

Hexadecimal uses

Back (Answer)

• Memory dumps • Represent colour in HTML • MAC Addresses • URL • Assembly language • IPv6 Addresses • Locations in memory

#3
Front (Question)

MAC Address structure composed of

Back (Answer)

NN-NN-NN-DD-DD-DD First part is the organisationally unique identifier (OUI) or the manufacturer ID Next is universally administered address (UAA) serial number

#4
Front (Question)

Describe MIDI File

Back (Answer)

• Musical Instrument Digital Interface • Stores a set of notes • Does not store actual sounds • Data in file recorded using digital instruments • Sends file to audio synthesiser to play note • Specifies when each note plays and stops, duration, tempo, instrument type • Individual notes can be edited

#5
Front (Question)

Describe JPEG

Back (Answer)

• Joint photographic experts group • Standard format for storing lossy compression image • Maintain decent img quality • File size = pixels * primary Color’s

#6
Front (Question)

Describe MP3

Back (Answer)

• Format for digital audio • Actual recording of the sound • Is a lossy compression format • Recorded using microphone

#7
Front (Question)

Describe MP4

Back (Answer)

• It can store multimedia • Music, videos, text, photos • Format of lossy compression

#8
Front (Question)

Describe Parity Check and its limitations

Back (Answer)

• Method of data transmission • System could use odd or even parity • Odd/Even parity is decided and parity bit is added at the end • When receiver gets data a check is performed • Bits are counted • If incorrect data sent repeatedly till server times out Limitations: • Transposition error • When bits still add up to odd/even number • Even number of incorrect bits

#9
Front (Question)

Describe ARQ

Back (Answer)

• Transmitter sends data in packets • When received it is checked for errors • If no errors, sends an acknowledgment • If no acknowledgment received, it sends it repeatedly • Till server times out

#10
Front (Question)

Describe check digit

Back (Answer)

• Data is input with check digit • Calculation performed on inputted data • Calculated digit is then compared to a stores value • If it matches, data entered is correct • If no match, data entered is incorrect

#11
Front (Question)

Describe check sum

Back (Answer)

• Transmitter sums up total group of data before transmission • Data is sent along with the sum • Receiver works out sum and compares to stored value from transmitter • Data should match meaning it’s correct • If no match data entered is incorrect

#12
Front (Question)

Memory ascending order

Back (Answer)

Small - Large Bit Nibble = 4 bits Byte = 8 bits Kilobyte = 1000 bytes Megabyte = 1000 kilobytes Gigabyte = 1000 megabytes Terabyte - 1000 gigabytes

#13
Front (Question)

Describe Lossy compression

Back (Answer)

• A compression algorithm used • Data will be lost permanently • Reduce colour depth • Reduce number of pixels • Reduce sample rate • Use perceptual music shaping (removes inaudible sounds)

#14
Front (Question)

Describe Lossless compression

Back (Answer)

• Compression algorithm • No data will be removed permanently • For example an RLE algorithm may be used • Repeated patterns are identified and indexed • Sometimes replaced

#15
Front (Question)

Describe Bitmap img

Back (Answer)

• Stores position and colour of every pixel • Very detailed images used for photos • Makes them large files • If compression resolution decreased • Uses .bmp file

#16
Front (Question)

Describe Vector img

Back (Answer)

• Mathematically constructed image • Uses math formulas to draw shapes and lines • Results in small file size • Uses .svg file • Good for cartoons unaffected by pixelation

#17
Front (Question)

Why is Lossy better than Lossless

Back (Answer)

− Lossy decreases the file size more − Take up less storage space on webserver/users' computer − Quicker to upload/download − May not need to be high quality − Website will load faster for users − Less lag/buffering when watching − Takes up less bandwidth to download/upload − Uses less data allowance

#18
Front (Question)

Why is Lossless better than Lossy

Back (Answer)

− Image if compressed does not become pixelated − User has the option retain all original data − Can restore the compressed image into original − Also reduces file size to an extent