Access time in hard-disk - Consider a disk holding files with an average file length of 5 KB. Each file is allocated contiguously on adjacent sectors. To better utilize the disk space, it must be periodically compacted, which involves reading each file sequentially and writing it back to a new location. Assuming the standard sector size of 512, an average seek time of 50 ms, 100 sectors per tra...

File space - Consider a disk holding files with an average file length of 5 KB. Each file is allocated contiguously on adjacent sectors. To better utilize the disk space, it must be periodically compacted, which involves reading each file sequentially and writing it back to a new location. Assuming the standard sector size of 512, an average seek time of 50 ms, 100 sectors per track, and a rota...

checksum - Suppose that the information content of a packet is the bit pattern 1111000010100101 and an even parity is being used a. What would be the checksum field in a single parity bit scheme? b. What would be the value of the checksum field b for the case of a two-dimensional parity scheme? Your answer should be such that a minimum-length checksum is used.

Multicast applications - Name several multicast applications. Which of these applications are well-suited for the minimalist Internet multicast service model? Why? Which applications are not particularly well-suited for this service model?

Djkstra’s shortest path algorithm - Consider the following network. a) With the indicated link costs, use Djkstra’s shortest path algorithm to compute the shortest path from E to all network nodes. Show how the algorithm works by computing a table. b) Eliminate node A, and redo the problem starting from node B.