实例 56－－创建动态链接库，可以自由下载

Fortran科学计算程序,计算多原子间力的大小,能级分布-Fortran procedures for scientific computing, computing power and more inter-atomic size, level distribution

一个限制程序使用时间的原码-procedures for the use of a time limit to the original code

dll编程，如果要学习动态链接库编程，这是值得一看的资料。-dll programming, if we learn DLL programming, it is worth looking at the information.

通过API函数读取硬盘物理序列号可直接用于工控方面进行加密-read through the API function sequence of physical drives can be used directly for encryption IPC

以API方式编程，可以检测当前系统物理内存、虚拟内存以及页文件的总尺寸和可用大小。-API approach to programming, can detect the current system of physical memory, virtual memory and page file size and available size of the total.

DELPHI的技巧集，其中包含了很多在DELPHI编程中所需的技巧及源码。-DELPHI skills set, which contains many of the Delphi programming skills and the necessary source code.

进程调度算法：采用最高优先数优先的调度算法，即把处理机分配给优先数最高的进程。 每个进程由一个进程控制块（PCB）表示。进程控制块可以包含如下信息：进程名、优先数、需要运行的时间、已占用的CPU时间、进程状态等等。 进程的优先数及所需要运行的时间可以事先人为地指定（也可由随机数产生）。 进程的运行时间以时间片为单位进行计算。 每个进程的状态可以是就绪W（Wait），运行R（Run），或完成F（Finish）三种状态之一。-process Scheduling Algorithm : The highest priority of several priority scheduling algorithm, which is allocated to the processor the highest priority in the process. Every process from a process control block (PCB) said. Process control block may contain the following information : process, and priority number, the need to run time, has taken the CPU time, the process of the state and so on. Several priorities for the process of what needs to run and the time prior to artificially designated (also be random number generator). The process of running time to time-unit calculations. The state of each process can be completed W (Wait), running R (Run), or completion of F (Finish), one of three state.

最新的Windows 变形金刚，有兴趣的朋友可以下载-The latest Windows Transformers, interested friends can download the try. .

visaual c++ MFC查看系统信息的源代码-visaual c++ MFC view system information of the source code

一个操作系统的课程设计题目，做得不怎么样，FCFS、最短寻道时间、电梯算法。-an operating system subject to the curriculum design, done well, and the FCFS queue, the shortest tracking time, the elevator algorithm.