Register

Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 30 (Page No. 335)

237 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

236
views
0 answers
0 votes
admin asked Oct 27, 2019
236 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 28 (Page No. 335)
We discussed making incremental dumps in some detail in the text. In Windows it is easy to tell when to dump a file because every file has an archive bit. This ... missing in $UNIX.$ How do $UNIX$ backup programs know which files to dump?
User Avatar
334
views
0 answers
0 votes
admin asked Oct 27, 2019
334 views
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$ ... does buffer size make a difference to the overall write time and per-write time?
User Avatar
319
views
0 answers
0 votes
admin asked Oct 27, 2019
319 views
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 ... a reasonable way given its type. List only the first disk address, if any.
User Avatar
330
views
0 answers
0 votes
admin asked Oct 27, 2019
330 views
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.
User Avatar
Link Copied!