UNIX-like operating system use two internal tables to keep track of open files – the per-process file descriptor table and the system-wide file table. Suppose on a UNIX-like operating system, process A has two files open and process B has three files open. Two files are shared between the two processes. How many entries are in the per-process table of process A, the per-process table of process B, and the system-wide tables respectively? A. 5, 5, 5 B. 2, 3, 3 C. 2, 3, 5 D. 2, 3, 1

UNIX-like operating system use two internal tables to keep track of open files – the per-process file descriptor table and the system-wide file table. Suppose on a UNIX-like operating system, process A has two files open and process B has three files open. Two files are shared between the two processes. How many entries are in the per-process table of process A, the per-process table of process B, and the system-wide tables respectively? A. 5, 5, 5 B. 2, 3, 3 C. 2, 3, 5 D. 2, 3, 1

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter13: File Input And Output

Section: Chapter Questions

Problem 9RQ

See similar textbooks

Similar questions

I want correct Answer
The open-file table is used to maintain information about files that are currently open. Should the operating system maintain a separate table for each user or maintain just one table that contains references to files that are currently being accessed by all users? If the same file is beingaccessed by two different programs or users, should there be separate entries in the open-file table? Explain
Explain how the usage of an open() call on a device file affects Unix data structures. In terms of Unix data structures, how is a read() system call for a device handled?
Consider a file system such as the one on your favorite operating system.a. What are the steps involved in the creation and deletion of files and inwriting data to a file?b. Explain how the issues of atomicity and durability are relevant to thecreation and deletion of files and to writing data to files.
56. In the multiprogramming system, a set of processes is deadlock if each process in the set is waiting for an event to occur that can be initialized only by another process in the set. Which of the following is not one of the four conditions that are necessary for deadlock to occur? a. nonpreemption b. process suspension c. partial assignment of resources d. circular wait
Write a c program called file1.c Program file1.c uses these: (a) fork() to launch another process. (b) exec() to replace the program driving this process, while supplying arguments to file2.c to complete its execution. (c) wait() to complete the execution of the child process. (d) file1.c takes two arguments x( a number less than 1) and n (number of terms to be added, 1 or more). For example: file1 0.5 5 (e) When the child process finishes, the parent prints: Parent(PID=yyy) : Done
Give a brief explanation of what it means when a file system is described as transactional or log-based.
Attributes associated with a file can be maintained in several places as discussed inthe course content:a. Within the set of open file descriptorsb. Within the system-wide file table entry for the filec. Within the ‘i-node’ (or ‘v-node’)These attributes can be associated with the actual file (e.g. the file size), or can be associatedwith an open instance of the file (e.g. whether the file is opened for reading or writing, whether thefile is opened for non-blocking I/O, etc.).What would be preferred location of the following attributes of a file and why? Discuss anytradeoffs if that attribute could be in more than one of the above.a. The owner of the file.b. The “read/write” pointer of the open file.c. Whether the file is opened for reading, writing, or both.
Read each description of each Process Scheduler on the left and match it with the appropriate name on the right. This scheduler decides which processes in memory get time on the CPU. It is executed very frequently. This scheduler handles "swapping" of processes from main memory to mass storage. For example, it may swap-out processes that are waiting for I/O to complete. This scheduler selects spooled processes to load from the mass storage device into mai memory. It attempts to find a good mix of "I/O bound" and "CPU Bound" processes to maximize resource utilization. [Choose ] [Choose ] ✓ [Choose ] Cool Scheduler Schedulers aren't real; Nothing is real Short-term Scheduler Medium-term Scheduler Spool Scheduler Bound Scheduler Frequency Scheduler Swap Scheduler Long-term Scheduler
Give the benefits of employing pointers in file organization over sequential file structure.
Is it possible to break deadlocks and terminate processes in two separate ways?
What is the primary difference between "many threads running concurrently" and "many processes operating simultaneously"? Would it be possible for you to explain your meaning in one or two sentences?