Operating System Problem Three file allocation techniques for storing a file on disk, namely cont...
Operating System Problem
Three file allocation techniques for storing a file on disk, namely contiguous allocation, linked allocation, and indexed allocation. For each allocation method show how a file of 10 blocks would be allocated on disk. Note that the disk is represented as 30 blocks with blocks 0, 5, 6, 15, 25 already allocated. Note you must show the entire data structure for each allocation method as part of the answer.
Thanks
Homework Answers
Add Answer to:
Operating System Problem Three file allocation techniques for storing a file on disk, namely cont...
We know that there are different disk allocation methods that help the operating system decide how...
We know that there are different disk allocation methods that help the operating system decide how disk blocks are allocated for files. In the contiguous disk allocation method, each file occupies a set of consecutive addresses on the disk. While this makes file allocation easier, an increase in the file size means that it has to be assigned elsewhere on the disk. The linked disk allocation method requires including a pointer in the current file, which points to the location...
1 Mark Question Two Consider a file system on a disk that has both logical and...
1 Mark Question Two Consider a file system on a disk that has both logical and physical block sizes of 512 tebytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these at questions: a. How is the logical-to-physical address mapping accomplished in this system? (For the indexed allocation, assume that a file is always less than 512 blocks long.) b. If we are currently at...
Consider a file system on a disk that has both logical and physical block sizes of...
Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these questions: If we are currently at logical block 5 (the last block accessed was blocked 4) and want to access logical block 15, how many physical blocks must be read from the disk?
Suppose that a file requires 20 blocks to be stored in disk. For each of the...
Suppose that a file requires 20 blocks to be stored in disk. For each of the following allocation strategies( contiguous, linked, indexed), determine the number of disk block we need to read to bring in block 7 into memory after reading the file’s directory header?
Consider a file system similar to the one used by UNIX (indexed allocation). How many disk...
Consider a file system similar to the one used by UNIX (indexed allocation). How many disk operations are required to access the contents of a file at /dir1/dir2/fle3 ? Assume that none of the disk blocks is currently being cached Total number of disk operations:
Consider a file system similar to the one used by UNIX (indexed allocation). How many disk operat...
Consider a file system similar to the one used by UNIX (indexed allocation). How many disk operations are required to access the contents of a file at dir1/dir2/file3 ? Assume that none of the disk blocks is currently being cached. Total number of disk operations:
Consider an empty 1 Gbyte disk with the block size of 4096 bytes. When the disk...
Consider an empty 1 Gbyte disk with the block size of 4096
bytes. When the disk is formatted blocks 0 is occupied for
system-related information. The system always allocated free blocks
starting st the lowest numbered block, and it uses non-contiguous
allocation.
Question 6 (2, 4) Consider an empty 1 Gbyte disk with the block size of 4096 bytes. When the disk is formatted blocks 0 is occupied for system-related information. The system always allocates free blocks starting at the...
Really don't know what its about... Course in operating system, file system Question 2. File Systems (10 marks) (a) Consider a 32GB hard disk and a FAT file system with 24 bits cluster (block) ad...
Really don't know what its about...
Course in operating system, file system
Question 2. File Systems (10 marks) (a) Consider a 32GB hard disk and a FAT file system with 24 bits cluster (block) address. What is the minimum block (cluster) size in order to fully utilize all space in the hard disk? (3 marks) (b) Consider an index-based file system with the inode containing 64 direct pointers, 1 indirect pointer, and 1 double-indirect pointer. Suppose the size of a...
Q1) A particular implementation of UNIX operating system provides the file structure modelled in the Figure...
Q1) A particular implementation of UNIX operating system provides the file structure modelled in the Figure 1. Here the i-node for the file contains certain information such as the access permissions for the file. This is followed by the entries that contain information about where the file is located on the storage device. The first 10 entries are the addresses of blocks where actual data for the file are stored. If block can contain 512 bytes of information, then these...
PROBLEM TWO Because memory compaction is time consuming, the operating system designer must be clever in deciding how to assign processes to memory (how to plug the holes). When it is time to loa...
PROBLEM TWO Because memory compaction is time consuming, the operating system designer must be clever in deciding how to assign processes to memory (how to plug the holes). When it is time to load or swap a process into main memory, and if there is more than one free block of memory of sufficient size, en the operating system must decide which free block to allocate (Don't worry... most stuffs will be discussed in chapter four of this course :))....
1 Mark Question Two Consider a file system on a disk that has both logical and physical block sizes of 512 tebytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these at questions: a. How is the logical-to-physical address mapping accomplished in this system? (For the indexed allocation, assume that a file is always less than 512 blocks long.) b. If we are currently at...
Consider a file system similar to the one used by UNIX (indexed allocation). How many disk operations are required to access the contents of a file at /dir1/dir2/fle3 ? Assume that none of the disk blocks is currently being cached Total number of disk operations:
Consider a file system similar to the one used by UNIX (indexed allocation). How many disk operations are required to access the contents of a file at dir1/dir2/file3 ? Assume that none of the disk blocks is currently being cached. Total number of disk operations:
Consider an empty 1 Gbyte disk with the block size of 4096
bytes. When the disk is formatted blocks 0 is occupied for
system-related information. The system always allocated free blocks
starting st the lowest numbered block, and it uses non-contiguous
allocation.
Question 6 (2, 4) Consider an empty 1 Gbyte disk with the block size of 4096 bytes. When the disk is formatted blocks 0 is occupied for system-related information. The system always allocates free blocks starting at the...
Really don't know what its about...
Course in operating system, file system
Question 2. File Systems (10 marks) (a) Consider a 32GB hard disk and a FAT file system with 24 bits cluster (block) address. What is the minimum block (cluster) size in order to fully utilize all space in the hard disk? (3 marks) (b) Consider an index-based file system with the inode containing 64 direct pointers, 1 indirect pointer, and 1 double-indirect pointer. Suppose the size of a...
Q1) A particular implementation of UNIX operating system provides the file structure modelled in the Figure 1. Here the i-node for the file contains certain information such as the access permissions for the file. This is followed by the entries that contain information about where the file is located on the storage device. The first 10 entries are the addresses of blocks where actual data for the file are stored. If block can contain 512 bytes of information, then these...
PROBLEM TWO Because memory compaction is time consuming, the operating system designer must be clever in deciding how to assign processes to memory (how to plug the holes). When it is time to load or swap a process into main memory, and if there is more than one free block of memory of sufficient size, en the operating system must decide which free block to allocate (Don't worry... most stuffs will be discussed in chapter four of this course :))....
Most questions answered within 3 hours.
-
Using C++ :
A Pascals triangle row is constructed by looking at the previous
row and...
asked 5 minutes ago -
With what speed will the fastest photoelectrons be emitted from
a surface whose threshold wavelength is...
asked 4 minutes ago -
The following slope distances and differences in elevations
between the tape ends were recorded for a...
asked 6 minutes ago -
1. Assuming random walk markets and normally distributed
returns, if a one day VaR on an...
asked 15 minutes ago -
(a) With a variable life insurance policy, the rate of return on
the investment (the death...
asked 26 minutes ago -
By applying what you know about Grignard reagents and the
mechanism by which benzoic acid is...
asked 49 minutes ago -
For thermoplastics, explain the effects of increasing of each of
the following properties on a polymer’s...
asked 50 minutes ago -
Make a menu for the user to use in python 3 that can search and
replace...
asked 41 minutes ago -
1) An aqueous solution contains 0.280 M
NaHS and 0.128 M
H2S.
The pH of this...
asked 56 minutes ago -
Situational Leadership
is based on interplay of all of the following except:
The amount of guidance...
asked 57 minutes ago -
Consider the following problem: given n positive integers,
separate them into two groups such that adding...
asked 1 hour ago -
Briefly discuss the following statements:
2.1 A partner never has the right to claim compensation for...
asked 1 hour ago