Can a system detect that some of its processes are starving? If
the answer is yes, explain how it
can. If the answer is no, explain how the system can deal with the
starvation problem.
The answer is "No". This is because system cannot detect the future of any process. Even though you maintain some kind of statistics of the process, it is almost impossible to know whether a process has made any progress or not. But starvation can be prevented by pre-emption or roll back. We have to maintain "roll back" for each process. This can be a costly affair. But when an process goes into deadlock or starvation we can roll back it. In case of pre-emption the process must be pre-emptive else it may go into deadlock situation.
Can a system detect that some of its processes are starving? If the answer is yes,...
9. What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem?
8. (10p) Modern virus scanners can detect viruses by their signatures. One technique used by some viruses to avoid detection is called the Swiss cheese infection. Explain this technique.
Q9. Can matter be created or destroyed? Yes, it can be created. Yes, it can be destroyed. No, matter is always conserved Q10. In a reaction, 25 grams of reactant AB breaks down into 10 grams of product A and an unknown amount of product B. Using the law of conservation of mass, how much does product B weigh? Explain how you got your answer?
page tables for large processes can easily take up a large amount of physical memory. one, proposed, solution to this problem is to use a multilevel page map table and put some portions in virtual memory. Explain how you would implement that. In your answer, please, specifically, discuss how a virtual address would be converted to a physical address.
Argument Recognition. Some of the passages below are arguments, and some are not. Answer “Yes” if the passage is an argument, and “No” if it is not an argument. 1. If the laptop won’t charge and the power strip is fine, then probably the power cord is damaged. Yes No 2. Whenever the power strip is damaged, the power cord is also damaged, because there’s something weird about this power strip, and the cords always get messed up.Yes No 3....
operation system please i need the answer now VULTUR Using FCFS (First-Come First-Served) scheduling algorithm, find the Average waiting time for the below processes Process Arrival time Service Time P2 P3 P4 TTT Anal 3(12pt) T- Pathp Can there be starvation in first come first serve based scheduling algorithm? Explain. TTT Arial v 3 (12pt) T. 5. 5. Path:p 18 How does Processor scheduling help us in achieving high throughput? Name the three types of Processor scheduling? TT T Arial...
pleasw answer as soon as possible . this is for my exam practice . please read the code and answer the question In a system, there are multiple reader processes which read from a shared file and multiple writer processes which update a shared file. The following variables are shared among all processes: int readCounter; semaphore mutex, writeLock; Reader and writer processes are given in the following C++-like pseudo programs: Reader Process // Non-Critical Section P(mutex); Writer Process // Non-Critical...
New Wealth Bank is currently redesigning its performance measurement system. Up until now it has relied heavily on monthly cost variance reports to control the costs in each bank branch, but would now like to have a more comprehensive performance measurement system that can help the bank detect problem areas before they become significant. The bank is committed to achieving a high return on investment for shareholders and believes that careful management of customer service and costs will help to...
13. How do we detect if the residuals are heteroskedastic? If they are, how can we resolve the problem?
can some one check if its right !? Determine the overall system transfer function for each of the system block diagrams below. as a test Goh yes) Gut Gute 1+1667 G.Gr 1 GG N2+ GIG,H, H(S) = echo - Go Go to G, au focess G, G2 1 +6, G, H ₂ G, GH, (5) TAGE G. G2 1 + G&H₂ + G, G, H, SA H(s) = S(S-1+k) -506446) It K(+2) (5-1+K) SOS-I+) +k(+2) SCH) S(5-1+k) + K (5+2)...