[Solved] Which of the following is not the rearranging method used to implement self-organizing lists?

Which of the following is not the rearranging method used to implement self-organizing lists? a) count methodb) move to front methodc) ordering methodd) least frequently used Answer: dExplanation: Least frequently used is a buffer replacement policy, while the other three are methods to reorder the nodes in the self-organizing lists based on their access probability.

[Solved] The self organizing list improves _____

The self organizing list improves _____ a) average access timeb) insertionc) deletiond) binary search Answer: aExplanation: The self-organizing list rearranges the nodes based on the access probabilities of the nodes. So the required elements can be located efficiently. Therefore, self-organizing list is mainly used to improve the average access time.

[Solved] Which of the following method performs poorly when elements are accessed in sequential order?

Which of the following method performs poorly when elements are accessed in sequential order? a) count methodb) move to front methodc) transpose methd) ordering method Answer: bExplanation: Move-to-front method performs poorly when the elements are accessed in sequential order, especially if that sequential order is then repeated multiple times.

[Solved] Symbol tables during compilation of program is efficiently implemented using __________

Symbol tables during compilation of program is efficiently implemented using __________ a) a singly linked listb) a doubly linked listc) a self organizing listd) an array Answer: cExplanation: Self organizing list allows fast sequential search and it is simple to implement and requires no extra storage. Self-organizing list is used to implement the symbol table.

[Solved] Which of the following data structure is preferred to have lesser search time when the list size is small?

Which of the following data structure is preferred to have lesser search time when the list size is small? a) search treeb) sorted listc) self organizing listd) linked list Answer: cExplanation: Self-organizing list is easy and simple to implement than a search tree and it requires no additional space. So using self organizing list is …

Read more

[Solved] The worst case running time of a linear search on the self organizing list is ____

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: cExplanation: Worst case occurs when the element is located at the very end of the list. So n comparisons must be made to the locate element. So the worst-case running time of linear …

Read more

[Solved] What technique is used in the Transpose method?

What technique is used in the Transpose method? a) searched node is swapped with its predecessorb) node with highest access count is moved to head of the listc) searched node is swapped with the head of the listd) searched nodes are rearranged based on their proximity to the head node Answer: aExplanation: In the Transpose …

Read more

[Solved] Which of the following is true about the Move-To-Front Method for rearranging nodes?

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 listb) requires extra storagec) may over-reward infrequently accessed nodesd) requires a counter for each node Answer: cExplanation: In Move-To-front Method the element which is searched is moved to the head …

Read more

[Solved] The self organizing list improves the efficiency of _______

The self organizing list improves the efficiency of _______ a) binary searchb) jump searchc) sublist searchd) linear search Answer: dExplanation: Linear search in a linked list has time complexity O(n). To improve the efficiency of the linear search the self organizing list is used. A self-organizing list improves the efficiency of linear search by moving …

Read more