Pls help computer science I will give brainliest

Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB, and 185 MB (in order), how would the first-fit, best-fit,

nlexa [21]

Answer:

We have six memory partitions, let label them:

100MB (F1), 170MB (F2), 40MB (F3), 205MB (F4), 300MB (F5) and 185MB (F6).

We also have six processes, let label them:

200MB (P1), 15MB (P2), 185MB (P3), 75MB (P4), 175MB (P5) and 80MB (P6).

Using First-fit

P1 will be allocated to F4. Therefore, F4 will have a remaining space of 5MB from (205 - 200).
P2 will be allocated to F1. Therefore, F1 will have a remaining space of 85MB from (100 - 15).
P3 will be allocated F5. Therefore, F5 will have a remaining space of 115MB from (300 - 185).
P4 will be allocated to the remaining space of F1. Since F1 has a remaining space of 85MB, if P4 is assigned there, the remaining space of F1 will be 10MB from (85 - 75).
P5 will be allocated to F6. Therefore, F6 will have a remaining space of 10MB from (185 - 175).
P6 will be allocated to F2. Therefore, F2 will have a remaining space of 90MB from (170 - 80).

The remaining free space while using First-fit include: F1 having 10MB, F2 having 90MB, F3 having 40MB as it was not use at all, F4 having 5MB, F5 having 115MB and F6 having 10MB.

Using Best-fit

P1 will be allocated to F4. Therefore, F4 will have a remaining space of 5MB from (205 - 200).
P2 will be allocated to F3. Therefore, F3 will have a remaining space of 25MB from (40 - 15).
P3 will be allocated to F6. Therefore, F6 will have no remaining space as it is entirely occupied by P3.
P4 will be allocated to F1. Therefore, F1 will have a remaining space of of 25MB from (100 - 75).
P5 will be allocated to F5. Therefore, F5 will have a remaining space of 125MB from (300 - 175).
P6 will be allocated to the part of the remaining space of F5. Therefore, F5 will have a remaining space of 45MB from (125 - 80).

The remaining free space while using Best-fit include: F1 having 25MB, F2 having 170MB as it was not use at all, F3 having 25MB, F4 having 5MB, F5 having 45MB and F6 having no space remaining.

Using Worst-fit

P1 will be allocated to F5. Therefore, F5 will have a remaining space of 100MB from (300 - 200).
P2 will be allocated to F4. Therefore, F4 will have a remaining space of 190MB from (205 - 15).
P3 will be allocated to part of F4 remaining space. Therefore, F4 will have a remaining space of 5MB from (190 - 185).
P4 will be allocated to F6. Therefore, the remaining space of F6 will be 110MB from (185 - 75).
P5 will not be allocated to any of the available space because none can contain it.
P6 will be allocated to F2. Therefore, F2 will have a remaining space of 90MB from (170 - 80).

The remaining free space while using Worst-fit include: F1 having 100MB, F2 having 90MB, F3 having 40MB, F4 having 5MB, F5 having 100MB and F6 having 110MB.

Explanation:

First-fit allocate process to the very first available memory that can contain the process.

Best-fit allocate process to the memory that exactly contain the process while trying to minimize creation of smaller partition that might lead to wastage.

Worst-fit allocate process to the largest available memory.

From the answer given; best-fit perform well as all process are allocated to memory and it reduces wastage in the form of smaller partition. Worst-fit is indeed the worst as some process could not be assigned to any memory partition.

8 0

3 years ago

Finish and test the following two functions append and merge in the skeleton file:

avanturin [10]

Answer:

Explanation:

#include <iostream>

using namespace std;

int* append(int*,int,int*,int);

int* merge(int*,int,int*,int);

void print(int*,int);

int main()

{ int a[] = {11,33,55,77,99};

int b[] = {22,44,66,88};

print(a,5);

print(b,4);

int* c = append(a,5,b,4); // c points to the appended array=

print(c,9);

int* d = merge(a,5,b,4);

print(d,9);

}

void print(int* a, int n)

{ cout << "{" << a[0];

for (int i=1; i<n; i++)

cout << "," << a[i];

cout << "}\n";

}

int* append(int* a, int m, int* b, int n)

{

int * p= (int *)malloc(sizeof(int)*(m+n));

int i,index=0;

for(i=0;i<m;i++)

p[index++]=a[i];

for(i=0;i<n;i++)

p[index++]=b[i];

return p;

}

int* merge(int* a, int m, int* b, int n)

{

int i, j, k;

j = k = 0;

int *mergeRes = (int *)malloc(sizeof(int)*(m+n));

for (i = 0; i < m + n;) {

if (j < m && k < n) {

if (a[j] < b[k]) {

mergeRes[i] = a[j];

j++;

}

else {

mergeRes[i] = b[k];

k++;

}

i++;

}

// copying remaining elements from the b

else if (j == m) {

for (; i < m + n;) {

mergeRes[i] = b[k];

k++;

i++;

}

// copying remaining elements from the a

else {

for (; i < m + n;) {

mergeRes[i] = a[j];

j++;

i++;

}

return mergeRes;

}

4 0

3 years ago

The instructions in a program, when expressed in Python, ...

sergejj [24]

Answer:

can only be carried out by computers, as long as an interpreter is available which one is it?

Explanation:

The interperetor needed is called CPython, this is the standard C implementation of the language.

7 0

2 years ago

98 points possible

joja [24]

A programming language is not used to talk from human to human. It is used to talk from a human to a computer. Computers are very dumb compared to us, so they need to be taught or spoken to in simple terms. Asking them something complex is far beyond their understanding, as they cannot learn anything beyond what has already been taught to them. Using print: “Hello, World” is the way to tell them to do stuff way less complex than when we say ‘write the words Hello, World on the screen’. A programming language is also not very easy to create. Talking to a computer in a dumb way reduces the process to make a new language for the computer to understand.

6 0

3 years ago

Read 2 more answers

The option to add the date and time to a document is located in the

Tomtit [17]

Answer:

The option to add the date and time to a document is located in the

text grouping on the Insert tab.

Explanation:

8 0

3 years ago

Read 2 more answers