Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
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.
admin
asked
in
Operating System
Oct 28, 2019
by
admin
348
views
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?
admin
asked
in
Operating System
Oct 28, 2019
by
admin
1.5k
views
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.
admin
asked
in
Operating System
Oct 28, 2019
by
admin
2.7k
views
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?
admin
asked
in
Operating System
Oct 28, 2019
by
admin
604
views
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.
admin
asked
in
Operating System
Oct 28, 2019
by
admin
1.6k
views
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.
admin
asked
in
Operating System
Oct 27, 2019
by
admin
312
views
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.
admin
asked
in
Operating System
Oct 27, 2019
by
admin
289
views
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.).
admin
asked
in
Operating System
Oct 27, 2019
by
admin
302
views
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.
admin
asked
in
Operating System
Oct 27, 2019
by
admin
278
views
tanenbaum
operating-system
file-system
disk
descriptive
1
vote
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.
admin
asked
in
Operating System
Oct 27, 2019
by
admin
446
views
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.
admin
asked
in
Operating System
Oct 27, 2019
by
admin
1.7k
views
tanenbaum
operating-system
file-system
disk
descriptive
1
vote
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?
admin
asked
in
Operating System
Oct 27, 2019
by
admin
257
views
tanenbaum
operating-system
file-system
disk
descriptive
1
vote
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?
admin
asked
in
Operating System
Oct 27, 2019
by
admin
2.0k
views
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.
admin
asked
in
Operating System
Oct 27, 2019
by
admin
1.2k
views
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?
admin
asked
in
Operating System
Oct 27, 2019
by
admin
990
views
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?
admin
asked
in
Operating System
Oct 27, 2019
by
admin
313
views
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?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
277
views
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?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
183
views
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.
admin
asked
in
Operating System
Oct 26, 2019
by
admin
296
views
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.
admin
asked
in
Operating System
Oct 23, 2019
by
admin
873
views
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?
aditi19
asked
in
Operating System
Jun 5, 2019
by
aditi19
8.9k
views
descriptive
operating-system
file-system
disk
raid
1
vote
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
aditi19
asked
in
Operating System
Jun 5, 2019
by
aditi19
1.9k
views
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 ?
akash.dinkar12
asked
in
Operating System
Mar 22, 2019
by
akash.dinkar12
446
views
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 ?
akash.dinkar12
asked
in
Operating System
Mar 22, 2019
by
akash.dinkar12
480
views
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?
srestha
asked
in
Operating System
Mar 7, 2019
by
srestha
567
views
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!
Abhipsa
asked
in
Operating System
Jan 28, 2019
by
Abhipsa
303
views
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;
chirudeepnamini
asked
in
CO and Architecture
Jan 28, 2019
by
chirudeepnamini
466
views
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.
Aman Janko
asked
in
Operating System
Jan 27, 2019
by
Aman Janko
829
views
operating-system
co-and-architecture
disk
0
votes
1
answer
89
made east mock 2
Harshit Bajpai
asked
in
CO and Architecture
Jan 17, 2019
by
Harshit Bajpai
382
views
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
asked
in
CO and Architecture
Jan 13, 2019
by
Shankar Kakde
480
views
ace-test-series
co-and-architecture
disk
Page:
« prev
1
2
3
4
5
6
7
8
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged disk
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...