- Consider 7 memory partitions of size 470 KB, 400 KB, 600 KB, 200 KB, 500 KB, 300 KB and 250 KB. These partitions need to be allocated to 6 processes of sizes 190 KB, 491 KB, 468 KB and 210 KB, 357 KB and 587 KB in that order. Perform the allocation of processes using- First Fit Algorithm Best Fit Algorithm Worst Fit Algorithm

- Consider 7 memory partitions of size 470 KB, 400 KB, 600 KB, 200 KB, 500 KB, 300 KB and 250 KB. These partitions need to be allocated to 6 processes of sizes 190 KB, 491 KB, 468 KB and 210 KB, 357 KB and 587 KB in that order. Perform the allocation of processes using- First Fit Algorithm Best Fit Algorithm Worst Fit Algorithm

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

Let's assume that we have an array with 6 members. The members are 10H,20,77H,17H,30H,77 in sequantial order.The offset address of the array is loaded into BX register.In sequential order MOV AL,[BX+3] and NOT AL commands are executed. What is the result number in AL register? Select one: a. 29H b. E8H c. E9H d. 149 e. 9
1) Given 6 memory partitions of 230 KB, 790 KB, 120 KB, 600 KB, 335 KB and 540 KB (in order). How would the first-fit, best-fit and worst first algorithms place processes of size 210 KB, 20 KB, 195 KB, 100 KB, 200 KB and 125 KB (in order)? Indicate which-if any-requests cannot be satisfied. Comment on how efficiently each of the algorithms manages memory.
Given 6 memory partitions of 230 KB, 790 KB, 120 KB, 600 KB, 335 KB and 540 KB (in order). How would the first-fit, best-fit and worst - first algorithms place processes of size 210 KB, 20 KB, 195 KB, 100 KB, 200 KB and 125 KB (in order)? Indicate which-if any-requests cannot be satisfied. Comment on how efficiently each of the algorithms manages memory. P
Now suppose that you are given two unsorted arrays A and B, containing m and n elements respectively. You are also given a black box O(n) selection algorithm SEL that can be called on A and B separately and, in addition, a small number (say, ten) of extra memory words that can be used to store some extra data. Using SEL as a subroutine, design an O(n + m) algorithm for finding the kth smallest element in the combined set of O(m + n) elements. You may not merge the two arrays in another array and call an algorithm (either SEL or something you wrote) on this third array. This is because there is no extra memory available to build this third array.
Write a complete java program that will store the weekly sales data for a small shop that sells candles into two dimensional array of type double, the shop has five candle scents as follow: week 1 sales week 2 sales week 3 sales week 4 sales Candle Scent 1 41.41 23.33 4.09 1.20 Candle Scent 2 33.86 22.30 27.85 17.35 Candle Scent 3 8.58 7.97 0.61 28.39 Candle Scent 4 10.23 32.62 22.21 21.91 Candle Scent 5 43.16 12.57 20.33 2.40 Your program should calculate and prints the followings: Total sa for week 1 Total sales for week 2 Total sales for week 3 Total sales for week 4 Maximum sales with the week number and candle scent number was found. Minimum sales with the week number and candle scent number was found. Sample run: Total Sales of Week 1 = 137.25 Total Sales of Week 2 = 98.80 Total Sales of Week 3 = 75.09 Total Sales of Week 4 = 71.26 Maximum Sales = 43.16 found week 1 for candle scent 5 Minimum Sales = 0.61 found in week 3 for candle scent 3
Devise an efficient divide-and-conquer algorithm for the Towers of Hanoi problem when the disks are colored alternately red and blue, and we add the extra rule that no disk may be placed on any other disk of the same color.
make python implement parallel matrix multiplication by row-partitioning using theProcess object of multiprocessing module. The input matrices A and B are small3×3 matrices and each of 3 processes receives its row and matrix B from the masterprocess, multiplies its row with matrix B to form the row of product matrix C. Aworker then sends its associated row of matrixC to the master.We need to consider thefollowing for this algorithm: when a process is spawned using the Process module,it has all of the data of the parent process but the modifications it makes are notreflected in the parent process. In order to have the product matrix C shared betweenthe processes, we need to use the Manager object of the multiprocessing module anddefine C as an array to be shared from this object. Each worker process performsmultiplication and stores the result in its row entry of matrix C.
To be able to make some predictions of disk performance, it is useful to have a model of storage allocation. Suppose that the disk is viewed as a linear address space of N» 1 sectors, consisting of a run of data blocks, then a hole, then another run of data blocks, and so on. If empirical measurements show that the probability distributions for data and hole lengths are the same, with the chance of either being i sectors as 2-¹, what is the expected number of holes on the disk?
For the employee file discussed in illustrative problem 18.1, making use ofTable P18.1, answer the questions given below:Records from the employee file are to be read and, by making use of the basicpay, allowances and deductions, the total salary is to be computed for eachemployee. Assume that it takes 200 µs of CPU time to perform the computation fora single record. The updated records are to be written onto the disk.a) What is the time taken to process a sector of records?b) Having processed a sector of records, what is the time taken to process allrecords in the very next sector?c) What is the time taken to process the records, in all sectors of a track,assuming that the sectors are continuously read?d) What is the time taken to process all records in a cylinder?
There are six memory partitions of 50 kB, 100 KB, 500 KB, 200 KB, 300 KB and 600 KB in order, how would each of the first-fit, and best-fit algorithms place processes of 210 KB, 419 KB, 114 KB, and 428KB in order? Which algorithm makes the best effective use of memory?
use the Process object of the multiprocessing module to make Python implement row-partitioning for parallel matrix multiplication. Each of the three processes receives its row and matrix B from the master process and multiplies them to create the row of the output matrix C. The input matrices A and B are tiny 33 matrices. The associated row of matrixC from a worker is then sent to the master. For this algorithm, we must take the following into account: The data of the parent process is entirely present in the process when it is launched using the Process module, but any changes it makes are not reflected in the parent process.We must utilise the Manager object of the multiprocessing module and declare C as an array to be shared from this object in order to distribute the product matrix C amongst the processes. Each worker process multiplies and records the outcome in the corresponding row entry of matrix C.
There are memory partitions in order of 150 KB, 500 KB, 400 KB, 800 KB and 900 KB. Use first fit, best fit, worst fit and next fit algorithms to allocate processes of parameters 90 KB, 417 KB, 212 KB, and 820 KB. Show the pictorial representation