MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is indexed skip list? |
| A. | it stores width of link in place of element |
| B. | it stores index values |
| C. | array based linked list |
| D. | indexed tree |
| Answer» B. it stores index values | |
| 2. |
Is a skip list like balanced tree? |
| A. | true |
| B. | false |
| Answer» B. false | |
| 3. |
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) |
| A. | true |
| B. | false |
| Answer» B. false | |
| 4. |
Consider the 2-level skip listHow to access 38? |
| A. | travel 20-30-35-38 |
| B. | travel 20-30-40-38 |
| C. | travel 20-38 |
| D. | travel 20-40-38 |
| Answer» B. travel 20-30-40-38 | |
| 5. |
IS_A_SKIP_LIST_LIKE_BALANCED_TREE??$ |
| A. | true |
| B. | false |
| Answer» B. false | |
| 6. |
What_is_indexed_skip_list?$ |
| A. | it stores width of link in place of element |
| B. | it stores index values |
| C. | array based linked list |
| D. | indexed tree |
| Answer» B. it stores index values | |
| 7. |
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» B. that cannot be maintained | |
| 8. |
Are the below statements true about skiplists? |
| A. | |
| B. | |
| C. | |
| Answer» B. | |
| 9. |
The nodes in a skip list may have many forward references. their number is determined |
| A. | probabilistically |
| B. | randomly |
| C. | sequentially |
| D. | orthogonally |
| Answer» B. randomly | |
| 10. |
To which datastructure are skip lists similar to in terms of time complexities in worst and best cases? |
| A. | balanced binary search trees |
| B. | binary search trees |
| C. | binary trees |
| D. | linked lists |
| Answer» B. binary search trees | |
| 11. |
What is the time complexity improvement of skip lists from linked lists in insertion and deletion? |
| 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(n<sup>2</sup>) where n is number of elements |
| Answer» B. O(n) to O(1) where n is number of elements | |
| 12. |
Skip lists are similar to which of the following datastructure? |
| A. | stack |
| B. | heap |
| C. | binary search tree |
| D. | balanced binary search tree |
| Answer» E. | |
| 13. |
What is a skip list? |
| 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 |
| Answer» C. a linkedlist that allows slower search within an ordered sequence | |