4) Organisation and structure of data Flashcards

1
Q

Hexadecimal to binary

A

Split each character into 4 bits - work out binary for each

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

Hexadecimal

A

0 1 2 3 4 5 6 7 8 9 A B C D E F

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

Denary

A

Denary/Base 10/ Decimal counting system.

0 1 2 3 4 5 6 7 8 9

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

Binary

A
Base 2/ Binary digits
1 0
Bits
1 = on
0 = off
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Arithmetic shift

A

Shifts are manipulations of bit patterns.

Moving the bits a specified amount of times each direction.

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

How sound can be stored digitally

A

Sound is converted into a digital signal by sampling

Sampling is when a device measures the level of
sound many times per second and records this as binary digits

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

How an image is represented by pixels in binary format

A
1 = black pixel
0 = white pixel

Colour bitmap is stored by replacing 1s and 0s with a longer number that represents RGB

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

Why metadata needs to be included

A

metadata = data about data
Needed to store an image correctly
Image’s height, width, colour depth

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

Binary digits representing chartacters

A

Unicode
Ascii
(American standard code for information interchange)

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

Data types

A
Integer
Real
Boolean
Character
String
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Data structure

A

Specific way of organising data within memory so that it can be processed efficiently.

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

Static data structure

A

Designed to store a know number of data items.

Values can be changed but memory size is fixed

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

Dynamic data structure

A

Designed to allow the data structure to grow and shrink at runtime

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

List

A

Data items stored in the order they were originally added to memory

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

Array

A

Data structure that can hold a fixed number of data items which must be same data type.

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

1D array

A

Used to store a list of data in memory that can be used by a program at runtime.

17
Q

Insertion

A

You can add an element to an array at a given index

myArray[3] = 27

18
Q

Traversing

A

Using a loop to use each element of an array in a section of a program

19
Q

Deletion

A

myArray[6] = “”

20
Q

Search

A

Arrays can search using the index or the value stored

21
Q

2D array

A

Must all be same data type

Table with columns and rows

22
Q

Records

A

Records can hold all data types

Uses more memory - less efficient

23
Q

Key field

A

An item of data that is unique and can be used to identify the individual record

24
Q

Validation

A

Process to check if data is reasonable or sensible

DOES NOT CHECK IF DATA IS CORRECT

25
Q

Types of validation

A
Presence check
Format check
Range check
Length check
Type check
Lookup check
26
Q

Verification

A

Process for checking data is correct.

27
Q

Algorithm design

A

Make a table with data name and data type and validation checks