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.
Consider the following C program where M, N, K are predefined constants. Assume int is 4 bytes. Suppose this program is run on a machine with 4KB page size and 32 TLB entries. Init
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
Q. What is the effect of permitting two entries in a page table to point to the same page frame in memory? Describe how this effect could be used to decrease the amount of time ne
Write a note on multithreading. Multithreading is the capability of an operating system to execute different parts of a program called as threads, at the same time. The program
draw a state diagram showing the transissions of a process from creation to termination
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
What are the methods for handling deadlocks? The deadlock problem can be dealt with in one of the three ways: a. Use a protocol to prevent or avoid deadlocks, ensuring that
what are conditions
What is single and multithreading and thread pool?
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
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