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!
Explain the general structure of a typical process?
There are basically four main sections through which each of the process has to pass through.The universal algorithm is:-
Critical section:-
Consider a system consist of n processes P0 to Pn every process has a segment of code, called as critical section, in which the process perhaps changing common variables updating a table, writing a file and so on. Therefore critical section is that area of code in which the processors try to access the shared information. Therefore critical section occurs in the area where race condition occurs.
Entry section:-
Code just previous to the critical section is termed as the entry section. Every processor must request permission to enter into the critical section, the area of code which execute this request is called as the entry section.
Exit section:-
The code segment just subsequent to the critical section is termed as exit section.
Remainder section:-
The code remaining subsequent to the exit section is remainder section.
Explain the Exit (status) Function Exit function causes the calling process to be terminated. Actually, all file descriptors are immediately closed but the process is not
Problem 1: (a) What are the likely benefits which an organisation may derive from the planning process? (b) Explain the main reasons why an organisation may fail to plan.
Q. Explain about Spooling? Acronym for simultaneous peripheral operations on line. Spooling denotes to putting jobs in a buffer, a special area in memory or on a disk where
What is dispatch latency? The time taken by the dispatcher to stop one process and begin another running is known as dispatch latency.
Give an overview of UNIX based file systems. UNIX and UNIX-like operating systems allocate a device name to each device, other than this isn't how the files on that device are
shell script that accepts two directory names as arguments and delete those file in the second directory that are identical to the file in the first
A- Consider a computer system that provides a virtual memory space that consists of 8 pages. The physical memory contains 4 pages where the page size is 4Kbytes. Assume that at sp
how are you
Q. An operating system sustains a paged virtual memory using a central processor with a cycle time of 1 microsecond. It costs an additional one microsecond to access a page other
What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling
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