Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged file-system
9
votes
1
answer
31
GATE Overflow Test Series | Mock GATE | Test 3 | Question: 65
A disk has $4$ equidistant tracks. The diameters of the innermost and outermost tracks are $1\;\text{cm}$ and $6\;\text{ cm}$ respectively. The innermost track has a storage capacity of $16\;\text{MB.}$ If the disk has ... take to read $10\;\text{MB}$ contiguous data starting from the sector $4$ of the outer-most track will be _________
A disk has $4$ equidistant tracks. The diameters of the innermost and outermost tracks are $1\;\text{cm}$ and $6\;\text{ cm}$ respectively. The innermost track has a stor...
gatecse
814
views
gatecse
asked
Jan 26, 2021
Operating System
go2025-mockgate-3
numerical-answers
operating-system
file-system
disk
+
–
10
votes
1
answer
32
GATE Overflow Test Series | Mock GATE | Test 2 | Question: 36
Assume that the time required for a single disk read or write operation (in milliseconds) is $40 + n$, where $n$ is the number of kilobytes of data read or written. A $14\;\text{kilobyte}$ file is stored in a ... already been located in the disk, the time (in milliseconds) it'll take to read it all into memory will be __________
Assume that the time required for a single disk read or write operation (in milliseconds) is $40 + n$, where $n$ is the number of kilobytes of data read or written. A $14...
gatecse
696
views
gatecse
asked
Jan 17, 2021
CO and Architecture
go2025-mockgate-2
numerical-answers
file-system
file-organization
disk
+
–
4
votes
1
answer
33
GATE Overflow Test Series | Mock GATE | Test 2 | Question: 52
Disk requests come in to the disk driver for cylinders $10, 22, 20, 2, 40, 6,\;\text{and}\; 38,$ in that order. A seek takes $6\;\text{msec}$ ... is $40$ and the initial direction is moving upwards, the total seek time (in milliseconds) needed for the elevator algorithm is _________
Disk requests come in to the disk driver for cylinders $10, 22, 20, 2, 40, 6,\;\text{and}\; 38,$ in that order. A seek takes $6\;\text{msec}$ per cylinder. If the arm is ...
gatecse
347
views
gatecse
asked
Jan 17, 2021
Operating System
go2025-mockgate-2
numerical-answers
file-system
disk-scheduling
+
–
5
votes
1
answer
34
GATE Overflow Test Series | Mock GATE | Test 1 | Question: 54
Given a disk-block size of $\text{16 KB}$ and block-pointer address value of $\text{8 bytes}$, what is the largest file size that can be accessed using $256$ direct addresses and one indirect block? $32$ MB $16$ MB $20$ MB $36$ MB
Given a disk-block size of $\text{16 KB}$ and block-pointer address value of $\text{8 bytes}$, what is the largest file size that can be accessed using $256$ direct addre...
gatecse
452
views
gatecse
asked
Jan 3, 2021
Operating System
go2025-mockgate-1
file-system
file-organization
inode
operating-system
+
–
3
votes
1
answer
35
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 2
Consider a $\text{8-TB}$ disk that uses $\text{2-KB}$ blocks and the free-list method. The number of block addresses that can be stored in one block will be _______
Consider a $\text{8-TB}$ disk that uses $\text{2-KB}$ blocks and the free-list method. The number of block addresses that can be stored in one block will be _______
gatecse
424
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
numerical-answers
file-system
file-organization
+
–
4
votes
1
answer
36
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 4
Consider a file system with $\text{512-byte}$ blocks. Assume an inode of a file holds pointers to $8$ direct data blocks, and a pointer to a single indirect block. Further, assume that the single indirect block can ... other data blocks. The maximum file size in bytes that can be supported by such an inode design will be ________
Consider a file system with $\text{512-byte}$ blocks. Assume an inode of a file holds pointers to $8$ direct data blocks, and a pointer to a single indirect block. Furthe...
gatecse
295
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
numerical-answers
file-system
file-organization
inode
+
–
2
votes
1
answer
37
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 28
Suppose that a disk drive has $5000$ cylinders numbered $0 \;\text{to}\; 4999.$ The drive is currently serving a request at cylinder $2150,$ and the previous request was at cylinder $1805.$ The queue of pending requests, ... and Circular SCAN (C-SCAN) disk-scheduling algorithms are $a$ and $b$ respectively, then $2a+5b = $ _____
Suppose that a disk drive has $5000$ cylinders numbered $0 \;\text{to}\; 4999.$ The drive is currently serving a request at cylinder $2150,$ and the previous request was ...
gatecse
288
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
numerical-answers
file-system
disk-scheduling
+
–
2
votes
1
answer
38
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 29
Suppose that a disk drive has $5000$ cylinders, numbered $0$ to $4999.$ The drive is currently serving a request at cylinder $1243,$ and previously it was at cylinder $125.$ The queue of pending requests in FIFO order is: ... Shortest Seek Time First (SSTF) are $\alpha$ and $\beta$ respectively, then $2\alpha+3\beta =$ _______
Suppose that a disk drive has $5000$ cylinders, numbered $0$ to $4999.$ The drive is currently serving a request at cylinder $1243,$ and previously it was at cylinder $12...
gatecse
270
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
numerical-answers
file-system
disk-scheduling
+
–
1
votes
6
answers
39
NIELIT 2016 MAR Scientist C - Section C: 2
The file manager is responsible for naming files saving files deleting files all of these
The file manager is responsible fornaming filessaving filesdeleting filesall of these
admin
1.8k
views
admin
asked
Apr 2, 2020
Operating System
nielit2016mar-scientistc
operating-system
file-system
+
–
1
votes
4
answers
40
NIELIT 2017 DEC Scientific Assistant A - Section B: 7
If file size is large and if it is to be accessed randomly then which of the following allocation strategy should be best to use in a system? Linked allocation Indexed allocation Contiguous allocation None of the options
If file size is large and if it is to be accessed randomly then which of the following allocation strategy should be best to use in a system?Linked allocationIndexed allo...
admin
2.2k
views
admin
asked
Mar 31, 2020
Operating System
nielit2017dec-assistanta
operating-system
file-system
+
–
1
votes
3
answers
41
NIELIT 2016 MAR Scientist B - Section C: 35
The file structure that redefines its first record at a base of zero uses the term relative organization. key fielding. dynamic reallocation. all of these.
The file structure that redefines its first record at a base of zero uses the termrelative organization.key fielding.dynamic reallocation.all of these.
admin
948
views
admin
asked
Mar 31, 2020
Operating System
nielit2016mar-scientistb
operating-system
file-system
file-organization
+
–
0
votes
0
answers
42
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
313
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
0
answers
43
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 47 (Page No. 336)
Implement a program to measure the impact of application-level buffer sizes on read time. This involves writing to and reading from a large file (say, $2$ GB). Vary the application buffer size (say, from $64$ ... results and report your findings: does buffer size make a difference to the overall write time and per-write time?
Implement a program to measure the impact of application-level buffer sizes on read time. This involves writing to and reading from a large file (say, $2$ GB). Vary the a...
admin
288
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
unix
descriptive
+
–
0
votes
0
answers
44
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 46 (Page No. 336)
Write a new version of the UNIX ls program. This version takes as an argument one or more directory names and for each directory lists all the files in that directory, one line per file. Each field should be formatted in a reasonable way given its type. List only the first disk address, if any.
Write a new version of the UNIX ls program. This version takes as an argument one or more directory names and for each directory lists all the files in that directory, on...
admin
271
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
unix
descriptive
+
–
0
votes
0
answers
45
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
290
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
unix
descriptive
+
–
0
votes
0
answers
46
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
303
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
0
answers
47
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
282
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
1
votes
0
answers
48
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
453
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
1
answer
49
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
50
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
267
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
1
answer
51
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 39 (Page No. 336)
Files in $MS-DOS$ have to compete for space in the $FAT -16$ table in memory. If one file uses $k$ entries, that is $k$ entries that are not available to any other file, what constraint does this place on the total length of all files combined?
Files in $MS-DOS$ have to compete for space in the $FAT -16$ table in memory. If one file uses $k$ entries, that is $k$ entries that are not available to any other file, ...
admin
222
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
file-allocation-table
descriptive
+
–
1
votes
3
answers
52
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
53
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
54
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
1.0k
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
2
votes
1
answer
55
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 35 (Page No. 335)
Consider a disk that has $10$ data blocks starting from block $14$ through $23.$ Let there be $2$ files on the disk$: f1$ and $f2.$ The directory structure lists that the first data blocks of $f1$ and $f2$ are ... the above notation, $(x, y)$ indicates that the value stored in table entry $x$ points to data block $y.$
Consider a disk that has $10$ data blocks starting from block $14$ through $23.$ Let there be $2$ files on the disk$: f1$ and $f2.$ The directory structure lists that the...
admin
550
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
file-allocation-table
descriptive
+
–
0
votes
0
answers
56
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 34 (Page No. 335)
Consider an application where students’ records are stored in a file. The application takes a student $ID$ as input and subsequently reads, updates, and writes the corresponding student record; this is repeated till the application quits. Would the "block read ahead" technique be useful here?
Consider an application where students’ records are stored in a file. The application takes a student $ID$ as input and subsequently reads, updates, and writes the corr...
admin
194
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
0
votes
0
answers
57
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 33 (Page No. 335)
For an external USB hard drive attached to a computer, which is more suitable: a write through cache or a block cache?
For an external USB hard drive attached to a computer, which is more suitable: a write through cache or a block cache?
admin
193
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
hard-disk
descriptive
+
–
0
votes
0
answers
58
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 32 (Page No. 335)
The performance of a file system depends upon the cache hit rate (fraction of blocks found in the cache). If it takes $1\: msec$ to satisfy a request from the cache, but $40\: msec$ to satisfy a request if a disk read is needed ... request if the hit rate is $h.$ Plot this function for values of $h$ varying from $0$ to $1.0.$
The performance of a file system depends upon the cache hit rate (fraction of blocks found in the cache). If it takes $1\: msec$ to satisfy a request from the cache, but ...
admin
332
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
cache-memory
descriptive
+
–
0
votes
0
answers
59
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 31 (Page No. 335)
Consider Fig. $4-27.$ Is it possible that for some particular block number the counters in both lists have the value $2?$ How should this problem be corrected?
Consider Fig. $4-27.$ Is it possible that for some particular block number the counters in both lists have the value $2?$ How should this problem be corrected?
admin
181
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
0
votes
0
answers
60
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 30 (Page No. 335)
It has been suggested that the first part of each UNIX file be kept in the same disk block as its i-node. What good would this do?
It has been suggested that the first part of each UNIX file be kept in the same disk block as its i-node. What good would this do?
admin
185
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
unix
descriptive
+
–
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