Q. Which of the following statements are true ?
i) practical application of XOR linked lists are in environments with limited space requirements, such as embedded devices.

ii)xor lists are not suitable because most garbage collectors will fail to work properly with classes or structures that don’t contain literal pointers

iii)in order to calculate the address of the next node you need to remember the address of the previous node

iv)xor lists are much efficient than single, doubly linked lists and arrays

View solution

Q. Given 10,8,6,7,9
swap the above numbers such that finally you got 6,7,8,9,10

so now reverse 10

9,7,6,8,10

now reverse 9

8,6,7,9,10

7,6,8,9,10

6,7,8,9,10

At this point 6 is ahead so no more reversing can be done so stop.

To implement above algorithm which datastructure is better and why ?

View solution

Q. Free lists are used in

View solution

Q. What are implicit and explicit implementations of freelists?

View solution

Q. What datastructures can be used in implementing a free list?

View solution

Q. What are different ways of implementing free lists and which is simple among them?

View solution

Q. What is buddy memory management of free lists ?

View solution

Q. How does implicit free lists(garbage collection) works in adding memory to free list ?

View solution

Q. What are the disadvantages in implementing buddy system algorithm for free lists ?

View solution

Q. How are free blocks linked together mostly and in what addressing order?

View solution

Q. Accessing free list very frequently for wide range of addresses can lead to

View solution