I need help with these Operating System questions

I can't find a good explanation on the internet

Questions

1 - Explain why it is possible for an operating system to load only a couple of pages of a program rather than the entire program?

2 - Describe the purpose of the Job Table (JT), Page Map Table (PMT) and Memory Map Table (MMT).

3 - Explain how the Job Table (JT), Page Map Table (PMT), and Memory Map Table (MMT) are each used to manage a program stored in memory.

4 - What are some advantages and disadvantages of selecting a page frame size of 1 MB? List at least one (1) advantage and disadvantage.

5 - What are some advantages and disadvantages of selecting a page frame size of 100 bytes? List at least one (1) advantage and disadvantage.

6 - Answer the following questions about a program containing 512 bytes and an operating system using a page frame size of 200 bytes.

a) How many page frames are necessary to store the entire program in memory?

b) How many bytes of external fragmentation exists when the entire program is stored in memory?

c)How many bytes of internal fragmentation exists in page frame containing the first page of the program?

d) How many bytes of internal fragmentation exists in page frame containing the last page of the program?

e) On which page would you find the program instruction at byte 256?

f) What is the displacement within the page of the program instruction at byte 256?

7 - Answer the following questions about thrashing.

a) What is thrashing?

b) Explain how thrashing improves or degrades system performance.

c) Provide at least two (2) causes of thrashing.

8 - Refer to this page request sequence A,C,B,D,A,C,E,A,C,B,D,E to answer the following questions.

a) Perform a page trace analysis using three (3) page frames and the First-In First-Out (FIFO) page replacement algorithm.

b) Perform a page trace analysis using three (3) page frames and the Least Recently Used (LRU) page replacement algorithm.

c) Which page replacement algorithm performed best for this page request sequence?

d) Will one page replacement algorithm always perform better than the other?

e) Perform a page trace analysis using four (4) page frames and the First-In First-Out (FIFO) page replacement algorithm.

f) Did increasing the number of available page frames increase or decrease the Success Rate of the First-In First-Out (FIFO) page replacement algorithm? Explain the cause of this increase or decrease.

g) What is the fewest number of page faults that could occur using either the First-In First-Out (FIFO) or Least Recently Used (LRU) page replacement algorithms?

9 - Answer the following questions about cache memory.

a) Which type of memory (cache or main memory) is faster?

b) Which type of memory (cache or main memory) is more expensive?

c) Which type of memory (cache or main memory) is larger?

10 - Answer the following questions about cache memory using a computer system with the following characteristics: Total Memory Requests: 5000, Memory Requests Found in Cache: 3500, Average Main Memory Access Time: 1000 nsec, and Average Cache Memory Access Time: 200 nsec.

a) What is the Hit Ratio for the system?

b) What is the Average Memory Access Time for the system?

c) Explain why is the Average Cache Memory Access Time is a constant value in the Average Memory Access Time formula.

d) Explain why is the Average Main Memory Access Time is dependent on the Hit Ratio value in the Average Memory Access Time formula.

e) What affect, if any, would doubling the available cache memory have on the Average Memory Access Time?

Thank you.