提供对城市信息的编辑，提供列车时刻表和飞机航班表的编辑，提供三种最优决策：最快到达、最省钱到达、最少中转次数到达。...

利用Visual C++进行对话框的各种技巧编写-The use of Visual C++ Dialog to the preparation of a variety of skills

操作系统中的哲学家就餐算法 c语言编写-OS philosopher dine algorithm c language

gerneral os development

很多的都想用自已的和序控制自己的电脑,这里有一些常用函数,希望对大家有用-Many want to use their own and the sequence to control their own computer, here are some commonly used functions, in the hope that useful to everybody

操作系统的应用计算法的实现，先进先出最高响应比-Operating system, application of the calculation method of the realization of the maximum response ratio FIFO

企业内部通讯系统必须提供网络通讯功能、在通讯过程中禁止使用聊天表情、文件传送等功能，避免资料外泄，或因发送错误而导致上级资料的丢失以及其他损失。最重要的是必须适应任何操作系统，也就是实现跨平台技术，因为企业内部的工作需要，工作环境中使用了多个操作系统来完成不同的工作。另外，系统不需要使用服务器中转和记录通讯内容，可以独立完成通讯任务，排除职工对领导监视工作进度等逆反心理-Internal communication systems to provide network communication capabilities, in the communications process of the Prohibition of the Use chat expressions, such as file transfer capabilities, to avoid leakage of information, or send an error which led to the loss of higher-level information as well as other losses. The most important thing is to be adapted to any operating system, which is cross-platform technology, as businesses need to work within the working environment in the use of a number of different operating system to complete the work. In addition, the system does not require the use of transit and records of communications servers, you can independently accomplish the communication task, remove the leadership of trade unions to monitor the progress of the work of such an antagonistic mental

使用NSSortDescriptor类对NSArray数组中的数据按照规则排序。-NSArray Class NSSortDescriptor use of the data in an array sorted in accordance with the rules.

linux0.11源代码用于研究linux操作系统-linux0.11 source code used to study the linux operating system

本项目是一款内存动态分区分配模拟程序。用户通过本程序可以了解动态分区分配方式中使用的数据结构和分配算法，加深对动态分区存储管理方式及其实现过程的理解。-The project is a dynamic partitioning of memory allocation simulation program. Users through the process can understand the dynamic partition allocation methods used in data structure and distribution of algorithms, understanding of dynamic partitioning storage management approach and its realization process of understanding.

LRU(最近最少使用算法) and MRU(最近最常使用算法)所谓的LRU(Least recently used)算法的基本概念是:当内存的剩余的可用空间不够时,缓冲区尽可能的先保留使用者最常使用的数据,换句话说就是优先清除”较不常使用的数据”,并释放其空间-LRU (least recently used algorithm) and MRU (most recently used) algorithm called LRU ( Least recently used) algorithm is the basic concept : When the memory of the remaining available space is insufficient, the first buffer as possible to retain the most common users of the data used, In other words priority is to eliminate the "more rarely use the data," and the release of its space