Top part is a chart

job 1 (10k) 20K
30k

50k
jOB 2 (15k) 65k
75k

jOB 3 (45K)

120K
200K

jOB 4 ARRIVES REQUESTING A BLOCK OF 100k?

A. CAN JOB 4 BE ACCOMMODATED WHY OR WHY NOT

B. IF RELOCATION IS USED WHAT ARE THE CONTENTS OF THE RELOCATION REQISTERS FOR JOB 1 JOB 2 AND JOB 3 AFTER COMPACTION

c. what are the contents of the relocation register for job 4 after it has been loaded into memory

d. the instruction ADDI 4, 10 is part of job 1 and was originally loaded into memory location 22K what is its new location after compaction

e. the instruction MUL4, NUMBER is part of job 2 and was originally loaded into memory location 55k what is its new location after compaction

f. the instruction MOVE3, SUM is part of job 3 and was originally loaded into memory location 80K what is its new location after compaction

g. if sum was originally loaded into memory 110K what is its new location after compaction.

h. if the instruction MOVE3, sum is stored as follows (this is in octal instead of binary for compactness) 200 03 00 334000, the rightmost value indicates the memory location where sum is stored what would that value be after compaction

a)can be accomoded only after compaction since 80 k is only left at last..

b)1-(20-30)
2-(30-45)
3-(45-90)
free-(90-200)
c) 4-(90-190)
d)22k will correspond to 22k only... since at first only
e)55k will correspond to 35k after compaction
f)80k will correspond to 50 k
g)110 k would have corresponded to 80 k

4. Given that main memory is composed of 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, b, a c, d, a, e, f, g, c, b, g
a. Using the FIFO page removal algorithm, do a page trace analysis indicating page faults with asterisks (*). Then compute the failure and success ratios.
b. Increase the size of memory so it contains four page frames for public used. Using the same page requests as above and FIFO do another page trace analysis and compute the failure and success ratios.
c. Did the result correspond with your intuition? Explain

To answer your questions, let's go step by step:

A. Can Job 4 be accommodated? Why or why not?
Based on the given chart, the available memory blocks are:
- Job 1: 20K, 30K, 50K
- Job 2: 65K, 75K
- Job 3: 120K, 200K

Since Job 4 requires a block of 100K, it cannot be accommodated because there are no single blocks available that meet or exceed its required size.

B. If relocation is used, what are the contents of the relocation registers for Job 1, Job 2, and Job 3 after compaction?
Since compaction is not mentioned in the given information, it is assumed that the relocation registers remain unchanged. Therefore, the contents of the relocation registers for Job 1, Job 2, and Job 3 would be the original values as they were loaded into memory.

C. What are the contents of the relocation register for Job 4 after it has been loaded into memory?
Since Job 4 cannot be accommodated due to unavailable memory blocks, there would be no contents in the relocation register for Job 4.

D. The instruction ADDI 4, 10 is part of Job 1 and was originally loaded into memory location 22K. What is its new location after compaction?
Since compaction is not mentioned in the given information, it is assumed that the instruction locations remain unchanged. Therefore, the instruction ADDI 4, 10 would still be located at memory address 22K.

E. The instruction MUL4, NUMBER is part of Job 2 and was originally loaded into memory location 55K. What is its new location after compaction?
Since compaction is not mentioned in the given information, it is assumed that the instruction locations remain unchanged. Therefore, the instruction MUL4, NUMBER would still be located at memory address 55K.

F. The instruction MOVE3, SUM is part of Job 3 and was originally loaded into memory location 80K. What is its new location after compaction?
Since compaction is not mentioned in the given information, it is assumed that the instruction locations remain unchanged. Therefore, the instruction MOVE3, SUM would still be located at memory address 80K.

G. If SUM was originally loaded into memory at 110K, what is its new location after compaction?
Since compaction is not mentioned in the given information, it is assumed that the instruction locations remain unchanged. Therefore, SUM would still be located at memory address 110K.

H. If the instruction MOVE3, SUM is stored as follows (in octal): 200 03 00 334000, and the rightmost value indicates the memory location where SUM is stored, what would that value be after compaction?
Since compaction is not mentioned in the given information, it is assumed that the memory locations remain unchanged. Therefore, the value indicating the memory location where SUM is stored would still be 334000.

To answer these questions, we need to understand the given chart and the concept of memory compaction.

In the chart, the top part displays memory blocks allocated to different jobs. Each job has its base address (the leftmost number) and its size (the number in parentheses). The arrows indicate the growth direction of each job in memory.

Now let's tackle each question:

A. To determine if Job 4 can be accommodated in memory, we need to find a contiguous block of 100k of free memory. Since there are no contiguous 100k blocks available, Job 4 cannot be accommodated.

B. Relocation refers to moving the contents of loaded jobs to new memory locations to create a contiguous block. Since Job 4 cannot be accommodated, relocation is not required. Therefore, the relocation registers for Job 1, Job 2, and Job 3 would remain unchanged.

C. Since Job 4 cannot be loaded into memory, there would be no relocation register created for it.

D. To determine the new location of "ADDI 4, 10" instruction from Job 1 after compaction, we need to find out where Job 1 is relocated. Since Job 1 occupies memory from 20K to 30K, its new location will be determined by the compaction process.

E. Similarly, to determine the new location of the "MUL4, NUMBER" instruction from Job 2 after compaction, we need to find out where Job 2 is relocated. Since Job 2 occupies memory from 65K to 75K, its new location will be determined by the compaction process.

F. We follow the same pattern to determine the new location of the "MOVE3, SUM" instruction from Job 3 after compaction. Since Job 3 occupies memory from 120K to 200K, its new location will be determined by the compaction process.

G. If "SUM" was originally stored in memory location 110K, we need to find its new location after compaction. Since Job 3 occupies memory from 120K to 200K, "SUM" will be relocated based on the compaction process.

H. The instruction "MOVE3, SUM" is stored as "200 03 00 334000." The rightmost value indicates the memory location where "SUM" is stored. However, since the compaction process may change the memory layout, we cannot determine the new value without knowing the new location of Job 3.

To completely answer questions D, E, F, G, and H, we need more information about the new location and memory layout resulting from the compaction process.