Computer Science - Fundamentals of data representation

0.0(0)
studied byStudied by 1 person
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/48

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

49 Terms

1
New cards

What is the capacity of a device

How much data can be stored in the given storage medium.

2
New cards

What is the smallest unit of data called

A bit or binary digit.

3
New cards

4 bits is called

Nibble

4
New cards

8 bits is called

A byte.

5
New cards

1000 bytes is called

A kilobyte (KB).

6
New cards

1000KB is called

A megabyte (MB).

7
New cards

1000MB is called

A gigabyte (GB).

8
New cards

1000GB is called

A terabyte (TB).

9
New cards

How to calculate required capacity

R = no of files*size of a single file

10
New cards

Why do computers use hexadecimal instead of binary

  • It’s easier for humans to read and understand.

  • Large number can be represented using fewer digits.

  • Allows us to find errors more easily.

11
New cards

In what programming languages is hex used in

Machine code and assembly language

12
New cards

What is hex used for

  • Programming languages.

  • Can represent numbers stored in main memory.

  • Can be used in the debugging state of programming.

13
New cards

How many hex digits represent 8 bits (a byte)

Two hex digits represent 8 bits.

14
New cards

What is a MAC address

A number that uniquely identifies a networked device

15
New cards

What is the max denary number represented using hex digits

255

16
New cards

0+0=

1+0=

1+1=

1+1+1=

0

1

0 carry 1

1 carry 1

17
New cards

What is a binary shift

A technique for performing multiplication or division on a binary number.

18
New cards

What happens in a left binary shift

Each digit is moved 1 place to the left or multiplied by 2

19
New cards

What happens in a right binary shift

Each digit is moved 1 place to the right or divided by 2

20
New cards

What are the 2 character sets computer uses

  1. American Standard Code for Information Interchange (ASCII)

  2. Unicode

21
New cards

What is the most common form of Unicode

UTF-8 uses between 8 and 32 bits to represent every character

22
New cards

How many bits is ASCII represented by

7 bits (max of 128 characters)

23
New cards

Why is Unicode better than ASCII

Because Unicode covers all languages, ASCII covers only English

24
New cards

How are digital images stored as

Bitmaps

25
New cards

What is colour depth

The amount of bits used to store each colour

26
New cards

What is resolution

It represents the number of pixels in an image.

27
New cards

Formula for finding no of pixels in an image

Width*Height

28
New cards

What is metadata

Extra information added to an image file

29
New cards

Examples of metadata

Resolution, colour depth, time and date of the photo taking, encoding format

30
New cards

Formula for calculating file size in bits

Image width*image height*colour depth (in bits)

31
New cards

Formula for calculating file size in bytes

File size in bits/8

32
New cards

In a black and white image how are the pixels represented

0 represents black

1 represents white

33
New cards

What is sample size

The number of bits used to store each sample

34
New cards

What is sampling rate

The number of samples taken per second

35
New cards

How is the quality of an audio increased

By increasing the sample size and the sampling rate

36
New cards

What is bit rate

The amount of data stored per second of an audio

37
New cards

How is bit rate calculated

Sample rate * sample size

38
New cards

How does increasing audio increase file size

Because the sampling rate and sample size is increased

39
New cards

What is compression

Reduction of file size

40
New cards

What are the 2 types of compression

Lossless and Lossy

41
New cards

Features of lossless compression

  • None of the original data is lost.

  • An algorithm can be used to perfectly restore the original file when needed.

  • This is especially useful for executable files, where all of the data is necessary.

  • Lossless compression causes file size to reduce moderately.

42
New cards

Features of lossy compression

  • An algorithm is applied to remove unnecessary detail from the original file.

  • Some data is permanently lost, but enough remains so that the file is still useful and there is barely a noticeable difference.

  • Lossy compression results in dramatic file size reduction.

43
New cards

What is run length encoding (RLE)

A type of lossless compression that replaces repeating sequences of binary digits with more efficient representations.

44
New cards

What is Huffman coding

A type of lossless compression for text compression which reduces file size by assigning a fewer no of bits to the most frequently used characters

45
New cards
46
New cards
47
New cards
48
New cards
49
New cards