Skip List MCQ

Test your knowledge with important Skip List MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more Skip List MCQs on Bissoy. Bissoy App

• What is indexed skip list?
  ক

  it stores width of link in place of element

  খ

  it stores index values

  গ

  array based linked list

  ঘ

  indexed tree
• Is a skip list like balanced tree?
  ক

  true

  খ

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

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

  খ

  that cannot be maintained

  গ

  rebalancing of lists

  ঘ

  reconstruction
• Are the below statements true about skiplists? In a sorted set of elements skip lists can implement the below operations i.given a element find closest element to the given value in the sorted set in O(logn) ii.find the number of elements in the set whose values fall a given range in O(logn)
  ক

  true

  খ

  false
• The nodes in a skip list may have many forward references. their number is determined
  ক

  probabilistically

  খ

  randomly

  গ

  sequentially

  ঘ

  orthogonally
• 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
• 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(n2) where n is number of elements
• Skip lists are similar to which of the following datastructure?
  ক

  stack

  খ

  heap

  গ

  binary search tree

  ঘ

  balanced binary search tree
• 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
• 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