实现第一

一个完整的GUI界面OS,单盘启动 实现了多线程、FAT32文件读写，GUI图形界面-a complete OS GUI interface, single-disk realized multiple threads, FAT32 file read and write, GUI graphical interface

作业分区管理算法-operations through management algorithm

希尔排序算法的实现C++sdvzvaGedgvfsewfcAWfqawfaswfasfc-Hill Sorting Algorithm of C sdvzvaGedgvfsewfcAWfqawfas wfasfc

http://www.codeforge.cn/article/edithttp://www.codeforge.cn/article/edithttp://www.codeforge.cn/article/edithttp://www.codeforge.cn/article/edit

设计一个有N个进程并发的进程调度程序。 进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）算法。 -Design of a concurrent process, N a process scheduler. The process of scheduling algorithm: The number of priority the highest priority scheduling algorithm (ie the number of processors allocated to the highest priority to the process) algorithm.

编程计算磁盘上（或某一目录下）所有文件的平均长度。 编程计算磁盘上（或某一目录及其各级子目录）每目录的平均文件个数。-programming calculated on the disk (or a directory) all the average length of documents. Programming calculated on the disk (or levels of a directory and its subdirectories), the average per-directory document number.

银行家算法的实例-bankers algorithm examples

内核，是一个操作系统的核心。它负责管理系统的进程、内存、设备驱动程序、文件和网络系统，决定着系统的性能和稳定性。Linux作为一个自由软件，在广大爱好者的支持下，内核版本不断更新。新的内核修订了旧内核的bug，并增加了许多新的特性。如果用户想要使用这些新特性，或想根据自己的系统度身定制一个更高效，更稳定的内核，就需要重新编译内核。本文将以RedHat Linux 6.0（kernel 2.2.5）为操作系统平台，介绍在Linux上进行内核编译的方法。 -Kernel is the core of an operating system. It is responsible for the process management system, memory, device drivers, files, and network system determines the system performance and stability. Linux as a free software, the majority of fans support, kernel version constantly updated. The core of the new amendments to the old kernel bug, and adds many new features. If users want to use these new features, or would like to according to their own system tailored to a more efficient, more stable core, will need to recompile the kernel. This article will be RedHat Linux 6.0 (kernel 2.2.5) for the operating system platform, introduced in the Linux kernel compile on approach.

采用首次适应法、最佳适应法或最差适应法，编写一内存分配和回收模拟程序。 动态地随机产生新的“内存分配”或“内存回收”请求，再按照你选定的分配算法修改这个数组。由于这个实验的重点在于内存分配，所以不考虑与某内存区相关的进程情况。-used first to adapt, adapt best or the worst adaptation law, the preparation of a memory allocation and recovery simulation program. Dynamic random to create a new "memory allocation" or "memory recovery" request, then you have chosen in accordance with the allocation algorithm to change the array. As the focus of this experiment is memory allocation, it is not considered relevant to a certain memory area of the process.

无陀螺捷联惯导系统角速度解算，基于六加速度计立方体模型。-GFSINS system angular velocity solver, based on the six-accelerometer cube model.