4. The following is the memory configuration at a given point in time where dynamic partitioning scheme is used. The shaded areas indicate memory spaces already allocated to other processes, while the white spaces are holes (free memory spaces). The next FOUR (4) memory requests are 30M, followed by 50M, 20M and 40M (in order). Shade and indicate clearly which memory block will be allocated to each request using the first- fit and next-fit placement algorithms. (First-fit) 20M (Best-fit) 20M (Next-fit) 20M 80M 80M 20M 80M 20M (X is the lastest allocated block) 20M 50M 50M 50M 10M 10M 10M X 30M 30M 30M

4. The following is the memory configuration at a given point in time where dynamic partitioning scheme is used. The shaded areas indicate memory spaces already allocated to other processes, while the white spaces are holes (free memory spaces). The next FOUR (4) memory requests are 30M, followed by 50M, 20M and 40M (in order). Shade and indicate clearly which memory block will be allocated to each request using the first- fit and next-fit placement algorithms. (First-fit) 20M (Best-fit) 20M (Next-fit) 20M 80M 80M 20M 80M 20M (X is the lastest allocated block) 20M 50M 50M 50M 10M 10M 10M X 30M 30M 30M

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

Consider a file currently consisting of 83 blocks. Assume that the file control block (and the index block, in the case of indexed allocation) is already in memory. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single-level) allocation strategies, if, for one block, the following conditions hold. In the contiguous allocation case, assume that there is room to grow in the beginning and in the end. Assume that the block information to be added is stored in memory. For linked allocation, there is a head and tail pointer pointing respectively to the first and last node. Note that while calculating the total number of I/O operations for each, also indicate how many are from r (read) and w (write). For each part, if there is more than one answer, choose the one that gives you the least number of I/O operations. The block is removed from the beginning The block is added after 41st block The block is removed from the end Assumptions: Read one whole…
Let's implement the FIRST FIT contiguous memory allocation technique. Ask the user to enter number of free memory partitions along with size of each (fixed partitions). Then accept the number of processes. The user also enters the memory requirement for each process. Your program then allocates the free memory partitions to the arriving processes. You need to keep track of the internal fragmentation and display the output as follows: INPUT Enter number of free partitions/Memory holes: 4 Enter the size of each free partition/Mem Hole in KBs Memory Hole 0: 220 Memory Hole 1: 340 Memory Hole 2: 115 Memory Hole 3: 720 Enter the number of processes in ready queue: 3 Enter the memory requirements of each process in KBS Process 0: 240 Process 1: 512 Process 2: 310 OUTPUT Process No. 0 1 2 Partition Allocated 1 3 No allocation Internal Fragmentation 100 208
[5] In Partition () of QuickSort(), which final position of the Pivot will be a useful one? The first index, the middle index or the last index? Would there be any other useful one beside those indicies? Why or why not?
8. Consider one disk with 400 cylinders, numbered 0 to 399. Assume the current position of head is at cylinder 130. The request queue is given as follows: 150, 40, 350, 100, 280 For each of the disk-scheduling algorithms given below, show (by plotting in the graphs below) the current position of head based on the disk arm movement to satisfy the above requests, and count the total distance (in cylinders) of the disk arm movement. a. First Come First Served (FCFS) 0 40 100 1.30 150 Total distance (disk am movement) = b. Shortest Seek Time First (SSTF) 40 100 130 150 0 Total distance (disk arm movement) = c. LOOK - in the direction of increasing track number 0 40 100 130 150 Total distance (disk arm movement) = 280 280 280 350 350 350 399 399 399
A company has a calculation strategy where the number of file systems needed indicates a disk with 1000 blocks. There are in total five files. Assume the end block, index block wherever required. Also, considering that the file control block contains the information in the order of Using contiguous, linked and indexed allocation methods compute the allocated files.
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?
Given there are six free memory partitions of sizes 100KB, 30OKB, 500KB, 550KB, 250KB and 150KB, respectively in that order. These partitions need to be allocated to five processes of sizes 257KB, 310KB, 68KB, 119KB, 23KB in that order. Assume that the search for free partitions starts from the first memory partition. If the NEXT-FIT algorithm is used with DYNAMIC memory allocation approach, list the sizes of free partitions (holes) available after memory allocation to the five given processes.
Paging is a memory management scheme that eliminates the need for contiguous allocation of physical memory. This scheme permits the physical address space of a process to be non – contiguous. Given below is one of the page replacement algorithm program, you are to first identify which algorithm (FIFO, Optimal Page Replacement, Least frequently used) is implemented in given c-code. Please consider following reference string for this page replacement algorithm(1,2,3 5,1,3,4,5,6,1,5,3,2) with 4 page/frame size. There are some errors in this program, you have to correct it first, and then explain compiled output with each miss or hit condition. Note: Show complete procedure with detail steps/screenshots with your arid number. #include <stdio.h> void main() { intpos,c,m,maxi,i,k,nf,count,j=0,pf=0,np=0; printf("enter no. of pages"); scanf("%d",&np); int s[np]; printf("Enter pages sequence :\n");…
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
Problem: A 1024 x 1024 array of 32-bit numbers is to be normalized as follows. For each column, the largest element is found and all elements of the column are divided by the value of this element. Assume that each page in the virtual memory consists of 4K bytes, and that 1M bytes of the main memory are allocated for storing array data during this computation. Assume that it takes 10 ms to load a page from the disk into the main memory when a page fault occurs. (a) Assume that the array is processed one column at a time. How many page faults would occur and how long does it take to complete the normalization process if the elements of the array are stored in column order in the virtual memory? (b) Repeat part (a) assuming the elements are stored in row order?