考虑到动态演示程序设计的复杂性，我们选择完成静态模拟3

种存储管理方式的寻址过程。三种存储管理方式的地址换算过程实际就是一个寻址过程。要完成演示，就要将其寻址过程打印出来。我们可以用数组模拟系统中的页表、段表、以及页表、段表寄存器。在分页、段页方式中，我们规定页面的大小然后在分页方式中的快号以及分段方式中的段长与基址、段页方式中的页表始址用随机函数模拟。当然实际系统中并非如此。然后再分别按照其寻址机制，将寻址过程显示出来，实现模拟！

-Taking into account the dynamic demo program design complexity, we choose to complete the static simulation of 3

Kind of way of addressing storage management process. Three kinds of memory management of address translation is a process of addressing the actual process. To complete the demonstration, we should be addressing the process of printing out. We can use an array of simulation system page table, segment table, and the page table, segment table register. In the page, section pages in the way, we require that the size of the page and then the way in the page number and sub-fast way to segment length and base address, segment page table page in the way beginning with a random function for the simulation site. Of course the actual system is not the case. Then in accordance with their respective addressing mechanism to address the process shown, analog!