If no node having a copy of a cache block, this technique is known as           

Related MCQs

• The idea of cache memory is based           
• During the execution of the instructions, a copy of the instructions is placed in the            .
• Each node of the tree has an                              , that is, the cost of the partial tour.