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. Presume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p along with n distinct page numbers occur in it. Answer these questions for any of page replacement algorithms:
a. What is the lower bound on the numeral of page faults?
b. What is the upper bound on the numeral of page faults?
Answer:
a. n
b. p
Write a short note on disk scheduling One of the responsibities of operating system O/S is to use the hardware efficiently. Whenever a process requires I/O to or from the
What are the operations of processes? Process creation A process may create several new processes. The creating process is called as parent process, where as the new proce
Q. Illustrate Scope of Consumer behaviour ? Scope of consumer behaviour is extremely wide due to following reasons: >>Ever rising intensifying competition. >>Additional a
In a multiprogramming and time-sharing environment, several users share the system simultaneously. This situation can result in various security problems. a
Q. It is occasionally said that tape is a sequential-access medium whereas magnetic disk is a random-access medium. In fact the correctness of a storage device for random access d
What are the necessary conditions for deadlocks? 1. Mutual exclusion : Only one process at a time is able to use the resource. 2. Hold and wait : A process should be holdi
Q. The Sun Ultra SPARC processor has numerous register sets that describe the actions of a context switch if the new context is previously loaded into one of the register sets. Wha
To evade race condition, the maximum number of processes that may be at the same time inside the critical section is The maximum number of processes which may be at the same t
Consider a setting where processors are not associated with unique identifiers but the total number of processors is known and the processors are organized along a bidirectional ri
operating systems and its types together with its design issues and their examples.
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