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!
Q. Explain about diffrent Process State?
Process State
1. New
2. Ready
3. Running
4. Waiting
5. Terminated (exist)
1. New: A process that has just been created.
2. Ready: Ready processes are waiting to have processor allocated to them by the operating system so that they can run.
3. Running: Process which is currently being executed. A running process possesses all resources required for its execution comprising the processor.
4. Waiting: A process which can't execute till some event takes place like the completion of an I/O operation. The running process can become suspended by invoking an I/O module.
5. Terminated: A process that has been released from the pool of executable processes by operating system.
Diagram for Process State
Two Level Directory This kind of structure overcomes the problems of assigning unique names to the files. Thus there need not be any confusion among users. In this kind of s
Software for business management integrated into a social network Project Description: We are seeking top professionals to build software with us that manages the business.
As mentioned above, page tables, are lookup tables mapping a process' virtual pages to physical pages in RAM. How would one implement these page tables? The most straightforward
How is memory management done using bit maps? A bit map is here in this we signify the bit value as 0 or 1. 1-hole 0-process In this we are able to represent the proce
server configure
Define ‘LRU’ page replacement policy LRU is Least Recently Used page replacement policy.
Question 1: (a) Discuss about the evolution of operating systems from mainframe batch systems to mainframe time sharing systems. (b) Explain your understanding of the "sus
Question: In a deadlock, processes never finish executing and system resources are tied up, preventing other jobs from starting. Deadlocks can be characterised by a set of cond
what is deckers algorithm
Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best
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