Consider a program consists of five segments: S0 = 600, S1 = 14 KB, S2= 100 KB, S3 =580 KB and S4 = 96 KB. Assume at that time, the available free space partitions of memory are 1200–1805, 50 – 150, 220-234, and 2500-3180. Find the following: a. Draw logical to physical maps and segment table? b. Allocate space for each segment in memory? c. Calculate the external fragmentation and the internal fragmentation?

Consider a program consists of five segments: S0 = 600, S1 = 14 KB, S2= 100 KB, S3 =580 KB and S4 = 96 KB. Assume at that time, the available free space partitions of memory are 1200–1805, 50 – 150, 220-234, and 2500-3180. Find the following: a. Draw logical to physical maps and segment table? b. Allocate space for each segment in memory? c. Calculate the external fragmentation and the internal fragmentation?

Name: Consider a program consists of five segments: S0 = 600, S1 = 14 KB, S2
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Consider a program consists of five segments: S0 = 600, S1 = 14 KB, S2= 100 KB, S3 =580 KB and S4 = 96 KB. Assume at that time, the available free space partitions of memory are 1200–1805, 50 – 150, 220-234, and 2500-3180.Find the following:a. Draw l

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

) Consider the following sequence of virtual memory references (in decimal) generatedby a single program in a pure paging system:100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640a. Derive the corresponding reference string of pages (i.e. the pages the virtual addressesare located on), assuming a page size of 1024 bytes. (Assume that page numberingstarts at 0)b. For the page sequence derived above, determine the number of page faults for each ofthe following page replacement strategies, assuming that two (2) page frames areavailable to the program.i. LRUii. FIFOiii. OPT (Optimal)
Assume that main memory is composed of only three page frames for public use and that a seven-page program (with pages a, b, c, d, e, f, g) requests pages in the following order:a, c, a, b, a, d, a, c, b, d, e, f 2. Increase the size of memory so it contains four page frames for public use. Using the same page requests as above and FIFO, do another page trace analysis and compute the failure and success ratios. 3. Calculate the cache hit ratio using the formula presented in this chapter assuming that the total number of requests is 2,056 and 647 of those requests are found in the cache.
Assume a program of size 460 Bytes, and its virtual address sequence is as following 10 11 104 170 73 309 185 245 246 434 458 364 1.Suppose the page size is 100 Bytes, please write out the reference string. 2.Use the above reference string to calculate the number of page missing using the following algorithms: LRU, FIFO, OPT. We suppose the page frame is initially empty, and there is a total of 200 Bytes of physical memory.
Let's say that p is a pointer to memory and the next four bytes in memory (in hex) beginning at p's address are: 89 AB CD EF. After the following code is run on a little-endian computer what are the values of x, y, and the four bytes in memory beginning at p's address. Answer for x and y in four digits of upper-case hexadecimal (eg, 0AC6). Answer for memory as eight digits of upper-case hexadecimal with a single space between each byte (eg, 89 AB CD EF). x: y: mem at p:
Draw a picture illustrating the contents of memory, given the following data declarations: This is not a MARS program, but you need to draw a diagram showing the memory addresses and their contents. Assume that your data segment starts at 0x1000 in memory. Name: .asciiz "James." Age: .byte 24 Numbers: .word 11, 20 Letter1: .asciiz '"K'" Letter2: .byte 25
(Practice) Although the total number of bytes varies from computer to computer, memory sizes of millions and billions of bytes are common. In computer language, the letter M representsthe number 1,048,576, which is 2 raised to the 20th power, and G represents 1,073,741,824, which is 2 raised to the 30th power. Therefore, a memory size of 4 MB is really 4 times 1,048,576 (4,194,304 bytes), and a memory size of 2 GB is really 2 times 1,073,741,824 (2,147,483,648 bytes). Using this information, calculate the actual number of bytes in the following: a. A memory containing 512 MB b. A memory consisting of 512 MB words, where each word consists of 2 bytes c. A memory consisting of 512 MB words, where each word consists of 4 bytes d. A thumb drive that specifies 2 GB e. A disk that specifies 4 GB f. A disk that specifies 8 GB
Write a C++ program to read two columns of numbers, do arithmetic operations as described below and output the original values and computed values to the screen as tablea). Download the dataFile_lab2b). Read two columns of data into vector(s)c). Output two columns’ values to the screenc). Raise the first column by power 3 and multiple the second column by 3 d). Store the new values in separate vector(s)c). Print out the new values to the screen
By assuming that X is the last digit of your student number and 3X is a two digitnumber, consider memory storage of a 64-bit word stored at memory word 3X ina byte-addressable memory(a) What is the byte address of memory word 3X?(b) What are the byte addresses that memory word 3X spans?(c) Draw the number 0xF1234567890ABCDE stored at word 3X in both big-endianand little-endian machines. Clearly label the byte address corresponding to eachdata byte value.
Write a single and complete C program to help faculty ‘X’ preparing grades ofEEE 103:a. Ask the user how many students he has in his class and take it as input.b. Dynamically allocate memory and take input of the student’s EEE 103final marks using pointersc. Find the maximum marks obtained among them. The marks must beaccessed using pointer.d. Those who got below 50% of the maximum marks, add 2 marks bonus tothose student’s marks. The marks must be accessed using pointer.e. Consider the final exam has been taken for a total of 45 marks. But theweight of finals for the EEE 103 course is 32%. Now convert eachstudent's marks he received to 32% for preparing the grades. Store theconverted marks in another dynamically allocated array.f. Print the converted marks for all the students.
Recall that histograms are used for constructing load-balanced range partitions. Suppose you have a histogram where values are between 1 and 100, and are partitioned into 10 ranges, 1–10, 11–20,...,91–100, with frequencies 15, 5, 20, 10, 10, 5, 5, 20, 5, and 5, respectively. Give a load-balanced range partitioning function to divide the values into 5 partitions. Write an algorithm for computing a balanced range partition with p partitions, given a histogram of frequency distributions containing n ranges.
Write a program in C++ that reads data from a file. Create dynamic memory according to the data. Now your task is to perform the following task. Row wise Sum Column wise Sum Diagonal wise Sum Example data.txt 4 5 1.6 10.2 33.7 99 20.5 3 44 50 96.1 2 8 9 4 74 50 99 19.1 Output: Sum row wise: 165, 191, 17, 242.1 Sum col wise: 127.6, 120.1, 228.8, 118.1, 20.5 Sum diagonal wise: Not Possible Note: You are restricted to use pointers and your function should be generic as we discussed in class. Avoid memory wastage, memory leakage, dangling pointer. Use regrow or shrink concepts if required.
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