Question: Which of the following free lists is used to facilitate faster insertion and deletion operations on memory area while managing the free lists.

Answer:

Singly linked list requires lot of work when a memory area is to be inserted into the list or deleted from it.as deletion of a memory area requires a change in the pointers stored in the previous memory area in the list.same this is for insertion operation.in Doubly linked free list each entry contains two pointers-one points to the next memory area in the list.while other points to the previous memory area.if a memory area with a specific address is to be deleted from the list,the kernel can simply take the pointer to the previous and following memory area in the list,and manipulate pointer in these areas to perform the deletion.