adplus-dvertising
frame-decoration

Question

How to maintain multi-level skip list properties when insertions and deletions are done?

a.

design each level of a multi-level skip list with varied probabilities

b.

that cannot be maintained

c.

rebalancing of lists

d.

reconstruction

Answer: (a).design each level of a multi-level skip list with varied probabilities

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. How to maintain multi-level skip list properties when insertions and deletions are done?

Similar Questions

Discover Related MCQs

Q. Is a skip list like balanced tree?

Q. What is indexed skip list?

Q. What is xor linked list ?

Q. What does a xor linked list have ?

Q. What does first and last nodes of a xor linked lists contain ? (let address of first and last be A and B)

Q. Disadvantages of xor lists

Q. What are the important properties of xor lists

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

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 ?

Q. Free lists are used in

Q. What are implicit and explicit implementations of freelists?

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

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

Q. What is buddy memory management of free lists ?

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

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

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

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