List And Pointer

Question 0

What are the disadvantages of linear list/array

Answer 0

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

Question 1

What are the advantage of an array/linear list

Answer 1

It’s easy to program

If elements are stored in key order, a binary search is possible

Question 2

What are pointers?

Answer 2

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

Question 3

What’s an heap?

Answer 3

The memory locations available to application program for dynamic allocation

Question 4

What’s a “dynamic allocation”?

Answer 4

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

Question 5

What are advantages of the heap?

Answer 5

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

Question 6

What’s a dynamic structure

Answer 6

The amount of memory taken up can vary at run time