Self Organizing List Multiple choice Questions and Answers (MCQs)

DOWNLOAD FREE PDF <<CLICK HERE>>

Self Organizing List Multiple choice Questions and Answers (MCQs)

Congratulations - you have completed Self Organizing List Multiple choice Questions and Answers (MCQs).

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%


Your answers are highlighted below.
Question 6 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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
Question 6 Explanation: 
In the count method, the number of times a node was accessed is counted and is stored in a counter variable associated with each node. Then the nodes are arranged in descending order based on their access counts. And the node with highest access count is head of the list.

Question 7 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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
Question 7 Explanation: 
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.

Question 8 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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
Question 8 Explanation: 
Move-to-front method performs poorly when the elements are accessed in sequential order, especially if that sequential order is then repeated multiple times.

Question 9 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
The self organizing list improves .....
A
average access time
B
insertion
C
deletion
D
binary search
Question 9 Explanation: 
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.

Question 10 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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
Question 10 Explanation: 
Least frequently used is a buffer replacement policy, while other three are methods to reorder the nodes in the self-organizing lists based on their access probability.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect. Get Results
There are 10 questions to complete.

DOWNLOAD FREE PDF <<CLICK HERE>>