memory allocation

Question 1

static allocation def

Answer 1

programs needing a FIXED amt of memory space & continually reusing it till program terminates

Question 2

dynamic allocation def

Answer 2

data needed by program not alw fixed size, program will req for more memory whenever required

Question 3

static > dynamic

Answer 3

• enjoy faster constant-time access to data (while dynamic data structures need to be walked to discover the memory address of other memory blocks)
• allows binary search, more efficient than linear search (application)

Question 4

dynamic > static

Answer 4

more efficient memory use (memory can be allocated / de-allocated as needed during runtime as data structure grows / shrinks so it only uses as much memory as necessary while static might not use all memory that’s allocated)

Question 5

disadvantage / problem of dynamic data structure

Answer 5

• higher overhead bc allocated blocks also need store pointers to other blocks (context)
• may run out of memory if total amt of memory used by data structure is not tracked when handling ALOT of data bc OS may not have that much memory but only crashes during runtime (static will not allow program to run at all bc if dh enough memory, will reject program execution)
• may lead to memory fragmentation (avail memory on device no longer in large continuous blocks but in small fragments :. os may not be able to find large contiguous blocks of memory for static allocations when req)