一个小的操作系统，开发使用GCC，成千上万的代码的作用…

银行家算法,还不错。有好的请与我联系！-bankers algorithm, is not bad. Good please contact me!

、课设内容及步骤 1. 消化课设算法思想及样本程序 给出对应模块（函数）的流程图 2. 编制 建立、删除、打开、关闭、读、写 函数 3. 准备调试数据（至少两个用户，若干文件），能实施多个命令操作 4. 上机编辑、编译源程序，并进行调试 5. 利用准备好的调试数据，运行测试程序， 观察运行结果，并作记录和分析 -, Class-based content and Step 1. Digest algorithm based lesson ideas and sample program are given the corresponding module (function) of the flow chart 2. Prepared to establish, delete, open, closed, read, write, function 3. Ready debugging data (at least two users, a number of documents), to implement a number of commands to operate 4. on the machine to edit, compile source code, and debugging 5. preparation good use of debugging data, run test procedures, observing the results, and for recording and analysis

模拟文件系统的功能，是一个熟型的文件结构-simulation file system functions, is a familiar type of document structure

进程调度算法的实现-Process Scheduling Algorithm Implementation

一个dos操作系统DRDOS的源码- Dos operating system DRDOS source code

生产者和消费者实验代码，主要是为了应付操作系统实验而选择的代码。希望可以帮助到大家顺利完成实验吧，不挂科。代码有相应的注释，大家应该看得懂。代码的环境是VC6.0就可以编译，很方便。好了，大家有兴趣就下载来用用吧。

ucos2.52版本的源代码，希望大家珍惜-ucos2.52 version of the source code, we hope that the treasure!

操作系统课程设计- The operating system curriculum designs

程序功能主要分为3个部分，分别是对OPT、FIFO、LRU三种页面置换算法的实现。要求3部分的设计应该尽可能使用近似的实现方法。-procedures main function is divided into three parts, namely the OPT, FIFO, three pages replacement LRU algorithm implementation. Part of the three requirements should be designed as far as possible to use similar methods to achieve.

1) 设计下沙校园平面图，在校园景点选10个左右景点。以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。 2) 为来访客人提供图中任意景点相关信息的查询。 3) 为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。 -1) Design Xiasha campus plan, in campus election spots around 10 spots. Vertex in order to express in various spots on campus, storage spots name, code, briefings and other information to express the path edge, storage path length and other relevant information. 2) for the visitors to provide map information on any attractions inquiries. 3) To provide visitors attractions arbitrary query to ask the way, that is, queries between any two spots of a shortest path.