## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## Data Structure Questions and Answers-Skip List

Question 1 |

What is a skip list?

a linkedlist with size value in nodes | |

a linkedlist that allows faster search within an ordered sequence | |

a linkedlist that allows slower search within an ordered sequence | |

a tree which is in the form of linked list |

**Current affairs Questions answers**

Question 1 Explanation:

It is a datastructure, which can make search in sorted linked list faster in the same way as binary search tree and sorted array (using binary search) are faster.

Question 2 |

Consider the 2-level skip list

How to access 38?

travel 20-30-35-38 | |

travel 20-30-40-38 | |

travel 20-38 | |

travel 20-40-38 |

**English grammar Questions answers**

Question 2 Explanation:

Let us call the nodes 20, 30, 40 as top lines and the nodes between them as normal lines. the advantage of skip lists is we can skip all the elements between the top line elements as required.

Question 3 |

Skip lists are similar to which of the following datastructure?

stack | |

heap | |

binary search tree | |

balanced binary search tree |

**History Questions answers**

Question 3 Explanation:

As all elements lesser than the top line elements are placed infront of it and greater ones after it. please refer question for clarity. skip lists have the same asymptotic time complexities as balanced trees.

Question 4 |

What is the time complexity improvement of skip lists from linked lists in insertion and deletion?

O(n) to O(logn) where n is number of elements | |

O(n) to O(1) where n is number of elements | |

no change | |

O(n) to O(n ^{2}) where n is number of elements |

**ICT Questions answers**

Question 4 Explanation:

None.

Question 5 |

To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?

balanced binary search trees | |

binary search trees | |

binary trees | |

linked lists |

**English literature Questions answers**

Question 5 Explanation:

Skip lists are similar to any randomly built binary search tree. a BST is balanced because to avoid skew tree formations in case of sequential input and hence achieve O(logn) in all 3 cases. now skip lists can gurantee that O(logn) complexity for any input.

There are 5 questions to complete.