Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
q in the ibm370 memory protection is offered through the use of keys a key is a 4-bit quantity every 2k block of memory has a key the storage key
sharing segments between processes without requiring the same segment number is possible in a dynamically linked segmentation system a define a
q explain a mechanism by which one segment could belong to the address space of two different processesanswer because segment tables are a collection
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
q regard as a logical address space of eight pages of 1024 words every mapped onto a physical memory of 32 framesa how several bits are there in the
q why page sizes always powers of 2answer recall that paging is executed by breaking up an address into a page and offset number it is most competent
q consider a system in which a program is able to be separated into two parts code and data the cpu recognizes whether it wants an instruction
q name two differences between logical and physical addressesanswer a logical address doesnt refer to an actual existing address rather it refers to
is it probable to have a deadlock involving only one single process describe your answeranswer no this pursue directly from the hold-and-wait
q presume that you have coded the deadlock-avoidance safety algorithm as well as now have been asked to implement the deadlock-detection algorithm
consider the subsequent resource-allocation policy requests as well as releases for resources are allowed at any time if a request for resources cant
q can a system detect that some of its processes are starving if you answer yes explain how it can if you answer no explain how the system can deal
regard as a computer system that runs 5000 jobs per month with no deadlock-prevention or deadlock-avoidance scheme deadlocks take place about twice
q explain about deadlocksdeadlocksfor int i 0 i lt n i first find a thread that can finishfor int j 0 j lt n j if finishj boolean temp truefor
q presume that a system is in an unsafe state illustrate that it is possible for the processes to complete their execution without entering a
q list three instances of deadlocks that arent related to a computer system environmentanswer two cars passage a single-lane bridge from opposite
q the wait statement in every java program examples was part of a while loop describe why you would always need to use a while statement when using
q describe the concept of transaction atomicityanswer a transaction is a sequence of read as well as writes operations upon some data followed by a
describe the purpose of the checkpoint mechanism how habitually must checkpoints be performed explain how the frequency of checkpoints affects system
q explain the differences in terms of cost between the three storage types nonvolatile volatile and stableanswer volatile storage refers to main as
q give the reasons why windows xp solaris and linux implement multiple locking mechanisms explain the circumstances under which they use mutexes
the cigarette-smokers difficulty consider a system with three smoker processes and one agent process every smoker continuously rolls a cigarette and
q in following section we mentioned that disabling interrupts frequently could affect the systems clock describe why it could and how such effects
q suppose an operating system maps user-level threads to the kernel utilizing the many-to-many model where the mapping is done through the use of
q distinguish among pcs and scs schedulinganswer pcs scheduling is completed local to the process it is how a thread library schedules threads onto