Consider a system where free space is kept in a free-space list. a. Suppose that the pointer to the free-space list is lost. Can the system reconstruct the free-space list? Explain your answer. b. Consider a file system similar to the one used by UNIX with indexed allocation. How many disk 1/0 operations might be required to read the contents of a small local file at /a/b/c? Assume that none of the disk blocks is currently being cached. c. Suggest a scheme to ensure that the pointer is never lost as a result of memory failure.

Consider a system where free space is kept in a free-space list. a. Suppose that the pointer to the free-space list is lost. Can the system reconstruct the free-space list? Explain your answer. b. Consider a file system similar to the one used by UNIX with indexed allocation. How many disk 1/0 operations might be required to read the contents of a small local file at /a/b/c? Assume that none of the disk blocks is currently being cached. c. Suggest a scheme to ensure that the pointer is never lost as a result of memory failure.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: UNIX treats file directories in the same fashion as files; that is, both are defined by the same…

A: In Unix-based systems, files and directories are governed by permissions determining access control.…

Q: 6. Given that main memory is composed of four-page frames for public use and that a program requests…

A: Here, we are going to tell the value of all 4 page frames using FIFO, LRU and LFU.

Q: Consider the rule of transitive confinement. Suppose a process needs to execute a subprocess in such…

A: (a) Yes, capabilities could be used to implement this. The process would pass its read capability to…

Q: The following utility tool(s) may be used by us in order to investigate the File System (such as…

A: DESKOP COMMANDS DOS stands for "Disk Operating System." Dos commands are relatively simple to use,…

Q: A working C program to transfer the contents of a text file to a linked list. Also, contents should…

A: ANSWER:-

Q: file F whose data is spread over 1000 physical disk blocks on the disk. Assume the size of a logical…

A: Dear Student, The answer to your question with required explanation is given below -

Q: RCS adopts a reverse delta approach for storing multiple versions of a file. For example, assume a…

Q: 1.In the Readers-Writers problem, more than one writer can access the buffer at the same time to…

A: “Since you have posted multiple questions, we will provide the solution only to the first 3…

Q: a. Suppose that the pointer to the free-space list is lost. Can the system reconstruct the…

A: The question is multiple type question. Hence only first question has been answered. The remaining…

Q: ent and demonstrate a disk-based buffer pool class based on the LRU buffer pool replacement…

A: Implement and demonstrate a disk-based buffer pool class based on the LRU buffer pool replacement…

Q: Write a C program to Implement a system of three processes which read and write numbers to a file.…

A: Note: As per our guidelines we are supposed to answer only one question. Kindly repost other…

Q: Suppose that you have a UNIX file system where the disk block size is 4096 bytes. Disk addresses and…

Q: Write a C program mexp that multiplies a square matrix by itself a specified number of times. mexp…

A: #include <stdio.h> #include <stdlib.h> int main(int argc, char *argv[]) { if (argc != 2)…

Q: Problem 4 (dup versus dup2) Bookmark this page Where does YoHo Go? Suppose that file descriptor is…

A: Option B is the correct answer. It will write to the file1! As it is using number 5, so it'll write…

Q: please help!! PLEASE INCLUDE THE graphs of the corresponding experiments AND THE analysis +…

A: SubmissionEnsure you include the following in your submission:C Programs: copy_byte_by_byte.c and…

Q: ld can access exactly two files, one only for reading and one only for writing. (a) Could…

A: (a) Yes, capabilities could be used to implement this. The process would create two capabilities,…

Q: Consider the rule of transitive confinement. Suppose a process needs to execute a subprocess in such…

A: Answer : 1. Yes, capabilities could be used to implement this. The parent process could create two…

Q: For a 100-cylinder disk, compute the total number of head movements for the request queue provided…

A: In FCFS, the request which arrives first will we served first.

Question

Consider a system where free space is kept in a free-space list.
a. Suppose that the pointer to the free-space list is lost. Can the
system reconstruct the free-space list? Explain your answer.
b. Consider a file system similar to the one used by UNIX with
indexed allocation. How many disk 1/0 operations might be
required to read the contents of a small local file at /a/b/c? Assume
that none of the disk blocks is currently being cached.
c. Suggest a scheme to ensure that the pointer is never lost as a
result of memory failure.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Similar questions

For Heap File with a page directory, assume that a page can contain up to 100 directory entries and a page can contain 1000 records, for a file of 1,000,000 records, what is the number of pages to store these records, assuming that on average data pages are filled up 70%? With this data page utilization, what is the number of pages to store the directory, assuming that each directory page is full? Assuming both the directory and the file are stored on disk, what is the I/O cost to insert one record in worst case, and in the average case?
Consider a system where free space is kept in a free-space list. a. Suppose that the pointer to the free-space list is lost. Can the system reconstruct the free-space list? Explain your answer. b. Consider a file system similar to the one used by UNIX with indexed allocation. How many disk 1/0 operations might be required to read the contents of a small local file at /a/b/c? Assume that none of the disk blocks is currently being cached. c. Suggest a scheme to ensure that the pointer is never lost as a result of memory failure.
The following utility tool(s) may be used by us in order to investigate the File System (such as NTFS) of a partition or volume:The grouping of answer choicesDISKPART \sFSUTIL \sWMICAnything that was discussed before
Suppose we have a Unix file system with block size of 8 Kbyte and pointers with size of 4 bytes. How large a file can be represented using only single indirect pointer in inode? A. 8 Kbyte B. 2K * 8 Kbyte C. 2K * 2K * 8 Kbyte D. 2K * 2K * 2K * 8 Kbyte
Can Some one please answer I am bit confused Because I think the answer is No. Can someone explain what is the correct answer with a proper explantion.
Dynamically linked programs use up less space on the hard disk than statically linked programs do. Which of the following would you anticipate using up the most memory (RAM) while it is active? Why?
Given a directory tree of a file system, if /usr/jeff is the working directory, what is the absolute path name for the file whose relative path name is ../ast/z?
use java programming language to explain if needed, please be clear, take your time, thanks
Matlab: Suppose I had this matrix A = [3.50, 99.50, 100.34] How do I create an output file where the decimals line up like this? Each decimal is below the other decimal exactly 3.50 99.50 100.34
Turn on the Non-executable Stack Protection Operating systems used to allow executable stacks, but this has now changed: In Ubuntu OS, the binary images of programs (and shared libraries) must declare whether they require executable stacks or not, i.e., they need to mark a field in the program header. Kernel or dynamic linker uses this marking to decide whether to make the stack of this running program executable or non-executable. This marking is done automatically by the gcc, which by default makes stack non-executable. We can specifically make it nonexecutable using the "-z noexecstack" flag in the compilation. In our previous tasks, we used "-z execstack" to make stacks executable. In this task, we will make the stack non-executable. We will do this experiment in the shellcode folder. The callshellcode program puts a copy of shellcode on the stack, and then executes the code from the stack. Please recompile call shellcode.c into a32.out and a64.out, without the "-z execstack"…