This List Types MCQs contains multiple choice questions and answers on skip list, self organizing list, xor linked list and free list. We have the best collection of List Types MCQs and answer with FREE PDF. These List Types MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.
List Types MCQs
1. 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: a linkedlist that allows faster search within an ordered sequence
2. Skip lists are similar to which of the following datastructure?
a) stack
b) heap
c) binary search tree
d) balanced binary search tree
Answer: balanced binary search tree
3. 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: design each level of a multi-level skip list with varied probabilities
4. Is a skip list like balanced tree?
a) true
b) false
Answer: true
5. 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: it stores width of link in place of element
6. 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(n2) where n is number of elements
Answer: O(n) to O(logn) where n is number of elements
7. 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: balanced binary search trees
50+ Skip List MCQs with FREE PDF
8. 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
a) i, ii, iii, iv
b) i, ii, iii
c) i, ii
d) i
Answer: i, ii, iii
9. What is xor linked list?
a) uses of bitwise XOR operation to decrease storage requirements for doubly linked lists
b) uses of bitwise XOR operation to decrease storage requirements for linked lists
c) uses of bitwise operations to decrease storage requirements for doubly linked lists
d) just another form of linked list
Answer: uses of bitwise XOR operation to decrease storage requirements for doubly linked lists
10. What does a xor linked list have?
a) every node stores the XOR of addresses of previous and next nodes
b) actuall memory address of next node
c) every node stores the XOR of addresses of previous and next two nodes
d) every node stores xor 0 and the current node address
Answer: every node stores the XOR of addresses of previous and next nodes
11. What does first and last nodes of a xor linked lists contain ? (let address of first and last be A and B)
a) NULL xor A and B xor NULL
b) NULL and NULL
c) A and B
d) NULL xor A and B
Answer: NULL xor A and B xor NULL
12. In the above question would using arrays and swaping of elements in place of xor linked list would have been more efficient?
a) no not all
b) yes arrays would have been better than xor lists
c) both would be same in efficiency
d) can’t say
Answer: 7
13. Which of the following is an advantage of XOR list?
a) Almost of debugging tools cannot follow the XOR chain, making debugging difficult
b) You need to remember the address of the previously accessed node in order to calculate the next node’s address
c) In some contexts XOR of pointers is not defined
d) XOR list decreases the space requirement in doubly linked list
Answer: XOR list decreases the space requirement in doubly linked list
14. Which of the following is not the properties of XOR lists?
a) X⊕X = 0
b) X⊕0 = X
c) (X⊕Y)⊕Z = X⊕(Y⊕Z)
d) X⊕0 = 1
Answer: X⊕0 = 1
50+ Self Organizing List MCQs with FREE PDF
15. What is buddy memory management of free lists ?
a) modified version of first fit
b) buddy allocation keeps several free lists, each one holds blocks which are of one particular size
c) modified version of best fit
d) a tree representation of free lists
Answer: buddy allocation keeps several free lists, each one holds blocks which are of one particular size
16. Free lists are used in
a) static memory allocation
b) dynamic memory allocation
c) contagious allocations
d) are used for speeding up linked list operations
Answer: dynamic memory allocation
17. What are implicit and explicit implementations of freelists?
a) garbage collection and new or malloc operators respectively
b) new or malloc and garbage collection respectively
c) implicit implementation is not favored
d) explicit implementation is not favored
Answer: garbage collection and new or malloc operators respectively
18. How are free blocks linked together mostly and in what addressing order?
a) circular linked list and increasing addressing order
b) linked list and decreasing addressing order
c) linked list and in no addressing order
d) none of the mentioned
Answer: circular linked list and increasing addressing order
19. Accessing free list very frequently for wide range of addresses can lead to
a) paging
b) segmentation fault
c) memory errors
d) cache problems
Answer: paging
20. What datastructures can be used in implementing a free list?
a) only linked list
b) linked list or sort trees
c) arrays
d) trees
Answer: b
21. How does implicit free lists(garbage collection) works in adding memory to free list ?
a) whichever comes last will be added to free list
b) linked list or sort trees
c) certain blocks cannot be used if there are no pointers to them and hence they can be freed
d) makes a probabilistic guess
Answer: certain blocks cannot be used if there are no pointers to them and hence they can be freed
50+ Xor Linked List MCQs with FREE PDF
22. What is buddy memory management of free lists ?
a) modified version of first fit
b) buddy allocation keeps several free lists, each one holds blocks which are of one particular size
c) modified version of best fit
d) a tree representation of free lists
Answer: buddy allocation keeps several free lists, each one holds blocks which are of one particular size
23. Free lists are used in
a) static memory allocation
b) dynamic memory allocation
c) contagious allocations
d) are used for speeding up linked list operations
Answer: dynamic memory allocation
24. What are implicit and explicit implementations of freelists?
a) garbage collection and new or malloc operators respectively
b) new or malloc and garbage collection respectively
c) implicit implementation is not favored
d) explicit implementation is not favored
Answer: garbage collection and new or malloc operators respectively
25. How are free blocks linked together mostly and in what addressing order?
a) circular linked list and increasing addressing order
b) linked list and decreasing addressing order
c) linked list and in no addressing order
d) none of the mentioned
Answer: circular linked list and increasing addressing order
26. Accessing free list very frequently for wide range of addresses can lead to
a) paging
b) segmentation fault
c) memory errors
d) cache problems
Answer: paging
27. What datastructures can be used in implementing a free list?
a) only linked list
b) linked list or sort trees
c) arrays
d) trees
Answer: linked list or sort trees
28. How does implicit free lists (garbage collection) works in adding memory to free list ?
a) whichever comes last will be added to free list
b) whichever comes first will be added to free list
c) certain blocks cannot be used if there are no pointers to them and hence they can be freed
d) makes a probabilistic guess
Answer: certain blocks cannot be used if there are no pointers to them and hence they can be freed
29. What are the disadvantages in implementing buddy system algorithm for free lists?
a) internal fragmentation
b) it takes so much space
c) we no more have the hole lists in order of memory address, so it is difficult to detect if 2 holes remain adjacent in memory and shall be merged into one hole
d) both a and c are correct
Answer: both a and c are correct
50+ Free List MCQs with FREE PDF
List Types MCQs PDF Download
1000+ Data Structure MCQs
| Abstract Data Types |
| Application of Stacks |
| Arrays Types |
| Types of Lists |
| Binary Trees |
| B-Trees |
| Trees |
| Heap |
| Trie |
| Hash Tables |
| Graph |