Consider a system with a total of 150 units of memory, allocated to three processes as shown: Process 1 2 3 Max 70 60 60 Hold 45 40 15 O Apply the banker's algorithm to determine whether it would be safe to grant each of the following requests. If yes, indicate a sequence of terminations that could be guaranteed possible. If no, show the reduction of the resulting allocation table. 1. A fourth process arrives, with a maximum memory need of 60 and an initial need of 25 units. 2. A fourth process arrives, with a maximum memory need of 60 and an initial need of 35 units.

Consider a system with a total of 150 units of memory, allocated to three processes as shown: Process 1 2 3 Max 70 60 60 Hold 45 40 15 O Apply the banker's algorithm to determine whether it would be safe to grant each of the following requests. If yes, indicate a sequence of terminations that could be guaranteed possible. If no, show the reduction of the resulting allocation table. 1. A fourth process arrives, with a maximum memory need of 60 and an initial need of 25 units. 2. A fourth process arrives, with a maximum memory need of 60 and an initial need of 35 units.

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

11 Consider a situation where 5 instances of a resource are available. That means maximum 5 processes are allowed to enter the critical section at any point in time. Please provide a solution using a counting semaphore. Write the pseudocode for each process.
There are 4 processes - P1, P2, P3, P4 and three resources A, B, C are available. The resource A has 7 instances, B has 5 instances, C has 3 instances. Use Banker's algorithm to find out whether the system is in safe state or not. i) Calculate the need matrix ii) Identify the safe sequence and update the available table. Max Allocation Need Available A A B A B C A P1 5 1 1 P2 1 P3 1 1 1 P4 2 1 2 2. B. 2. 2.
llustrate the behaviour of the Best Fit memory allocation algorithm for the following set of processes and their respective requirements on a memory block of size 128KB: a) b) 2 8 c) d) e) 35 13 Which option represents the FINAL state of your memory allocation graph? The shaded sections ) represent "Occupied Memory". Unshaded sections ) represents "Free Memory". 23 35 15 2 15 10 8 25 8 2 13 35 25 2 Process ID P1 P2 25 P3 P4 Deallocate Deallocate PS P6 Deallocate P7 30 25 30 30 30 Size of Process in KB 20 kb 15 kb 10 kb 25 kb P1 P3 8 kB 30 kb P2 15 kb 15 15 30 35 15 25 25 13 8 13 18
Question Two Allocated Mark Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process P P2 P P. P Burst Time 2. 8. 4. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5,all at time 0. a. Draw Gantt charts that illustrate the execution of these processes using the FCFS scheduling algorithms b. What is the turnaround time of each process. c. What is the waiting time of each process. Answer
Q1. Consider a memory of size 16KB. This memory is allocated in increments of 1KB and the memory is initially empty. Use the various contiguous allocation schemes (First-fit, Best-fit, and Worst-fit) for satisfying the memory allocation/deallocation requests for processes requesting the sizes shown in the table below. Process Requested size (in KB) A B C D E F G H 4.2 7.2 2.5 4.5 3 2.7 1.5 2 Allocate(P) represents an allocation request by process P for the size shown in the above table Deallocate(P) is used to indicate deallocating the memory allocated to process P B 8KB We represent this memory by [B,2,H,4]. To represent memory, in square brackets, we use P to indicate a memory segment allocated to P and we use an integer to indicate a contiguous free part of memory. For example, after the following sequence of requests: Allocate(B), Allocate(G), Allocate(H), Deallocate(G) memory will look like this: free H free 2KB 2KB 4KB I 3.6 If X is requesting 6 KB the answer will be: [B,2,H,4]…
For Heap File with a page directory, assume that a page can contain up to 100 directory entries and a page can contain 1000 records, for a file of 1,000,000 records, what is the number of pages to store these records, assuming that on average data pages are filled up 70%? With this data page utilization, what is the number of pages to store the directory, assuming that each directory page is full? Assuming both the directory and the file are stored on disk, what is the I/O cost to insert one record in worst case, and in the average case?
Assume there are 200 KB, 600 KB, 300 KB, 400 KB, and 700 KB memory partitions. These divisions are correct. Allocate processes with parameters 312 KB, 517 KB, 212 KB, and 526 KB using the first fit, best fit, and worst fit algorithms, then answer the following: Use a figure or table to represent the allocations. 2.Which of the three algorithms uses memory the most efficiently?
Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process P1 P2 Burst time 7 4 P3 5 The processes are assumed to have arrived in the order P1, P2, P3, all at time 0. a. Draw the Gantt chart and demonstrate the start and end time of each process that illustrates the execution of these processes using round robin scheduling (time quantum-4 milliseconds). b. Calculate the average waiting time and the average turnaround time of the three processes.
Is it accurate that associative entities are also regarded as weak entities? What justification or lack thereof do you have? If true, how does their "weakness" differ from that of others?
Last solution had mistakes: For these questions, assume that memory partitions can be subdivided; multiple processes may fit in a partition if there is room. For example, if we had a 30-MB partition and a 20-MB process that fits in the partition, the partition’s new size is 10 MB after placing the process in it. If a second, 8-MB process arrives, we may place it in the partition, leaving 2 MB free in the partition. (The original memory partition then contains a 10-MB and an 8-MB process.) Consider a swapping system where memory has partitions of the following sizes: 180 MB, 100 MB, 40 MB, 200 MB, 300 MB, and 150 MB (in order). For first fit, how are processes of sizes 180 MB, 30 MB, 150 MB, 80 MB, 100 MB, and 70 MB placed (in order)? Indicate which requests (if any) cannot be satisfied. Repeat question (a) for best fit. Repeat question (a) for worst fit.
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds, Process CPU Burst Time P1 P2 1 P3 P4 1 P5 7 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw four Gantt charts illustrating the (i) execution of these processes using SJF and RR (quantum = 1) scheduling. (ii) What is the waiting time of each process for each of the scheduling algorithms in part (i)? %3D
a. Three processes share four resource units that can be reserved and released only one at a time. Each process needs a maximum of two units. Show that a deadlock cannot occur. b. N processes share M resource units that can be reserved and released only one at a time. The maximum need of each process does not exceed M, and the sum of all maximum needs is less than M + N. Show that a deadlock cannot occur.