(2p) Banker's algorithm. Consider the following system state. Allocation Max Available ABCD ABCD A B C D ΤΟ 0012 0012 1520 T1 1000 1750 T2 1354 2356 T3 0632 0652 T4 0014 0656 a. Is that system safe? If so, show the order of task execution. b. If T1 requires resource allocation (0, 4, 2, 0), can it be approved immediately?

(2p) Banker's algorithm. Consider the following system state. Allocation Max Available ABCD ABCD A B C D ΤΟ 0012 0012 1520 T1 1000 1750 T2 1354 2356 T3 0632 0652 T4 0014 0656 a. Is that system safe? If so, show the order of task execution. b. If T1 requires resource allocation (0, 4, 2, 0), can it be approved immediately?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Computer Architecture Class
From a list of bid bonds, find out whether the bonds can be equally divided between 2 people with the same value a. Design your algorithm in pseudocode! (PS: use dynamic programming algorithm)b. Do an analysis for your algorithm resulting in an asymptotic notation! (PS: the bid bond value can be quite large in a trillion (10^12))c. Prove that your algorithm is correct and create your own input/output for 4 cases, and the minimum number of bid bonds for each case is 20!
Recall the rod cutting problem we discussed in class and in the book. While it might be possible for a theoretical person to cut the rod of length n, up to n times to achieve the maximum possible sale value, enterprising children do not possess the stamina to cut the rod so many times. They instead get tired or bored after only k cuts. Design a dynamic programming algorithm to maximize the value of selling cut rods if at most we can cut the rod k times. Please use elements in the table P to calculate the value of a continuous rod, e.g. an uncut rod of length i has value pi. Further you should analyze: 1. The time complexity of a baseline solution that does not use dynamic programming or memoization that exhaustively explores all potential solutions 2. The time complexity of your dynamic programming solution 3. Describe how you could change your algorithm to so to reconstruct the actual cuts in order achieve the highest value for the rod pieces.
Consider the two versions of Quicksort that are based on the following: (i) Median selection algorithm using the linear-time select method; (ii) The randomized pivot selection algorithm Which of the two algorithms has a faster worst-case asymptotic behavior? Which of the two algorithms has a faster average-case performance? Provide empirical evidence of your answer by writing the corresponding programs for each and conducting experimental evaluation. Your experimental results should provide evidence of your answer. For this you need to run an adequate number of experiments on a variety of array/list sizes (use large randomly generated lists of integers).
Dynamic Programming Problem Solve the figure below using the backward recursive equation defining its stages in order to find the optimal solution.
8. A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonablo time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate? O A Unreasonable algorithms may sometimes also be undecidable O B. Heuristics can be used to solve some problems for which no reasonable algorithm exsts O C. efficiency Two algorithms that solve the same problem must also have the same O B. Approximate solutions are often identical to optimal solutions
a) Create wait for graph from the below resource allocation graph. b) Is it possible to solve the deadlock problem by using CPU scheduling? Give valuable answer with suitable argument.
Please provide correct, detailed and complete answer.Upvote will be given for sure!Thank you!!!
Given a set of jobs {J1, ... , Jn}, each job Ji = < ti, wi > has a required processing time ti and aweight wi. Design an efficient algorithm (pseudo code) to minimize the weighted sum of overall completion times ∑ni=1wiCi, where Ci is the completion time of job i. What is the time complexityof your algorithm? Note: You first need to briefly explain your ideas to solve the problem, e.g. what data structures are used, how the intermediate results are saved, which sorting strategy is used, and why the final results are correct;
11. ) An algorithm X has two parts XA and Xg. In order to complete running algorithm X both parts have to be executed consecutively. If running time of XA is e(f(n)), and running time of Xp is O() then what should be f(n) so that algorithm X has the most efficient solution.
I need help with this question please, thank you for the help and taking your time to help me :) 2.1. Consider a state space where the start state is number 1 and each state k has two successors: numbers 2k (left child) and 2k + 1 (right child). (a) Draw the portion of the state space for states 1 to 15. (b) Suppose the goal state is 11. List the steps to follow the following algorithms: (I) BFS (II) DFS (III) UCS (Suppose the cost from parent node to left child node is 1, from parent to right child node is 2) 2.2. Implement the BFS algorithm with the data in assignment 2.1 (start 1, goal 11) in the programming language you are comfortable with. (do this one in python please)
For the event scheduling problem, create a greedy algorithm and describe it. Scheduling(s1, f1, s2, f2, ... , sn, fn) (s1, f1, s2, f2, ... , sn, fn)pre-cond: Various events make up the input.The result is a timetable that optimises the number of events that are planned.