搜索资源列表
shiyan
- 利用队列的先进先出特性解决火车重排问题,输入车厢长度及顺序编号后由程序自动完成排列-Characteristics of the use of FIFO queues to solve the train rearrangement problem, enter the compartment length and serial numbers automatically after the completion of arrangement
5080309283_1
- 建立一个队列,实现先进先出。使用的是数组,而不是链表。-The establishment of a queue, to achieve FIFO. Using an array instead of linked lists.
ArrayQueue
- Java队列 队列是一种“FIFO”先进先出的数据结构.可以想象每年在火车站中买票的人群所组成的"队列"。 |队员1 队员2 队员3 队员3 队员4 队员5 队员6 队员7 队员8| ^ ^ 想象两个指针-Java Queue Queue is a " FIFO" First In First Out data structure. Imagine a year of people buy tickets at the station formed in a " q
os
- 操作系统先进先出页面置换算法,可计算缺页数和缺页率。-OS FIFO page replacement algorithm, calculate the rate of missing pages and missing pages.
Cpp1
- 页面的置换算法,采用的先进先出的形式 -Page replacement algorithms, using the FIFO in the form of
5080309330_1
- 队列(Queue)是一种用于实现先进先出(FIFO)的数据结构,即第一个进入队列的数据排在队列的最前处,第二个进入队列的数据排在其后,依此类推;出队列时,总是排在队列最前处的那个数据先出队列。-Queue is used to implement FIFO (FIFO) data structure, that is, the first row of data into the queue in the queue at the most before the second row of da
jmmP
- 实现处理机模拟调度算法,四种进程调度算法,先进先出算法,短作业优先算法,高响应比优先算法,时间片算法-Scheduling algorithm to achieve processor simulation, four kinds of process scheduling algorithm, FIFO algorithm, the short job first algorithm, a high response ratio of priority algorithms, time sli
zhuangjj
- 页面置换算法 先进先出、最近最久未使用、最佳页面置换算法-FIFO page replacement algorithms, the recent use of the most long-lost, the best page replacement algorithm for
FIFO
- 先进先出堆栈,简单,易读。将时序逻辑和组合逻辑分别列入不同过程块,适合初学者阅读。-first in firt out
fifolrusuijitaotai
- 课题三 设计一个虚拟存储区和内存工作区,编程序演示下述置换算法的具体实现过程,并计算访问命中率: 要求从主界面选择某算法,且以下算法都要实现 1、先进先出算法(FIFO) 2、最近最久未使用算法(LRU) 3、随机淘汰算法-fifo,lru
MFC_scheduling_algorithm
- 操作系统中,四种CPU调度算法的演示:先进先出、动态优先级、时间片轮转法和多级反馈队列。-This program demonstrates four scheduling algorithms of CPU in the OS:FCFS、 DP、 RR&MLFQ
os6
- 模拟内存换页算法,包括FIFO(先进先出first in first out),OPT(动态分配optimal),LRU(最近不使用latest use recently),LFR(最近最低频率lowest frequency recently),NUR(最近不使用no used recently)-Analog memory paging algorithms, including FIFO (first in first out first in first out), OPT (dynam
fifo
- 完成进程调度,页面置换算法中先进先出算法(FIFO)的源代码,对学习操作系统很有用的~-The completion of the process of scheduling, the page replacement algorithm in the FIFO method (FIFO) of the source code, useful for learning the operating system ~
1
- 是简单的分配算法,采用先进先出的方式进行调度-Is a simple allocation algorithm, using FIFO approach to scheduling
os
- 模拟操作系统中的分页管理 采用先进先出算法 模拟了缺页调度-Simulated the paging management of the operating system using FIFO scheduling algorithm is to simulate the missing pages
FIFO
- 操作系统中的先进先出(FIFO)页面置换算法的C++源代码-Operating in the FIFO (FIFO) Page Replacement Algorithm for C++ source code
10703
- 模拟实现操作系统中页面置换算法,包括最近最久未使用算法,先进先出算法和最佳实现算法-Simulation of real operating system, Page-Replacement Algorithms
1(1)
- 操作系统 进程调度算法、、先进先出以及静态优先数法-The operating system process scheduling algorithms, FIFO and static priority number method
banksystem
- 一个模拟银行服务系统的java程序,先进先出,后缀名为java-A simulated banking system, java program, FIFO, suffix, called java
shift-siso
- 先进先出序列发生器,详细说明见文档中的注释,希望能帮到大家-FIFO sequence generator, a detailed explanation see the comments in the document, hoping to help you