Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged tanenbaum
0
votes
0
answers
121
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
122
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
+
–
0
votes
0
answers
123
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 29 (Page No. 335)
Suppose that file $21$ in Fig. $4-25$ was not modified since the last dump. In what way would the four bitmaps of Fig. $4-26$ be different?
Suppose that file $21$ in Fig. $4-25$ was not modified since the last dump. In what way would the four bitmaps of Fig. $4-26$ be different?
admin
284
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
bitmaps
descriptive
+
–
0
votes
0
answers
124
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 bit is missing in $UNIX.$ How do $UNIX$ backup programs know which files to dump?
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 bit is mis...
admin
192
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
unix
descriptive
+
–
0
votes
0
answers
125
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 27 (Page No. 335)
Oliver Owl's night job at the university computing center is to change the tapes used for overnight data backups. While waiting for each tape to complete, he works on writing his thesis that proves Shakespeare's plays ... system being backed up since that is the only one they have. Is there a problem with this arrangement?
Oliver Owl’s night job at the university computing center is to change the tapes used for overnight data backups. While waiting for each tape to complete, he works on w...
admin
212
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
1
votes
0
answers
126
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 26 (Page No. 334)
What would happen if the bitmap or free list containing the information about free disk blocks was completely lost due to a crash? Is there any way to recover from this disaster, or is it bye-bye disk? Discuss your answers for $UNIX$ and the $FAT -16$ file system separately.
What would happen if the bitmap or free list containing the information about free disk blocks was completely lost due to a crash? Is there any way to recover from this d...
admin
372
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
9
votes
1
answer
127
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 25 (Page No. 334)
The beginning of a free-space bitmap looks like this after the disk partition is first formatted$:\: 1000\: 0000\: 0000\: 0000$ (the first block is used by the root directory). The system always searches for free blocks starting ... five blocks. File $A$ is deleted. File $C$ is written, using eight blocks. File $B$ is deleted.
The beginning of a free-space bitmap looks like this after the disk partition is first formatted$:\: 1000\: 0000\: 0000\: 0000$ (the first block is used by the root direc...
admin
2.8k
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
1
votes
2
answers
128
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 24 (Page No. 334)
Free disk space can be kept track of using a free list or a bitmap. Disk addresses require $D$ bits. For a disk with $B$ blocks, $F$ of which are free, state the condition under which the free list uses less space ... For $D$ having the value $16$ bits, express your answer as a percentage of the disk space that must be free.
Free disk space can be kept track of using a free list or a bitmap. Disk addresses require $D$ bits. For a disk with $B$ blocks, $F$ of which are free, state the conditio...
admin
1.1k
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
1
votes
3
answers
129
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 23 (Page No. 334)
Consider a $4-TB$ disk that uses $4-KB$ blocks and the free-list method. How many block addresses can be stored in one block?
Consider a $4-TB$ disk that uses $4-KB$ blocks and the free-list method. How many block addresses can be stored in one block?
admin
1.9k
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
0
votes
1
answer
130
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 22 (Page No. 334)
Explain how hard links and soft links differ with respective to i-node allocations.
Explain how hard links and soft links differ with respective to i-node allocations.
admin
331
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
0
votes
0
answers
131
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 21 (Page No. 334)
Name one advantage of hard links over symbolic links and one advantage of symbolic links over hard links.
Name one advantage of hard links over symbolic links and one advantage of symbolic links over hard links.
admin
162
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
0
votes
0
answers
132
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 20 (Page No. 334)
Two computer science students, Carolyn and Elinor, are having a discussion about i-nodes. Carolyn maintains that memories have gotten so large and so cheap that when a file is opened, it is simpler and faster just to fetch ... , rather than search the entire table to see if it is already there. Elinor disagrees. Who is right?
Two computer science students, Carolyn and Elinor, are having a discussion about i-nodes. Carolyn maintains that memories have gotten so large and so cheap that when a fi...
admin
260
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
0
votes
0
answers
133
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
319
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
1
answer
134
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 18 (Page No. 334)
Consider a file whose size varies between $4\: KB$ and $4\: MB$ during its lifetime. Which of the three allocation schemes (contiguous, linked and table/indexed) will be most appropriate?
Consider a file whose size varies between $4\: KB$ and $4\: MB$ during its lifetime. Which of the three allocation schemes (contiguous, linked and table/indexed) will be ...
admin
594
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
0
votes
1
answer
135
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 17 (Page No. 334)
For a given class, the student records are stored in a file. The records are randomly accessed and updated. Assume that each student’s record is of fixed size. Which of the three allocation schemes (contiguous, linked and table/indexed) will be most appropriate?
For a given class, the student records are stored in a file. The records are randomly accessed and updated. Assume that each student’s record is of fixed size. Which of...
admin
457
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
0
votes
0
answers
136
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
290
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
disk
i-node
descriptive
+
–
0
votes
0
answers
137
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 15 (Page No. 333)
Some digital consumer devices need to store data, for example as files. Name a modern device that requires file storage and for which contiguous allocation would be a fine idea.
Some digital consumer devices need to store data, for example as files. Name a modern device that requires file storage and for which contiguous allocation would be a fin...
admin
222
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
contiguous-allocation
descriptive
+
–
0
votes
0
answers
138
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
186
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
1
votes
1
answer
139
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 13 (Page No. 333)
One way to use contiguous allocation of the disk and not suffer from holes is to compact the disk every time a file is removed. Since all files are contiguous, copying a file requires a seek and rotational delay to read the file ... a new location? Using these numbers, how long would it take to compact half of a $16-GB$ disk?
One way to use contiguous allocation of the disk and not suffer from holes is to compact the disk every time a file is removed. Since all files are contiguous, copying a ...
admin
952
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
0
votes
0
answers
140
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 12 (Page No. 333)
Describe the effects of a corrupted data block for a given file for: contiguous, linked, and indexed (or table based).
Describe the effects of a corrupted data block for a given file for:contiguous,linked, andindexed (or table based).
admin
194
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
file-organization
descriptive
+
–
0
votes
0
answers
141
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
295
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
fragmentation
disk
descriptive
+
–
0
votes
1
answer
142
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 10 (Page No. 333)
Consider the directory tree of Fig. $4-8.$ If /usr/jim is the working directory, what is the absolute path name for the file whose relative path name is ../ast/x?
Consider the directory tree of Fig. $4-8.$ If /usr/jim is the working directory, what is the absolute path name for the file whose relative path name is ../ast/x?
admin
406
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
0
votes
0
answers
143
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 9 (Page No. 333)
In UNIX and Windows, random access is done by having a special system call that moves the ‘‘current position’’ pointer associated with a file to a given byte in the file. Propose an alternative way to do random access without having this system call.
In UNIX and Windows, random access is done by having a special system call that moves the ‘‘current position’’ pointer associated with a file to a given byte in t...
admin
243
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
system-call
descriptive
+
–
0
votes
0
answers
144
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 8 (Page No. 333)
A simple operating system supports only a single directory but allows it to have arbitrarily many files with arbitrarily long file names. Can something approximating a hierarchical file system be simulated? How?
A simple operating system supports only a single directory but allows it to have arbitrarily many files with arbitrarily long file names. Can something approximating a hi...
admin
305
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
0
votes
0
answers
145
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 7 (Page No. 333)
In some systems it is possible to map part of a file into memory. What restrictions must such systems impose? How is this partial mapping implemented?
In some systems it is possible to map part of a file into memory. What restrictions must such systems impose? How is this partial mapping implemented?
admin
385
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
memory
descriptive
+
–
0
votes
0
answers
146
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 6 (Page No. 333)
Some operating systems provide a system call rename to give a file a new name. Is there any difference at all between using this call to rename a file and just copying the file to a new file with the new name, followed by deleting the old one?
Some operating systems provide a system call rename to give a file a new name. Is there any difference at all between using this call to rename a file and just copying th...
admin
147
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
0
votes
0
answers
147
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 5 (Page No. 333)
Systems that support sequential files always have an operation to rewind files. Do systems that support random-access files need this, too?
Systems that support sequential files always have an operation to rewind files. Do systems that support random-access files need this, too?
admin
215
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
0
votes
1
answer
148
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 4 (Page No. 333)
Is the open system call in $UNIX$ absolutely essential? What would the consequences be of not having it?
Is the open system call in $UNIX$ absolutely essential? What would the consequences be of not having it?
admin
617
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
unix
descriptive
+
–
0
votes
0
answers
149
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 3 (Page No. 333)
In early UNIX systems, executable files (a.out files) began with a very specific magic number, not one chosen at random. These files began with a header, followed by the text and data segments. Why do you think a ... chosen for executable files, whereas other file types had a more-or-less random magic number as the first word?
In early UNIX systems, executable files (a.out files) began with a very specific magic number, not one chosen at random. These files began with a header, followed by the ...
admin
319
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
unix
descriptive
+
–
0
votes
0
answers
150
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 2 (Page No. 332)
In Windows, when a user double clicks on a file listed by Windows Explorer, a program is run and given that file as a parameter. List two different ways the operating system could know which program to run.
In Windows, when a user double clicks on a file listed by Windows Explorer, a program is run and given that file as a parameter. List two different ways the operating sys...
admin
386
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
16
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register