模拟分页式存储管理中硬件的地址转换和用先进先出调度算法(FIFO)处理缺页中断...

0-1背包问题 可以提供在背包方面遇到问题的学生或者有需要的人.-0-1 knapsack problem can provide a backpack problems encountered students or those who are in need.

专家抽取系统1.0 是用Delphi6.0 开发的一款用于招投标,评审过程中从专家库中抽取专家的软件。可以将抽取结果导入到Excel或Word文档中-experts Extraction System 1.0 is developed using Delphi 6.0 for one of the bidding, The accreditation process from a pool of experts from a software expert. The results can be taken into the Word or Excel document

数据结构的C++PDF文档-data structures of C PDF files

一篇基于复杂网络的城市温度序列分析的英文论文，最后得出了有意义的结论，刊登在MPLB杂志上。希望可以为研究网络及序列相关领域的同行们提供参考。-A english paper about city temperature analysis based on complex network,which is appear in MPLB.

一些常用的几何算法的C++实现,包括两点确定一条直线,两点间距离,点直线距离, 海伦公式求三角形面积,判断直线相交等-some common geometric algorithm C achieved, including two identified a straight line, the distance between two points, point straight distance Helen formula for triangle area, as judged straight intersection

本源码实现了对数据库的最基本的操作，插入，修改，添加删除等基本操作，旨在对读者掌握最基本的数据库操作-The realization of the source of the most basic database operations, insert, modify, add, delete and other basic operations, aimed at the readers grasp the most basic database operations

这是ID3决策树算法的一个示例实现

数据结构课程设计，文具店管理系统,自己写的程序，方便大家使用。-Data structure the curriculum design, stationery shop management system, its own written procedures to facilitate people to use.

成绩查询使用，是个课程设计-results for use, is a curriculum design

c++链式队列的实现头文件如下： typedef int Item; typedef struct node * PNode; typedef struct node {  Item data;  PNode next; }Node; typedef struct {  PNode front;  PNode rear;  int size; }Queue; /*构造一个空队列*/ Queue *InitQueue(); /*销毁一个队列*/ void DestroyQueue(Queue *pqueue); /*清空一个队列*/ void ClearQueue(Queue *pqueue); /*判断队列是否为空*/ int IsEmpty(Queue *pqueue); /*返回队列大小*/ int GetSize(Queue *pqueue); /*返回队头元素*/ PNode GetFront(Queue *pqueue,Item *pitem); /*返回队尾元素*/ PNode GetRear(Queue *pqueue,Item *pitem); /*将新元素入队*/ PNode EnQueue(Queue *pqueue,Item item); /*队头元素出队*/ PNode DeQueue(Queue *pqueue,Item *pitem); /*遍历队列并对各数据项调用visit函数*/ void QueueTraverse(Queue *pqueue,void (*visit)());