Data Structures

Question 1

Define primitive data type

Answer 1

Can only contain only one value

Question 2

Examples of primitive data type

Answer 2

Integer
Real (fractions)
Boolean
Character

Question 3

Define compound data type

Answer 3

Combination of primitive data types

record

Question 4

Define data structure

Answer 4

Collection of data that is organised to allow efficient processing

Question 5

Define abstract data type

Answer 5

conceptual model that describes how data is organised

Question 6

Define static data structures

Answer 6

reserves memory for a set amount of data

Question 7

Advantages of static data structures

Answer 7

being able to access element directly (by index)

Easier to program, no need to check data structure size at any point

Question 8

Disadvantages of static data structures

Answer 8

Inefficient memory use (if not full)

Can crash if not enough space is allocated

Question 9

Define dynamic data structures

Answer 9

number of data items constrained only to the overall memory allocation of the program
(linked list)

Question 10

Advantages of dynamic data structures

Answer 10

Memory capacity is not fixed.

Only necessary memory is used.

Question 11

Disadvantages of dynamic structures

Answer 11

elements cannot be readily accessed directly.

harder to program, need to keep track of its size and data item locations.

Question 12

Define memory heap

Answer 12

large pool of memory from which the running program can request chunks (linked list is taken from it)

Question 13

Define array

Answer 13

holds collection of values of the same data type