Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Question :
The file system is the most visible aspect of an operating system. It provides the mechanism for on-line storage and access to both data and programs of the operating system and to all the users of the computer system.
(a) What is a file?
(b) Many systems require and open system call and a close system call. Explain the purpose of the open and close operations.
(c) Some systems automatically open a file when it is referenced for the first time, and close the file when the job terminates. What is the advantage and disadvantage of this scheme as compared to the more traditional one, where the user has to open and close the file explicitly?
(d) Just as a file must be opened before it is used, a file system must be mounted before it can be available to processes in the system. Describe the mount procedure that is performed by the operating system.
(e) Consider a file system where a file can be deleted and its disk space reclaimed while links to that file still exists.
I. What problems may occur if a new file is created in the same storage area or with same absolute path name?
II. How can these problems be avoided?
Explain fixed partitioning. Partitioning are the simpler techniques that don't involve virtual memory. Partitioning has been used in numerous variations in operating systems.
why we say OS is a resource allocator and control program
What is low-level formatting? Before a disk can kept data, it must be required into sectors that the disk controller can read and write. This procedure is called low-level form
Another solution then would be to keep a pool of threads. Whenever a new task arrives, the system would simply get a thread from pool and set that thread to work on the given task.
What are the use of job queues, ready queues and device queues? As a process enters a system they are put in to a job queue. These queues having of all jobs in the system. The
COMPARISON OF DISK SCHEDULING ALGORITHMS Name Description Remarks (Selection according to requestor) RSS Random scheduling fo
Explain thread in details
A- In a table format, compare between Programmed I/O, Interrupt -driven I/O, and Direct Memory Access (DMA) in terms of basic idea, Advantages, disadvantages, and the operating en
explain how response time are reduced by allowing time sharing on top of multiprogramming
SSTF (Shortest Seek Time First) After a demand go to the closest request in the work queue regardless of direction Decrease total seek time compared to FCFS Disadv
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd