To argue that if heuristic H does not know the access sequence in advance then the worse-case cost of H on an access sequence σ is C H ( σ ) = Ω ( m n ) .

Question

Want to see the full answer?

Answer 1

Question

Chapter 17, Problem 5P

(a)

Program Plan Intro

To argue that if heuristic H does not know the access sequence in advance then the worse-case cost of H on an access sequence σ is CH(σ)=Ω(mn) .

(b)

Program Plan Intro

To show that if σi accesses element x in list L using the move-to-front heuristic the ci=2.rankL(x)−1.

(c)

Program Plan Intro

To explain that equation ci=rankLi−1(x)+ti.

(d)

Program Plan Intro

To argue the transposition either increases the potential by 2 or decrease the potential by 2.

(e)

Program Plan Intro

To argue that rankLi−1(x)=|A|+|B|+1 and rankL*i−1(x)=|A|+|C|+1 .

(f)

Program Plan Intro

To show that access σi causes a change in potential of Φ(Li)=Φ(Li−1)≤2(|A|−|B|+ti) .

(g)

Program Plan Intro

To show that the amortized cost of access is bound by 4ci .

(h)

Program Plan Intro

To show the cost CMTF(σ) of access σ sequence with move-to-front is at most 4 times the cost CH(σ) of σ with any other heuristic H .

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Abstract classes & Interfaces (Ch13) 5. See the code below and solve the following. class Circle { protected double radius; // Default constructor public Circle() ( } this(1.0); // Construct circle with specified radius public Circle(double radius) { } this.radius radius; // Getter method for radius public double getRadius() { } return radius; // Setter method for radius public void setRadius(double radius) { } this.radius = radius; // Implement the findArea method defined in GeometricObject public double findArea() { } return radius* radius * Math. PI; // Implement the find Perimeter method defined in GeometricObject public double findPerimeter() { } return 2*radius*Math.PI; // Override the equals() method defined in the Object class public boolean equals(Circlel circle) { } return this.radius == circle.getRadius(); // Override the toString() method defined in the Object class public String toString() { } } return "[Circle] radius = " + radius; 5-1. Define a class name…

6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]

Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4

Answer 2

Question

Chapter 17, Problem 5P

(a)

Program Plan Intro

To argue that if heuristic H does not know the access sequence in advance then the worse-case cost of H on an access sequence σ is CH(σ)=Ω(mn) .

(b)

Program Plan Intro

To show that if σi accesses element x in list L using the move-to-front heuristic the ci=2.rankL(x)−1.

(c)

Program Plan Intro

To explain that equation ci=rankLi−1(x)+ti.

(d)

Program Plan Intro

To argue the transposition either increases the potential by 2 or decrease the potential by 2.

(e)

Program Plan Intro

To argue that rankLi−1(x)=|A|+|B|+1 and rankL*i−1(x)=|A|+|C|+1 .

(f)

Program Plan Intro

To show that access σi causes a change in potential of Φ(Li)=Φ(Li−1)≤2(|A|−|B|+ti) .

(g)

Program Plan Intro

To show that the amortized cost of access is bound by 4ci .

(h)

Program Plan Intro

To show the cost CMTF(σ) of access σ sequence with move-to-front is at most 4 times the cost CH(σ) of σ with any other heuristic H .

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 3

Question

Chapter 17, Problem 5P

(a)

Program Plan Intro

To argue that if heuristic H does not know the access sequence in advance then the worse-case cost of H on an access sequence σ is CH(σ)=Ω(mn) .

(b)

Program Plan Intro

To show that if σi accesses element x in list L using the move-to-front heuristic the ci=2.rankL(x)−1.

(c)

Program Plan Intro

To explain that equation ci=rankLi−1(x)+ti.

(d)

Program Plan Intro

To argue the transposition either increases the potential by 2 or decrease the potential by 2.

(e)

Program Plan Intro

To argue that rankLi−1(x)=|A|+|B|+1 and rankL*i−1(x)=|A|+|C|+1 .

(f)

Program Plan Intro

To show that access σi causes a change in potential of Φ(Li)=Φ(Li−1)≤2(|A|−|B|+ti) .

(g)

Program Plan Intro

To show that the amortized cost of access is bound by 4ci .

(h)

Program Plan Intro

To show the cost CMTF(σ) of access σ sequence with move-to-front is at most 4 times the cost CH(σ) of σ with any other heuristic H .

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 4

Question

Chapter 17, Problem 5P

(a)

Program Plan Intro

To argue that if heuristic H does not know the access sequence in advance then the worse-case cost of H on an access sequence σ is CH(σ)=Ω(mn) .

(b)

Program Plan Intro

To show that if σi accesses element x in list L using the move-to-front heuristic the ci=2.rankL(x)−1.

(c)

Program Plan Intro

To explain that equation ci=rankLi−1(x)+ti.

(d)

Program Plan Intro

To argue the transposition either increases the potential by 2 or decrease the potential by 2.

(e)

Program Plan Intro

To argue that rankLi−1(x)=|A|+|B|+1 and rankL*i−1(x)=|A|+|C|+1 .

(f)

Program Plan Intro

To show that access σi causes a change in potential of Φ(Li)=Φ(Li−1)≤2(|A|−|B|+ti) .

(g)

Program Plan Intro

To show that the amortized cost of access is bound by 4ci .

(h)

Program Plan Intro

To show the cost CMTF(σ) of access σ sequence with move-to-front is at most 4 times the cost CH(σ) of σ with any other heuristic H .

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 5

Chapter 17, Problem 5P

(a)

Program Plan Intro

To argue that if heuristic H does not know the access sequence in advance then the worse-case cost of H on an access sequence σ is CH(σ)=Ω(mn) .

(b)

Program Plan Intro

To show that if σi accesses element x in list L using the move-to-front heuristic the ci=2.rankL(x)−1.

(c)

Program Plan Intro

To explain that equation ci=rankLi−1(x)+ti.

(d)

Program Plan Intro

To argue the transposition either increases the potential by 2 or decrease the potential by 2.

(e)

Program Plan Intro

To argue that rankLi−1(x)=|A|+|B|+1 and rankL*i−1(x)=|A|+|C|+1 .

(f)

Program Plan Intro

To show that access σi causes a change in potential of Φ(Li)=Φ(Li−1)≤2(|A|−|B|+ti) .

(g)

Program Plan Intro

To show that the amortized cost of access is bound by 4ci .

(h)

Program Plan Intro

To show the cost CMTF(σ) of access σ sequence with move-to-front is at most 4 times the cost CH(σ) of σ with any other heuristic H .

Answer 6

Chapter 17, Problem 5P

(a)

Program Plan Intro

To argue that if heuristic H does not know the access sequence in advance then the worse-case cost of H on an access sequence σ is CH(σ)=Ω(mn) .

Answer 7

Chapter 17, Problem 5P

(a)

Program Plan Intro

To argue that if heuristic H does not know the access sequence in advance then the worse-case cost of H on an access sequence σ is CH(σ)=Ω(mn) .

Answer 8

(b)

Program Plan Intro

To show that if σi accesses element x in list L using the move-to-front heuristic the ci=2.rankL(x)−1.

Answer 9

(b)

Program Plan Intro

To show that if σi accesses element x in list L using the move-to-front heuristic the ci=2.rankL(x)−1.

Answer 10

(c)

Program Plan Intro

To explain that equation ci=rankLi−1(x)+ti.

Answer 11

(c)

Program Plan Intro

To explain that equation ci=rankLi−1(x)+ti.

Answer 12

(d)

Program Plan Intro

To argue the transposition either increases the potential by 2 or decrease the potential by 2.

Answer 13

(d)

Program Plan Intro

To argue the transposition either increases the potential by 2 or decrease the potential by 2.

Answer 14

(e)

Program Plan Intro

To argue that rankLi−1(x)=|A|+|B|+1 and rankL*i−1(x)=|A|+|C|+1 .

Answer 15

(e)

Program Plan Intro

To argue that rankLi−1(x)=|A|+|B|+1 and rankL*i−1(x)=|A|+|C|+1 .

Answer 16

(f)

Program Plan Intro

To show that access σi causes a change in potential of Φ(Li)=Φ(Li−1)≤2(|A|−|B|+ti) .

Answer 17

(f)

Program Plan Intro

To show that access σi causes a change in potential of Φ(Li)=Φ(Li−1)≤2(|A|−|B|+ti) .

Answer 18

(g)

Program Plan Intro

To show that the amortized cost of access is bound by 4ci .

Answer 19

(g)

Program Plan Intro

To show that the amortized cost of access is bound by 4ci .

Answer 20

(h)

Program Plan Intro

To show the cost CMTF(σ) of access σ sequence with move-to-front is at most 4 times the cost CH(σ) of σ with any other heuristic H .

Answer 21

(h)

Program Plan Intro

To show the cost CMTF(σ) of access σ sequence with move-to-front is at most 4 times the cost CH(σ) of σ with any other heuristic H .

Answer 22

Expert Solution & Answer

Answer 23

Expert Solution & Answer

Answer 24

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 25

Ch. 17.1 - Prob. 1E Ch. 17.1 - Prob. 2E Ch. 17.1 - Prob. 3E Ch. 17.2 - Prob. 1E Ch. 17.2 - Prob. 2E Ch. 17.2 - Prob. 3E Ch. 17.3 - Prob. 1E Ch. 17.3 - Prob. 2E Ch. 17.3 - Prob. 3E Ch. 17.3 - Prob. 4E

To argue that if heuristic H does not know the access sequence in advance then the worse-case cost of H on an access sequence σ is C H ( σ ) = Ω ( m n ) .

Solution Summary: The author argues that if heuristic H does not know the access sequence in advance, the worse-case cost of H is CH(sigma )=Omega (mn).

Concept explainers

To argue that if heuristic H does not know the access sequence in advance then the worse-case cost of H on an access sequence σ is CH(σ)=Ω(mn) .

To show that if σi accesses element x in list L using the move-to-front heuristic the ci=2.rankL(x)−1.

To explain that equation ci=rankLi−1(x)+ti.

To argue the transposition either increases the potential by 2 or decrease the potential by 2.

To argue that rankLi−1(x)=|A|+|B|+1 and rankL*i−1(x)=|A|+|C|+1 .

To show that access σi causes a change in potential of Φ(Li)=Φ(Li−1)≤2(|A|−|B|+ti) .

To show that the amortized cost of access is bound by 4ci .

To show the cost CMTF(σ) of access σ sequence with move-to-front is at most 4 times the cost CH(σ) of σ with any other heuristic H .

Want to see the full answer?

Chapter 17 Solutions