Exams problems:

What are the benefits of library routines in the development of a program:

• they are tried and tests so are free from erros.

• Perform functions that you may not be able to program yourself.

• They are readily available / speed up development time.

Why arrays are used to store data?

• Search and organise data is easier.

• Make program easier to design and understand

• Multiple instances references via a single identifier.

Why use a linked list instead of an array?

• Has pointers to determine the order of the data.

• Easier to add, delete data

Disadvantages of linked list instead of array:

• Need to store pointers as well as data.

• Difficult to set up.

How linked list can be implemented:

1 Declare two (1D) arrays

2 One for data, one for pointers

3 Elements from same index represent one node

4 Declare an integer / variable for StartPointer // explain its use

5 Define appropriate value for null pointer // explain its use

6 Declare an integer / variable for FreeList pointer // explain its use

7 Routines are needed to add / delete / search