Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged disk
0
votes
1
answer
61
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 19 (Page No. 431)
Calculate the maximum data rate in bytes/sec for the disk described in the previous problem.
Calculate the maximum data rate in bytes/sec for the disk described in the previous problem.
admin
343
views
admin
asked
Oct 28, 2019
Operating System
tanenbaum
operating-system
input-output
disk
descriptive
+
–
0
votes
1
answer
62
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 18 (Page No. 431)
A disk rotates at $7200$ RPM. It has $500$ sectors of $512$ bytes around the outer cylinder. How long does it take to read a sector?
A disk rotates at $7200$ RPM. It has $500$ sectors of $512$ bytes around the outer cylinder. How long does it take to read a sector?
admin
1.5k
views
admin
asked
Oct 28, 2019
Operating System
tanenbaum
operating-system
input-output
disk
descriptive
+
–
0
votes
1
answer
63
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 17 (Page No. 431)
How much cylinder skew is needed for a $7200$-RPM disk with a track-to-track seek time of $1\: msec$? The disk has $200$ sectors of $512$ bytes each on each track.
How much cylinder skew is needed for a $7200$-RPM disk with a track-to-track seek time of $1\: msec$? The disk has $200$ sectors of $512$ bytes each on each track.
admin
2.7k
views
admin
asked
Oct 28, 2019
Operating System
tanenbaum
operating-system
input-output
disk
descriptive
+
–
0
votes
1
answer
64
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 16 (Page No. 431)
Why are output files for the printer normally spooled on disk before being printed?
Why are output files for the printer normally spooled on disk before being printed?
admin
627
views
admin
asked
Oct 28, 2019
Operating System
tanenbaum
operating-system
input-output
disk
descriptive
+
–
0
votes
1
answer
65
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 14 (Page No. 430)
In which of the four I/O software layers is each of the following done. Computing the track, sector, and head for a disk read. Writing commands to the device registers. Checking to see if the user is permitted to use the device. Converting binary integers to ASCII for printing.
In which of the four I/O software layers is each of the following done.Computing the track, sector, and head for a disk read.Writing commands to the device registers.Chec...
admin
1.6k
views
admin
asked
Oct 28, 2019
Operating System
tanenbaum
operating-system
input-output
disk
descriptive
+
–
0
votes
0
answers
66
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 48 (Page No. 336)
Implement a simulated file system that will be fully contained in a single regular file stored on the disk. This disk file will contain directories, i-nodes, free-block information, file data blocks, etc. Choose ... directories, create/delete/open files, read/write from/to a selected file, and to list directory contents.
Implement a simulated file system that will be fully contained in a single regular file stored on the disk. This disk file will contain directories, i-nodes, free-block i...
admin
307
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
0
answers
67
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 45 (Page No. 336)
Write a program that scans all directories in a $UNIX$ file system and finds and locates all i-nodes with a hard link count of two or more. For each such file, it lists together all file names that point to the file.
Write a program that scans all directories in a $UNIX$ file system and finds and locates all i-nodes with a hard link count of two or more. For each such file, it lists t...
admin
283
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
unix
descriptive
+
–
0
votes
0
answers
68
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 44 (Page No. 336)
Write a program that starts at a given directory and descends the file tree from that point recording the sizes of all the files it finds. When it is all done, it should print a histogram of the file sizes using a bin width specified as a ... sizes of $0$ to $1023$ go in one bin, $1024$ to $2047$ go in the next bin, etc.).
Write a program that starts at a given directory and descends the file tree from that point recording the sizes of all the files it finds. When it is all done, it should ...
admin
297
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
0
answers
69
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 43 (Page No. 336)
Write a program that reverses the bytes of a file, so that the last byte is now first and the first byte is now last. It must work with an arbitrarily long file, but try to make it reasonably efficient.
Write a program that reverses the bytes of a file, so that the last byte is now first and the first byte is now last. It must work with an arbitrarily long file, but try ...
admin
276
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
1
votes
0
answers
70
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 42 (Page No. 336)
In many UNIX systems, the i-nodes are kept at the start of the disk. An alternative design is to allocate an i-node when a file is created and put the i-node at the start of the first block of the file. Discuss the pros and cons of this alternative.
In many UNIX systems, the i-nodes are kept at the start of the disk. An alternative design is to allocate an i-node when a file is created and put the i-node at the start...
admin
444
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
1
answer
71
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 41 (Page No. 336)
How many disk operations are needed to fetch the i-node for a file with the path name /usr/ast/courses/os/handout.t? Assume that the i-node for the root directory is in memory, but nothing else along the path is in memory. Also assume that all directories fit in one disk block.
How many disk operations are needed to fetch the i-node for a file with the path name /usr/ast/courses/os/handout.t? Assume that the i-node for the root directory is in m...
admin
1.7k
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
1
votes
0
answers
72
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 40 (Page No. 336)
A UNIX file system has $4-KB$ blocks and $4-$byte disk addresses. What is the maximum file size if i-nodes contain $10$ direct entries, and one single, double, and triple indirect entry each?
A UNIX file system has $4-KB$ blocks and $4-$byte disk addresses. What is the maximum file size if i-nodes contain $10$ direct entries, and one single, double, and triple...
admin
256
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
1
votes
3
answers
73
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 38 (Page No. 336)
Given a disk-block size of $4\: KB$ and block-pointer address value of $4$ bytes, what is the largest file size (in bytes) that can be accessed using $10$ direct addresses and one indirect block?
Given a disk-block size of $4\: KB$ and block-pointer address value of $4$ bytes, what is the largest file size (in bytes) that can be accessed using $10$ direct addresse...
admin
2.0k
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
1
answer
74
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 37 (Page No. 335)
A certain file system uses $4-KB$ disk blocks. The median file size is $1 KB.$ If all files were exactly $1 KB,$ what fraction of the disk space would be wasted? Do you think the wastage for a real file system will be higher than this number or lower than it? Explain your answer.
A certain file system uses $4-KB$ disk blocks. The median file size is $1 KB.$ If all files were exactly $1 KB,$ what fraction of the disk space would be wasted? Do you t...
admin
1.2k
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
1
answer
75
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 36 (Page No. 335)
Consider the idea behind Fig. $4-21,$ but now for a disk with a mean seek time of $6\: msec,$ a rotational rate of $15,000\: rpm,$ and $1,048,576$ bytes per track. What are the data rates for block sizes of $1\: KB, 2\: KB,$ and $4\: KB,$ respectively?
Consider the idea behind Fig. $4-21,$ but now for a disk with a mean seek time of $6\: msec,$ a rotational rate of $15,000\: rpm,$ and $1,048,576$ bytes per track. What a...
admin
999
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
0
answers
76
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 19 (Page No. 334)
It has been suggested that efficiency could be improved and disk space saved by storing the data of a short file within the i-node. For the i-node of Fig. $4-13,$ how many bytes of data could be stored inside the i-node?
It has been suggested that efficiency could be improved and disk space saved by storing the data of a short file within the i-node. For the i-node of Fig. $4-13,$ how man...
admin
309
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
0
answers
77
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 16 (Page No. 334)
Consider the $i\text{-node}$ shown in Fig. $4-13.$ If it contains $10$ direct addresses and these were $8$ bytes each and all disk blocks were $1024\: KB,$ what would the largest possible file be?
Consider the $i\text{-node}$ shown in Fig. $4-13.$ If it contains $10$ direct addresses and these were $8$ bytes each and all disk blocks were $1024\: KB,$ what would the...
admin
274
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
disk
i-node
descriptive
+
–
0
votes
0
answers
78
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 14 (Page No. 333)
In light of the answer to the previous question, does compacting the disk ever make any sense?
In light of the answer to the previous question, does compacting the disk ever make any sense?
admin
179
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
0
answers
79
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 11 (Page No. 333)
Contiguous allocation of files leads to disk fragmentation, as mentioned in the text, because some space in the last disk block will be wasted in files whose length is not an integral number of blocks. Is this internal fragmentation or external fragmentation? Make an analogy with something discussed in the previous chapter.
Contiguous allocation of files leads to disk fragmentation, as mentioned in the text, because some space in the last disk block will be wasted in files whose length is no...
admin
290
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
fragmentation
disk
descriptive
+
–
0
votes
1
answer
80
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 24 (Page No. 83)
Suppose that a $10$-MB file is stored on a disk on the same track (track $50$) in consecutive sectors. The disk arm is currently situated over track number $100$. How long will it take to retrieve this file from the disk? ... the file is stored to rotate under the head. Also, assume that reading occurs at a rate of $200$ MB/s.
Suppose that a $10$-MB file is stored on a disk on the same track (track $50$) in consecutive sectors. The disk arm is currently situated over track number $100$. How lon...
admin
875
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
disk
descriptive
+
–
0
votes
1
answer
81
Stallings 6e Exercise-11.12 (page no.-539) I/O Management RAID
Consider a 4-drive, 200GB-per-drive RAID array. What is the available data storage capacity for each of the RAID levels, 0, 1, 3, 4, 5, and 6?
Consider a 4-drive, 200GB-per-drive RAID array. What is the available data storage capacity for each of the RAID levels, 0, 1, 3, 4, 5, and 6?
aditi19
8.9k
views
aditi19
asked
Jun 5, 2019
Operating System
descriptive
operating-system
file-system
disk
raid
+
–
1
votes
2
answers
82
Stallings 6e Exercise-11.10 (page number-539) I/O Management
A 32-bit computer has two selector channels and one multiplexor channel. Each selector channel supports two magnetic disk and two magnetic tape units. The multiplexor channel has two line printers, two card readers, and ten VDT terminals ... reader 1.2 Kbytes/s VDT 1 Kbytes/s Estimate the maximum aggregate I/O transfer rate in this system
A 32-bit computer has two selector channels and one multiplexor channel. Each selector channel supports two magnetic disk and two magnetic tape units. The multiplexor cha...
aditi19
1.9k
views
aditi19
asked
Jun 5, 2019
Operating System
descriptive
operating-system
disk
file-system
co-and-architecture
+
–
0
votes
0
answers
83
Galvin Edition 9 Exercise 10 Question 23 (Page No. 501)
Discuss the reasons why the operating system might require accurate information on how blocks are stored on a disk. How could the operating system improve file-system performance with this knowledge ?
Discuss the reasons why the operating system might require accurate information on how blocks are stored on a disk. How could the operating system improve file-system per...
akash.dinkar12
441
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
file-system
disk
+
–
0
votes
0
answers
84
Galvin Edition 9 Exercise 10 Question 7 (Page No. 497-498)
It is sometimes said that tape is a sequential-access medium, whereas a magnetic disk is a random-access medium. In fact, the suitability of a storage device for random access depends on the transfer size. The term streaming transfer rate ... and tape. $f$. When is a tape a random-access device, and when is it a sequential-access device ?
It is sometimes said that tape is a sequential-access medium, whereas a magnetic disk is a random-access medium. In fact, the suitability of a storage device for random a...
akash.dinkar12
479
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk
descriptive
+
–
0
votes
1
answer
85
Ace Test Series: Operating System - Disks
Consider a disk with an average seek time of $4$ ms. Motor speed 15000RPM 512B sector 500 sector per track A file occupies all of the sectors on $5$ tracks Each track reading requires average seek time and average rotational delay What will be transfer time of $1$ track?
Consider a disk with an average seek time of $4$ ms.Motor speed 15000RPM512B sector500 sector per trackA file occupies all of the sectors on $5$ tracksEach track reading ...
srestha
523
views
srestha
asked
Mar 7, 2019
Operating System
ace-test-series
operating-system
disk
+
–
0
votes
0
answers
86
Testbook Test Series: Operating System - Disks
A UNIX style i-node has 15 direct pointers and one single, one double and one triple indirect pointers. The disk block size is 1KB, disk block address is 64 bits and 48 bit integers are used. What is the maximum possible fize size in bytes? Thanks!
A UNIX style i-node has 15 direct pointers and one single, one double and one triple indirect pointers. The disk block size is 1KB, disk block address is 64 bits and 48 b...
Abhipsa
295
views
Abhipsa
asked
Jan 28, 2019
Operating System
testbook-test-series
operating-system
disk
+
–
0
votes
1
answer
87
Ace Test Series: CO & Architecture - Secondary Memory
Consider a disk containing 10 equidistance tracks, the inner track capacity is 20 MB and diameter is 1 cm;
Consider a disk containing 10 equidistance tracks, the inner track capacity is 20 MB and diameter is 1 cm;
chirudeepnamini
449
views
chirudeepnamini
asked
Jan 28, 2019
CO and Architecture
co-and-architecture
ace-test-series
disk
+
–
0
votes
0
answers
88
Question from Gradeup mock test 10 Q.44
Find how much disk space (in surfaces) will be required to store 300,000 120-byte logical records, if the disk is fixed sector with 512 bytes/sector, with 96 sectors/track, 110 tracks per surface, and 8 usable surfaces. Ignore any file ... tracks = 790 track = 790/110 = 8 surfaces. How come number of records is 303150 rather than 300000? Please explain.
Find how much disk space (in surfaces) will be required to store 300,000 120-byte logical records, if the disk is fixed sector with 512 bytes/sector, with 96 sectors/trac...
Aman Janko
826
views
Aman Janko
asked
Jan 27, 2019
Operating System
operating-system
co-and-architecture
disk
+
–
0
votes
1
answer
89
made east mock 2
Harshit Bajpai
363
views
Harshit Bajpai
asked
Jan 17, 2019
CO and Architecture
co-and-architecture
disk
made-easy-test-series
numerical-answers
+
–
0
votes
2
answers
90
Ace Test Series 2019: CO & Architecture - Hard Disk
Shankar Kakde
461
views
Shankar Kakde
asked
Jan 13, 2019
CO and Architecture
ace-test-series
co-and-architecture
disk
+
–
Page:
« prev
1
2
3
4
5
6
7
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register