Java Reference
In-Depth Information
• add two matrices, and
• multiply two matrices.
12.2 Implement the Yale model for sparse matrices described at the end of Sec-
tion 12.2. Your implementation should support the following operations on
the matrix:
• insert an element at a given position,
• delete an element from a given position,
• return the value of the element at a given position,
• take the transpose of a matrix,
• add two matrices, and
• multiply two matrices.
12.3 Implement the MemManager ADT shown at the beginning of Section 12.3.
Use a separate linked list to implement the freelist. Your implementation
should work for any of the three sequential-fit methods: first fit, best fit, and
worst fit. Test your system empirically to determine under what conditions
each method performs well.
12.4 Implement the MemManager ADT shown at the beginning of Section 12.3.
Do not use separate memory for the free list, but instead embed the free list
into the memory pool as shown in Figure 12.12. Your implementation should
work for any of the three sequential-fit methods: first fit, best fit, and worst
fit. Test your system empirically to determine under what conditions each
method performs well.
12.5 Implement the MemManager ADT shown at the beginning of Section 12.3
using the buddy method of Section 12.3.1. Your system should support
requests for blocks of a specified size and release of previously requested
blocks.
12.6 Implement the Deutsch-Schorr-Waite garbage collection algorithm that is il-
lustrated by Figure 12.18.
Search WWH ::




Custom Search