作业调度三种算法FCFS，SJF，HRN

linux内核，它非常适合用于学习操作系统的原理以及对相关操作系统的开发也有很好的借鉴作用-linux kernel, it is very suitable for learning the principles of operating systems, as well as the development of the relevant operating system also has a very good reference

学习MFC的好东西,跟刚才的一起-learning MFC good things, together with the earlier

银行家算法.解决死锁问题-bankers algorithm. Resolve Deadlock

这里是ＵＣ／ＯＳ－１１　的２．６的内核代码-UC/OS-11 here is the 2.6 kernel code

DOS - ç ，它的内核也是FreeDOS的内核。并在此基础上进行了一定的修改，使其更加实用。 FreeDOS的是项目设计 提供替代到MS - DOS，PC的DOS的和DR - DOS的自由 。-DOS-C started in 1988 as an experiment in writing device drivers in C for Microsoft s MS-DOS. Both block and character device drivers were written, along with special C data structures to match the MS-DOS request packet. It was then recognized that using the same techniques, an operating system could be written that would take advantage of the C language features and would require much less time to develop than the traditional assembly language techniques. Although UNIX had proven this earlier, it was not tried with a traditional pc operating system. At this time, a minimal operating system using the device drivers written earlier along with a new 8086 interrupt API was developed. It was called XDOS and proved to be a functional operating system. This new operating system was used to develop booting techniques and a C library SDK was dev

ucos_II的33个经典例题，均调试通过的，学习ucos_II的捷径。强烈推荐！因代码太多只有一次上传6个，分成了5次上载。-ucos_II of 33 classic examples, both through debugging and learning ucos_II shortcut. Strongly recommended! Because too many code only once Upload six, divided into five available.

用C语言模拟操作系统的队列及时间片分配 简单-C language simulation operating system queue and the time allocated simple film

调试程序使其在读者优先模式下可以运行并且能实现基本的功能得出正确的结果：能够实现读写互斥，写写互斥，读读不互斥，一个进程结束能够唤醒等待队列中的进程（先读者队列后写着队列）完善功能：由用户决定写者向缓冲区中写入的内容，读者能够读出并显示出来；当缓冲区中没有数据时，读者要等待，直到缓冲区中有数据才能读根据“读者优先”加以改变，增加一个“写者优先”模式，并且由用户来选择模式

VB与sql数据库的完美结合实例1-sql database VB and the perfect example of a combination

页面置换算法 先进先出、最近最久未使用、最佳页面置换算法-FIFO page replacement algorithms, the recent use of the most long-lost, the best page replacement algorithm for