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
with the aid of diagrams describe the following os structures monolithic , layered, client server
Question 3: (a) Fincorp Ltd is an insurance company wishing to change over to a better business system using an improved version of a financial information system (FIS). The direc
Briefly discuss on page replacement? Page replacement approach is fixed as follows. If no frame is free, we search one that is not presently being used and free it. We can fre
Tree structured directories: This is the main common directory structure. The tree has a root directory as well as every file in the system has a unique path name. A directory
swapping technique
Explain what ISAM is. Indexed sequential access method. The file is stored in sorted order. ISAM has a master index file, indicating in what part of another index file the key
Explain Belady's Anomaly? Also called FIFO anomaly. Usually, on enhancing the number of frames allocated to a process virtual memory, the process implementation is faster, beca
KERNEL ACTIVITY FOR ULTS: The kernel isn't aware of thread activity but it is still managing process activity. When a thread compose a system call the whole process will be bl
Q) a. Given that the first three necessary conditions for a deadlock are in place, comment on the feasibility of the following strategy. All processes are given unique priorities.
Q. Dynamically loadable kernel modules give elasticity when drivers are added to a system however do they have disadvantages too? Under what situations would a kernel be compiled
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