Commit 4ed5edd

@@ -29,6 +29,20 @@ Your answer for each question should be about 150 words. (100 marks total)
 > however, by providing library routines to implement dynamic loading.
 
 1. Explain the basic method for implementing paging. (8 marks)
+
+> The basic method for implementing paging involves breaking physical memory
+> into fixed-sized blocks called frames and breaking logical memory into blocks
+> of the same size called pages. When a process is to be executed, its pages are
+> loaded into any available memory frames from their source (a file system or
+> the backing store). The backing store is divided into fixed-sized blocks that
+> are of the same size as the memory frames.
+
+> Every address generated by the CPU is divided into two parts:
+> a page number (p) and a page offset (d). The page number is used as an index
+> into a page table. The page table contains the base address of each page in
+> physical memory. This base address is combined with the page offset to define
+> the physical address is sent to the memory unit.
+
 1. Briefly describe the segmentation memory management scheme. How does it differ from the paging memory management scheme in terms of the user’s view of memory? (8 marks)
 1. Explain the distinction between a demand-paging system and a paging system with swapping. (8 marks)
 1. How does the second-chance algorithm for page replacement differ from the FIFO page replacement algorithm? (8 marks)