Data Structure Skip List Online Exam Quiz
Data Structure Skip List GK Quiz. Question and Answers related to Data Structure Skip List. MCQ (Multiple Choice Questions with answers about Data Structure Skip List
What is a skip list?
Options
A : a linkedlist with size value in nodes
B : a linkedlist that allows faster search within an ordered sequence
C : a linkedlist that allows slower search within an ordered sequence
D : a tree which is in the form of linked list
To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
Options
A : balanced binary search trees
B : binary search trees
C : binary trees
D : linked lists
How to maintain multi-level skip list properties when insertions and deletions are done?
Options
A : design each level of a multi-level skip list with varied probabilities
B : that cannot be maintained
C : rebalancing of lists
D : reconstruction
What is indexed skip list?
Options
A : it stores width of link in place of element
B : it stores index values
C : array based linked list
D : indexed tree
What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
Options
A : O(n) to O(logn) where n is number of elements
B : O(n) to O(1) where n is number of elements
C : no change
D : O(n) to O(n2) where n is number of elements
The nodes in a skip list may have many forward references. their number is determined
Options
A : probabilistically
B : randomly
C : sequentially
D : orthogonally
Skip lists are similar to which of the following datastructure?
Options
A : stack
B : heap
C : binary search tree
D : balanced binary search tree
Is a skip list like balanced tree?
Options
A : true
B : false
C :
D :
Data Structure Adjacency List more Online Exam Quiz
Data Structure Reverse Word Stack
Data Structure Search Element Array Recursion 1
Data Structure Single Linked Lists