Question
FIFO, LRU, and CLOCK are three page substitution calculations. (a) Briefly portray the activity of every calculation. [6 marks] (b) The CLOCK procedure expects some
FIFO, LRU, and CLOCK are three page substitution calculations. (a) Briefly portray the activity of every calculation. [6 marks] (b) The CLOCK procedure expects some equipment support. What might you at some point do to permit the utilization of CLOCK on the off chance that this equipment support were absent? [2 marks] (c) Assuming great worldly region of reference, which of the over three calculations could you decide to use inside a working framework? How could you not utilize different plans? [2 marks] What is a cushion reserve? Make sense of why one is utilized, and the way in which it works. [6 marks] Which support reserve substitution procedure would you decide to use inside an working framework? Legitimize your response. [2 marks] Give two motivations behind why the it are different to support necessities for network information from those for document frameworks. [2 marks]
Tell the best way to encode an overall register machine program and the underlying arrangement of one of its calculations into a couple of normal numbers. [6 marks] Frame the plan of a register machine that mimics an overall register machine calculation indicated by a solitary normal number. Your machine ought to take suitable activity for every single imaginable info.
(a) Describe the distinctions in intricacy and use among stinginess and distance phylogenetic strategies. Give an illustration of the use of the two techniques. [6 marks] (b) Describe the distinctions in intricacy and utilization between various leveled grouping furthermore, the Markov grouping (MCL) calculation. [5 marks] (c) Explain how to distinguish different quality elements utilizing Hidden Markov Model techniques like Genescan. [5 marks] (d) Explain how you could recognize an administrative organization including a bunch of qualities. [4 imprint
(a) State the Fermat-Euler hypothesis, cautiously characterizing any terms that you use. Conclude that 2p ? 2 (mod p) for any superb p. [5 marks] (b) Explain how this outcome can be utilized to show that a number is composite without in reality tracking down a variable. Give a model. [3 marks] (c) Let Mm = 2m ?1 be the mth Mersenne number. Assume that m is composite. Demonstrate that Mm is composite. [3 marks] (d) A composite number m that fulfills 2m ? 2 (mod m) is known as a pseudo-prime. (I) Suppose that m is prime. Demonstrate that Mm is either prime or a pseudoprime. [3 marks] (ii) Suppose that m is a pseudo-prime. Demonstrate that Mm is a pseudo-prime. [3 marks] (iii) Deduce that there are vastly numerous pseudo-primes.
Complete the code [0.5 point for each right answer] to ensure proper synchronization between threads and avoid any deadlock. public class Section22Ex3Thread { public static void main(String[] args) { // Create an object from this class //Create an object from the Memory that a sub-object from this Class Object Memory Memory! - Resource.new Memory(); //Create an object from the Processor that a sub-object from the Class Object // Create the first Runnable thread Runnable new Runnable() { //Create the run() method synchronized............) { try { // Adding delay so that both threads can start trying to lock resources } catch (InterruptedException e) { } c.printStackTrace(); // The first thread have the Memory but need the Processor also synchronized..................) ( System.out.println("I am in the first Block."); }; // Create the second Runnable thread Runnable...new Runnable() { //Create the run() method public void run() { synchronized (....................) { // The second thread have the Memory but need the Processor also synchronized......... ...) { System.out.println("I am in the second Block.");
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Lets address the first set of questions regarding page substitution algorithms and buffer caches Page Substitution Algorithms FIFO First In First Out This algorithm replaces the oldest page in memory ...Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started