OCR GCSE Computer Science J277 - 1.2 Memory and Storage

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/62

flashcard set

Earn XP

Description and Tags

A complete deck of 63 vocabulary flashcards covering OCR GCSE Computer Science J277 Unit 1.2 Memory and Storage.

63 Terms

1
New cards

Primary Storage Need

The CPU needs fast access to data and instructions currently in use.

2
New cards

RAM

Volatile primary memory that stores programs and data currently in use.

3
New cards

Volatile Memory

Memory whose contents are lost when the power is switched off.

4
New cards

ROM

Non-volatile primary memory that stores instructions or data that should remain when power is off.

5
New cards

Non-volatile Memory

Memory whose contents are retained when the power is switched off.

6
New cards

RAM vs ROM

RAM is volatile and normally stores data/programs currently in use; ROM is non-volatile and stores data/instructions that should persist.

7
New cards

Virtual Memory

A section of secondary storage used as temporary memory when RAM is full.

8
New cards

Virtual Memory Operation

Data is transferred between RAM and secondary storage when there is not enough RAM.

9
New cards

Virtual Memory Speed

Secondary storage is slower to access than RAM.

10
New cards

Cache Memory

Very fast memory used to hold frequently or recently needed data and instructions for the CPU.

11
New cards

Secondary Storage Need

To store programs and data long term when power is off.

12
New cards

Secondary Storage Types

Magnetic, optical and solid state.

13
New cards

Magnetic Storage

Stores data magnetically; examples include hard disk drives and magnetic tape.

14
New cards

Optical Storage

Uses laser light to read/write data; examples include CDs, DVDs and Blu-ray discs.

15
New cards

Solid-State Storage

Stores data electronically with no moving parts; examples include SSDs and USB flash drives.

16
New cards

Storage Characteristics

Capacity, speed, portability, durability, reliability and cost.

17
New cards

Bit

A single binary digit: 00 or 11.

18
New cards

Nibble

44 bits.

19
New cards

Byte

88 bits.

20
New cards

Kilobyte (KB)

1,0001,000 bytes for OCR calculations; 1,0241,024 may also be accepted.

21
New cards

Megabyte (MB)

1,000 KB1,000\text{ KB} for OCR calculations.

22
New cards

Gigabyte (GB)

1,000 MB1,000\text{ MB} for OCR calculations.

23
New cards

Terabyte (TB)

1,000 GB1,000\text{ GB} for OCR calculations.

24
New cards

Petabyte (PB)

1,000 TB1,000\text{ TB} for OCR calculations.

25
New cards

Binary Data Representation

Digital computers process and store data using two states, represented as 00 and 11.

26
New cards

OCR Denary Range

00 to 255255.

27
New cards

OCR 8-bit Binary Range

0000000000000000 to 1111111111111111.

28
New cards

OCR Two-Digit Hexadecimal Range

0000 to FF\text{FF}.

29
New cards

Hexadecimal

Base 1616 number system using digits 0-90\text{-}9 and letters A-F\text{A-F}.

30
New cards

Hexadecimal Utility

It represents binary values more compactly and is easier for humans to read.

31
New cards

Most Significant Bit (MSB)

The bit with the highest place value, normally the leftmost bit.

32
New cards

Least Significant Bit (LSB)

The bit with the lowest place value, normally the rightmost bit.

33
New cards

Overflow Error

Occurs when the result of a binary calculation is too large to fit in the available number of bits.

34
New cards

Left Binary Shift

Moves bits left and, for positive whole numbers without overflow, multiplies the value by 22 for each place shifted.

35
New cards

Right Binary Shift

Moves bits right and, for positive whole numbers, divides the value by 22 for each place shifted, discarding shifted-out bits.

36
New cards

Character Set

A defined collection of characters and the binary codes used to represent them.

37
New cards

ASCII

A character set used to represent characters with binary codes.

38
New cards

Unicode

A character set designed to represent a much larger range of characters than ASCII.

39
New cards

Bits per Character

More bits allow more different characters to be represented.

40
New cards

Character Code Memorisation

Students do not need to memorise ASCII or Unicode character codes, but need to understand how character sets work.

41
New cards

Pixel

The smallest individual element of a digital image; each pixel is represented by a binary colour code.

42
New cards

Image Resolution

The number of pixels used to represent an image, often described by width x height.

43
New cards

Colour Depth

The number of bits used to represent the colour of each pixel.

44
New cards

Increasing Image Resolution

Image quality/detail can increase, but file size also increases.

45
New cards

Increasing Colour Depth

More colours can be represented and quality can improve, but file size increases.

46
New cards

Image Metadata

Additional information stored about an image, such as its height and width.

47
New cards

Image File-Size Relationship

File size in bits=colour depth×image height in pixels×image width in pixels\text{File size in bits} = \text{colour depth} \times \text{image height in pixels} \times \text{image width in pixels}

48
New cards

Digital Sound Storage

The sound wave is sampled at regular intervals and the samples are represented in binary.

49
New cards

Sample Rate

The number of sound samples taken per second, measured in hertz (Hz).

50
New cards

Sound Bit Depth

The number of bits available to store each sound sample.

51
New cards

Audio Duration

How many seconds of audio the sound file contains.

52
New cards

Increasing Sample Rate

Playback quality can improve, but file size increases.

53
New cards

Increasing Sound Bit Depth

Each sample can be represented more precisely, which can improve quality, but file size increases.

54
New cards

Sound File-Size Relationship

File size in bits=sample rate×duration in seconds×bit depth\text{File size in bits} = \text{sample rate} \times \text{duration in seconds} \times \text{bit depth}

55
New cards

Text File-Size Relationship

File size in bits=bits per character×number of characters\text{File size in bits} = \text{bits per character} \times \text{number of characters}

56
New cards

Compression

Reducing the size of a file.

57
New cards

Need for Compression

To use less storage space or reduce the amount of data that must be transmitted.

58
New cards

Lossy Compression

Reduces file size by permanently removing some data; the original file cannot be perfectly reconstructed.

59
New cards

Lossless Compression

Reduces file size without permanently losing data; the original file can be reconstructed.

60
New cards

Importance of Lossless Compression

When no data can be lost, such as text, program files or other data requiring exact reconstruction.

61
New cards

Suitability of Lossy Compression

For media such as images, audio or video where some loss of detail may be acceptable for a smaller file.

62
New cards

Lossy Compression Trade-off

Usually achieves a smaller file but sacrifices some quality or data.

63
New cards

Lossless Compression Trade-off

Preserves all original data but usually does not reduce file size as much as lossy compression.