List And Pointer Flashcards Preview

Computing > List And Pointer > Flashcards

Flashcards in List And Pointer Deck (7):
0

What are the advantage of an array/linear list

It's easy to program
If elements are stored in key order, a binary search is possible

1

What are the disadvantages of linear list/array

Memory locations may be wasted.
Insertion of an element within an ordered list required moving elements.
Deletion of an element within a list requires moving elements

2

What are pointers?

A pointer is a variable that contains an address. A pointer points to the memory location with that address.

3

What's an heap?

The memory locations available to application program for dynamic allocation

4

What's a "dynamic allocation"?

A dynamic allocation: memory space is only allocated when required at run time

5

What are advantages of the heap?

More efficient use of memory when dealing with data of unknown and changing size

6

What's a dynamic structure

The amount of memory taken up can vary at run time