Question 11 : 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
1. i, ii, iii, iv
2. i, ii, iii
3. i, ii
4. i
View Answer   Discuss with Members

Question 12 : Which of the following method performs poorly when elements are accessed in sequential order?
1. count method
2. move to front method
3. transpose meth
4. ordering method
View Answer   Discuss with Members

Question 13 : How to maintain multi-level skip list properties when insertions and deletions are done?
1. design each level of a multi-level skip list with varied probabilities
2. that cannot be maintained
3. rebalancing of lists
4. reconstruction
View Answer   Discuss with Members

Question 14 : Free lists are used in
1. static memory allocation
2. dynamic memory allocation
3. contagious allocations
4. are used for speeding up linked list operations
View Answer   Discuss with Members

Question 15 : How does implicit free lists(garbage collection) works in adding memory to free list ?
1. whichever comes last will be added to free list
2. whichever comes first will be added to free list
3. certain blocks cannot be used if there are no pointers to them and hence they can be freed
4. makes a probabilistic guess
View Answer   Discuss with Members

Question 16 : What technique is used in Transpose method?
1. searched node is swapped with its predecessor
2. node with highest access count is moved to head of the list
3. searched node is swapped with the head of list
4. searched nodes are rearranged based on their proximity to the head node
View Answer   Discuss with Members

Question 17 : The worst case running time of a linear search on the self organizing list is ____
1. O(1)
2. O(logn)
3. O(n)
4. O(n²)
View Answer   Discuss with Members

Question 18 : Which of the following data structure is preferred to have lesser search time when the list size is small?
1. search tree
2. sorted list
3. self organizing list
4. linked list
View Answer   Discuss with Members

Question 19 : What is buddy memory management of free lists ?
1. modified version of first fit
2. buddy allocation keeps several‭ ‬free lists,‭ ‬each one holds blocks which are of one particular size
3. modified version of best fit
4. a tree representation of free lists
View Answer   Discuss with Members

Question 20 : What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
1. O(n) to O(logn) where n is number of elements
2. O(n) to O(1) where n is number of elements
3. no change
4. O(n) to O(n²) where n is number of elements
View Answer   Discuss with Members