<?xml version="1.0" encoding="gbk"?>
<rss version="2.0">
<channel>
 <title><![CDATA[如何用java实现先进先出页面置换算法?]]></title>
 <link><![CDATA[http://42.193.176.42/read.php?tid=20597]]></link>
 <description><![CDATA[Latest 20 replies of 如何用java实现先进先出页面置换算法?]]></description>
 <copyright><![CDATA[Copyright(C) 风云小站]]></copyright>
 <generator><![CDATA[PHPWind BLOG by PHPWind Studio]]></generator>
 <lastBuildDate><![CDATA[Mon, 06 Apr 2026 15:21:50 +0000]]></lastBuildDate>
  <image>
 <url><![CDATA[images/rss.gif]]></url>
 <title><![CDATA[PHPWind Board]]></title>
 <link><![CDATA[http://42.193.176.42]]></link>
 <description><![CDATA[风云小站]]></description>
  </image>
<item>
 <title><![CDATA[]]></title>
 <description><![CDATA[如果是这个作业的话：
[color=red]具体要求是这样的,有一组数要调入内存,这组数是7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1,进程分配了三个物理块,依次调入7,0,1,当调入2时,把最先调入的7调出,调入0时,不变,调入3时,把0换出因为他是最老的页,依次类推[/color]
就用以下的
[code]
import java.util.*; 
class FIFOTest {
p ..]]></description>
 <link><![CDATA[http://42.193.176.42/read.php?tid=20597#518416]]></link>
 <author><![CDATA[天堂之泪]]></author>
 <category><![CDATA[『 求助专区 』]]></category>
 <pubdate><![CDATA[Sat, 23 Dec 2006 08:32:14 +0000]]></pubdate>
</item>
<item>
 <title><![CDATA[]]></title>
 <description><![CDATA[[code]import java.util.*; 
class FIFOTest {
public static void main(String [] args){
Fifo f=new Fifo();
for(int i=0;i&lt;5;i++){
f.addque(&quot;Test First In First Out ----:&quot; + i);
}
System.out.println(&quot;Loading!&quot;);
while(!f.isEmpty()){
System.out.println(&quot;Now is input Test Firs ..]]></description>
 <link><![CDATA[http://42.193.176.42/read.php?tid=20597#518409]]></link>
 <author><![CDATA[天堂之泪]]></author>
 <category><![CDATA[『 求助专区 』]]></category>
 <pubdate><![CDATA[Sat, 23 Dec 2006 08:30:47 +0000]]></pubdate>
</item>
</channel></rss>