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!
A system contains 10 units of resource class Ru. The resource requirements of three user processes P1, P2 and P3 are as follows
P1 P2 P3
Maximum requirements 8 7 5
Current allocation 3 1 3
Balance requirements 5 6 2
New request made 1 0 0
Using Banker's algorithm, determine if the projected allocation state is safe and whether the request of P1 will be granted or not.
From the specified data: Total_alloc=[7] Total_exist=[10]
The projected allocation state is feasible as the total allocation into this does not exceed the number of resource units of Ru. Because P3 is two units short of its maximum requirement and two unallocated unit exits into the system, therefore P3 can complete. It will release the resources allocated to this, i.e., 5 resources. Here P1 can complete as the number of unallocated units of Ru exceeds the units required to satisfy its maximum requirement then P2 can be finished.
Therefore the processes can complete in the sequence P3, P1, and P2. Therefore projected allocation state is safe thus algorithm will grant the request made through P1.
MIPS - computer architecture: The MIPS ISA, so far 3 instruction formats Fixed 32-bit instruction 3-operand, load-store architecture 32 general-purpose register
Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using NAND gate with help of K-map. Ans. Realization of given expression by using NAND gates: In
Q. Explain about common addressing modes? Most of machines use a set of addressing modes. The following tree displays common addressing modes: Figure: Common Addres
Diiference between ROM and PROM. ROM: It also called Read Only Memory is a Permanent Memory. The data is permanently stored and cannot be changed in Permanent ROM. This can o
Background, Examples and Hypothesis: Now we will switch off with three logic programs. So very firstly, we will have the logic program representing a set of positive examples
What is Organizational Structure? A business organization may be structured in many dissimilar ways, depending upon the environment within which it handles. There is always
Q. Define Interrupt Processing? On completion of execution of an instruction machine checks whether there is any pending interrupt request for interrupts which are enabled. If
WAR (write after read) - Data hazards in computer architecture: WAR (write after read) - j tries to write at destination before it is read by i , hence i wrongly gets the n
Q. Limitations of execution of instructions? 1. Size of memory shown in 16 words while instruction is capable of addressing 210 =1 K words of Memory. However why 210 since 10 b
what is hashed page table?
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