Write a 6 pages paper on operating system theory. On the other hand, the operating system can aid the programmer by offering library routines to execute dynamic loading. The basic method of implementing paging is where the physical memory is reduced to fixed-sized blocks referred to frames. This takes place when the logical memory is translated into equivalent-sized blocks referred to pages. When the CPU creates a consistent address, the page numbers and offsets, into the pages, are applied together to a page table, to decipher the command to a point in the physical memory. As the data is not normally altered, an end-user may begin to feel as if the pagination is working correctly. However, the result of the pagination turns out to be incorrect when introducing fresh data or getting rid of available data.Segmentation, which is a reference to a location of the memory, entails a factor that denotes a section and an offset in a section. These sections are put in object files of created programs when connected to a program image and when the image is stacked into memory. Segmentation deciphers a logical address as a cluster of segments. Every segment is attributed to distinctive names and measurements, such as lengths. These addresses denote the segment terms and offsets equally in the segments. An end-user in this regard distinguishes every address by two factors: the terms of the segments and offsets. However, in a paging scheme, an end-user denotes a distinctive address, separated by the hardware in page numbers and offsets. Every one of these factors cannot be seen by a programmer.In computers, demand paging is a technique of managing memory virtually. A demand paging system is comparable to a paging framework with swapping. This is with regard to the processes located in secondary memory. In demand paging, when processes are started, it is switched over into memory. A lazy swapper is applied other than switching over the complete processes.