Self Organizing List Multiple choice Questions and Answers (MCQs)

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<

Self Organizing List Multiple choice Questions and Answers (MCQs)

Click on any option to know the CORRECT ANSWERS

Question 6
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
Journalism Questions answers


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
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
Puzzles Questions answers


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
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
Arab culture Questions answers


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
The self organizing list improves .....
A
average access time
B
insertion
C
deletion
D
binary search
NTA NET Questions answers


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
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
Reading comprehension Questions answers


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.

There are 10 questions to complete.

 

 Download all FREE PDF Ebook >>>CLICK HERE<<<