2. Suppose we have the diagram of memory shown below under a dynamic partitioning scheme. Blue areas represent blocks occupied by processes, blanks are holes (with sizes in Mbytes as indicate), The cross-hatched region is the location of the most recently loaded process. It is the only process in that region of memory. Its size is 5 M-byte. Only one process was swapped out after that. What is the maximum size of the swapped-out process? What is the size of the free block just before it was portioned by the crosshatched process? What algorithm was used to place the 5 Mbyte process? Why? 20 12 34 3 4 90

2. Suppose we have the diagram of memory shown below under a dynamic partitioning scheme. Blue areas represent blocks occupied by processes, blanks are holes (with sizes in Mbytes as indicate), The cross-hatched region is the location of the most recently loaded process. It is the only process in that region of memory. Its size is 5 M-byte. Only one process was swapped out after that. What is the maximum size of the swapped-out process? What is the size of the free block just before it was portioned by the crosshatched process? What algorithm was used to place the 5 Mbyte process? Why? 20 12 34 3 4 90

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

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?
Suppose your system has a memory of size 100 MB using contiguous memory allocations and there are 4 fixed size partitions. Partition one of size 50, partition 2 of size 200, partition 3 of size 100 and partition 4 of size 150 Consider First 5 letters of your name. The ASCII code of the letters is the size of process and the alphabet is the name of process. The processes appear in alphabetical order. Q= How many processes will be loaded in the memory at a time? For contiguous memory allocation show the algorithms used to allocate memory partitions to each process and state which algorithm will work best and why? Also state the amount of internal and external fragmentation for the processes and partitions after allocation NOTE :MY NAME IS ALIZAHID
In the working set model, the idea is to examine the most recent delta page referances. It is also known as an approximation of the Program's Locality. If the total demand is greater than the total number of available frames (D>m) then it will cause thrashing, because in this case, some processes will not have enough frames. Below you see 3 processes and their excepted memory references during their execution. When will the thrashing happen to occur according to the working set model? Assume total memory(m) is 10 and Delta is 5
If you are to add a new 10MB process in the memory, where could it possibly be added and why? What could be the size of the free block just before it was partitioned by X? Rationalize your answer. A new process is requesting a 3MB allocation. Illustrate the possible memory configuration using a horizontal segmented memory strip (like the diagram above), where a partition will be created for the new process under the following placement algorithms: best-fit and first-fit. Label your illustration clearly.
Consider a file system that uses inodes to represent files. Disk blocks are 8 KB in size, and a pointer to a disk block requires 8 bytes. This file system has 12 direct disk blocks, as well as 1 single and 1 double indirect disk blocks. What is the maximum size of a file that can be stored in this file system in GBs (round to the nearest integer)?
Consider a filesystem that uses inodes to represent files. Each inode contains pointers to 12 direct disk blocks, as well as a single and double indirect blocks. Disk blocks are 1KB in size, and a pointer to a disk block requires 4 bytes. If we install this filesystem on a 4TB SSD, we have (select all that apply) the SSD cannot store more than 4 billion files the SSD cannot store more than 1 billion files the SSD at least can store about 650 files the SSD at least can store about 6,500 files none of above
Consider a Data file of r=30,000 EMPLOYEE records of fixed-length, consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record pointer is P R =7 bytes long. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker. Calculate the record size R in bytes. Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization. Suppose the file is ordered by the key field SSN and we want to construct a primary index on SSN. Calculate the index blocking factor bfr .
Regarding the advantages of dynamic partitioning, which of the following best describes "Degree of multiprogramming is dynamic"? Group of answer choices *there will not be any unused remaining space in the partition *partition size is decided according to the process size *None of these *due to the absence of internal fragmentation more processes can be loaded in the memory at the same time
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.
In a system with fixed partitions, there are 4 partitions available to jobs. Their sizes are 16, 32, 48, and 64 KB. Four jobs executed by the system at the moment have the following sizes: 12, 22, 42, and 55 KB. The amount of internal fragmentation expressed in KB is: نه نه نه نن فم a. b. C. d. e. f. g. h. 0 12 17 25 29 34 41 56
Write a C program Producer – Consumer as a classical problem of synchronizationStep 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo code for implementation.*program to write: produce -consumer problem to produce and consume the alphabet.//Shared data: semaphore full, empty, mutex;//pool of n buffers, each can hold one item//mutex provides mutual exclusion to the buffer pool//empty and full count the number of empty and full buffers//Initially: full = 0, empty = n, mutex = 1//Producer thread do {…produce next item…wait(empty); wait(mutex);…add the item to buffer…signal(mutex); signal(full);} while (1);//Consumer thread do {wait(full) wait(mutex);…remove next item from buffer…signal(mutex); signal(empty);…consume the item } while (1);
Write a C program Producer – Consumer as a classical problem of synchronizationStep 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo codefor implementation.*program to write: produce -consumer problem to produce and consume the alphabet.//Shared data: semaphore full, empty, mutex;//pool of n buffers, each can hold one item//mutex provides mutual exclusion to the buffer pool//empty and full count the number of empty and full buffers//Initially: full = 0, empty = n, mutex = 1//Producer threaddo {…produce next item…wait(empty);wait(mutex);…add the item to buffer…signal(mutex);signal(full);} while (1);//Consumer threaddo {wait(full)wait(mutex);…remove next item from buffer…signal(mutex);signal(empty);…consume the item } while (1); it consumes and produce the alphabets not numbers sample output is attached you please also attach your sample output