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
prepare electricity bill without using file
Q. Benefits and Drawbacks of Batch System? Benefits of Batch System: Move much of the work of operator to computer. Increased performance as it was possible for j
Determine a component of a process precedence sequence Process name, Sequence operator ‘;’ and Concurrency operator ‘,’
Several schemes available are as follows: Pipes : One-way communication process through which different process can interact. The problem is that the two processes could have
The drawbacks of fixed partitioning are: The number of partitions are précised at system generation time limits the number of active processes in the system. For the re
What is operating system?
Explain the Real Time Operating System A real-time operating system comprises definite, fixed time constraints. Processing should be done in the defined constraints, or the sys
i need the job to be done within 3 days
Explain multilevel queue scheduling and multilevel feedback queue scheduling #Minimum 100 words accepted#
Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd