使用C语言编程模拟一个拥有若干个虚页的进程在给定的若干个实页中运行、并在缺页中断发生时分别使用FIFO和LRU算法进行页面置换的情形。其中虚页的个数可以事先给定（例如10个），对这些虚页访问的页地址流（其长度可以事先给定，例如20次虚页访问）可以由程序随机产生，也可以事先保存在文件中。要求程序运行时屏幕能显示出置换过程中的状态信息并输出访问结束时的页面命中率。程序应允许通过为该进程分配不同的实页数，来比较两种置换算法的稳定性。-Simulated using the C programming language has a number of virtual pages of the process in a given number of real pages to run, and the page fault occurs, respectively, the use of FIFO and LRU algorithm for page replacement situation. The number of virtual pages which can be given in advance (for example, 10), access to these virtual pages page address stream (whose length can be given in advance, for example, 20 virtual pages to access) can be randomly generated by the program can also be saved in advance in the document. Require the program is running the screen can show a displacement in the process of status information and the output end of the visit of the page hit rate. Procedures should be allowed through the process of distribution of the different real number of pages to compare the two kinds of replacement algorithm stability.