Given the following characteristics for a magnetic tape using linear recording described in device management chapter: Density = 1600 bpi (bytes per inch) Speed = 1500 inches/second Size = 2400 feet Start/stop time = 4 ms Number of records to be stored = 200,000 records Size of each record = 160 bytes Block size = 10 logical records IBG = 0.5 inch Find the following: 17.1 Number of blocks needed. 17.2 Size of the block in bytes.

Given the following characteristics for a magnetic tape using linear recording described in device management chapter: Density = 1600 bpi (bytes per inch) Speed = 1500 inches/second Size = 2400 feet Start/stop time = 4 ms Number of records to be stored = 200,000 records Size of each record = 160 bytes Block size = 10 logical records IBG = 0.5 inch Find the following: 17.1 Number of blocks needed. 17.2 Size of the block in bytes.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 16VE

See similar textbooks

Similar questions

There are many parameters that could be used to describe disk performance; among them are: number of bits per track disk capacity (in bits) number of disk surfaces rotational speed rotational latency transfer rate tracks per surface sectors per track blocks per track sectors per block seek time speed of disk arm block-read time number of blocks Some of these parameters are independent, and others are (approximately) linearly related. That is, doubling one doubles the other. Decide which of these parameters are linearly related. Then, select from the list below, the relationship that is true, to within a close approximation. Note: none of the statements may be true exactly, but one will always be much closer to the truth than the other three. Also note: you should assume all dimensions and parameters of the disk are unchanged except for the ones mentioned. a) If you divide tracks into half as many blocks, then you double the read time for a block.…
A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure for locating the data blocks of afile.The inode stores pointers to data blocks, including a single indirect block, a double indirect block, and several direct blocks in the 64 B of available space.Now, it is given that the disk has a block size of 512 B. The maximum file size that can be stored in such a file system in MB (round off upto 2 decimal places).
Given the following bit vector named Tablet: Tablet = 1 1 1 0 1 0 1 0111100110001 i) Draw the secondary disk storage to represent the unallocated file. ii) Consider File S6 Lite with the size of 4 blocks and File iPad with the size of 5 blocks are to be allocated into the secondary storage. Draw the secondary disk storage for both files using index allocation.
One method that can be used to compress text data is run length encoding (RLE). When RLE is used the compressed data can be represented as a set of character/frequency pairs. When the same character appears in consecutive locations in the original text it is replaced in the compressed text by a single instance of the character followed by a number indicating the number of consecutive instances of that character. Single instances of a character are represented by the character followed by the number 1. Figure 9 and Figure 10 show examples of how text would be compressed using this method. Figure 9 Original text: AAARRRRGGGHH Compressed text: A 3 R 4 G 3 H 2 Figure 10 Original text: CUTLASSES Compressed text: C 1 U 1 T 1 L 1 A 1 S 2 E 1 S 1 What you need to do Task 1 Write a Python program that will perform the compression process described above. The program should display a suitable prompt asking the user to input the text to compress and then output the compressed text. Task 2 Test…
Student information is stored in a data area, and each student entry is formatted as follows:The first nine bytes are the student ID in ASCII format.The following byte is the course score.The following phrase is the section identifier. There are over 300 such student records in memory, which have been loaded consecutively beginning at address $10000. To indicate the conclusion of the records, the last record loaded is a dummy record with a section identifier of $FFFF. Create an assembler subroutine GetMax that searches the complete list for the highest mark. If there is a tie, the student with the highest score on the list should be found. The beginning address of the subroutine should be returned.
The free space bitmap looks like this: 1010 0000 0000 0000. The system always searches for free blocks starting at the lowest-numbered block. Block size is 4 KiB. (Blocks that belong to the same file do not need to be contiguous.) Write down the bitmap after each of the following actions: (a) File A of size 22 KiB is written. (b) File B of size 10 KiB is written. (c) File A is deleted. (d) File C of size 29 KiB is written. (e) File B is deleted.
In movie production the “length of the movie is directly proportional to the size” and bit rate of the movie file”. Kindly discuss how true or false this statement is in multimedia data representation. How different is a movie file from an image file in multimedia data representation.
Consider a file system that uses inodes to represent files. Disk blocks are 8 KB in size, and a pointer to a disk block requires 8 bytes. This file system has 12 direct disk blocks, as well as 1 single and 1 double indirect disk blocks. What is the maximum size of a file that can be stored in this file system in GBs (round to the nearest integer)?
HD Video C x 3ll al N X Ue G X ogle agi X Microsoft moodle.nct.edu.om/pluginfile.php/67858/mod_resource 100% 212 2. A singer voice is sampled for 4 second by an 8-bit ADC at a sampling frequency of 10 kHz. The samples are stored on a memory chip. What is the minimum memory size both in [bits and bytes] required to store all the samples? i. How long the signal must be sampled to store the samples in 100Mbytes CD- ROM iii. What should be the highest frequency component of the signal? iv.If sampling frequency is doubled then how long the signal must be sampled to store samples in 100Mbytes CD-ROM 14 Marks
Variable x has 4-byte representation 0x01234567 Address given by &x is 0x100 If the machine uses little endian byte ordering which of the following table presents variable in machine memory Select one: O a. Ox100 : 10 Ox001: 32 Ox102: 54 Ox103: 76 O b. Ox100 : 67 Ox001: 45 Ox102: 23 Ox103: 01 O c. Ox100:01 Ox001: 23 Ox102: 45 Ox103: 67 O d. Ox100 : 76 Ox001: 54 Ox102: 32 Ox103: 10
The memory location at address of 0X003FB01 contains 1-byte memory variable J (0010_0001), and the memory location at the address of 0X003FB02 contains 1-byte memory variable K (0001 0010), see figure below. There is a 2-byte variable M which hold binary information M (1110 0101 0000 1i11). What is the address in hexadecimal format for 2-byte memory variable M, following little Endian computer? 7 Address in Data in Hex. Format Hex. Format 0X003FBF04 1110 0101 M OX003FBF03 0000 1111 0X003FBF02 0001 0010 0X003FBF01 0010 0001 J Its address in hexadecimal is 0X003FBF02. а. Its address in hexadecimal is 0×003FBF03. O b. Its address in hexadecimal is 0X003FBF04. Its address in hexadecimal is 0×003FBF01. d.
Question 3: On a byte addressable machine a string COMSATS UNIVERSITY ISLAMABAD PAKISTAN, starting from logical address 0 (zero) to 36 is to be loaded into memory, in noncontiguous fashion, using 'Paging' technique. The string is divided mechanically into equal sized pages of 4 bytes; similarly the memory is also divided into equal sized frames of 4 bytes. The ASCII code of each Character occupies one byte. The free frame list is given as follows: 8,3,4,2,6,7 ,5,1,9,21,24, 11 Answer the following questions a. What is the page map table? b. What are the linear logical addresses of characters 'U' and_'B'? c. What are the linear physical addresses of characters 'U' and_'B'? d. What is the difference between Internal and External fragmentation? e. What is the internal fragmentation in loading given string?