title: Memory management using bit maps vs linked list
body: <p>There are two ways of doing memory management: using bits, and using linked list. 
  While using bits, we maintain a bit map of size equal to number of allocation units
  While using liked list, we maintain two linked lists: one for allocated memory, and one for holes</p>
  
  <p>can somebody help me identify the pros and cons of these two methods, and when we should prefer on over the other. I have understood both the methods, but cannot identify the situation when I will prefer one over the other.</p>
  
  <p>To further clarify, these both techniques are standard techniques used in operating systems books.</p>