CMSC 341 -- Fall 2004 -- Project 2 Questions

Copy this file into your directory and edit it to add your answers
to the following questions about project 2.

These questions count for 10% of your project grade.

1. (5 points)

    Suppose A and B are integers such that B > A and that a memory
    manager is declared and initialized as follows:

      MemoryManager m;
      m.initialize(A, B);

    What is the worst case complexity of the free method?  What is the
    worst case complexity of the alloc method?

2. (5 points)

    Why did we suggest that blocks be inserted into free lists in
    ascending order of start address?  What part of your code would be
    more complex if free lists would not kept in sorted order?  If the
    free lists were not kept in sorted order, would it change the
    computational complexity of either alloc or free?  If so, how?