50+ Self Organizing List MCQs with FREE PDF

We have the best collection of Self Organizing List MCQs and answer with FREE PDF. These Self Organizing List 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.

Self Organizing List MCQs

1. Which of the following data structure is preferred to have lesser search time when the list size is small?

a) search tree

b) sorted list

c) self organizing list

d) linked list

Answer: self organizing list

2. In _____________ method, whenever a node is accessed, it might move to the head of the list if its number of accesses becomes greater than the records preceding it.

a) least recently used

b) count

c) traspose

d) exchange

Answer: count

3. The worst case running time of a linear search on the self organizing list is ____

a) O(1)

b) O(logn)

c) O(n)

d) O(n2)

Answer: O(n)

4. The self organizing list improves the efficiency of _______

a) binary search

b) jump search

c) sublist search

d) linear search

Answer: linear search

5. Symbol tables during compilation of program is efficiently implemented using __________

a) a singly linked list

b) a doubly linked list

c) a self organizing list

d) an array

Answer: a self organizing list

6. Which of the following method performs poorly when elements are accessed in sequential order?

a) count method

b) move to front method

c) transpose meth

d) ordering method

Answer: move to front method

7. The self organizing list improves _____

a) average access time

b) insertion

c) deletion

d) binary search

Answer: average access time

8. Which of the following is not the rearranging method used to implement self-organizing lists?

a) count method

b) move to front method

c) ordering method

d) least frequently used

Answer: least frequently used

9. Which of the following is true about the Move-To-Front Method for rearranging nodes?

a) node with highest access count is moved to head of the list

b) requires extra storage

c) may over-reward infrequently accessed nodes

d) requires a counter for each node

Answer: may over-reward infrequently accessed nodes

10. What technique is used in Transpose method?

a) searched node is swapped with its predecessor

b) node with highest access count is moved to head of the list

c) searched node is swapped with the head of list

d) searched nodes are rearranged based on their proximity to the head node

Answer: searched node is swapped with its predecessor

Self Organizing List MCQs PDF Download

50+ Skip List MCQs with FREE PDF

50+ Xor Linked List MCQs with FREE PDF

50+ Free List MCQs with FREE PDF

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