Shi Bole @ beige book Data Structure Course part1

模拟分页式存储管理中硬件的地址转换和用先进先出调度算法(FIFO)处理缺页中断-simulation tabbed storage management hardware address translation, and the use of FIFO scheduling algorithm (FIFO) interrupt handling missing pages

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

用C++写的矩阵鞍点求法-C wrote saddle point Matrix Method

医药销售管理系统 1）基本要求： （1）分析各系统的需求； （2）选用DBMS和设计工具； （3）提出系统的设计方案； （4）对所设计的数据库系统进行调试。 -Pharmaceutical Sales Management System 1) Basic requirements: (1) to analyze the needs of each system (2) selection of DBMS and design tools (3) for the system design (4) database system designed for debugging.

数据结构的稀疏距阵的实现-data sparse matrix structure of the realization

近期学习中的采购管理系统，数据库操作 -Recent study of the procurement management system ado sql

este archivo permite la creacion de formularios de forma dinamica, ademas obtener su valor y gurdarlo en una base de datos

一个学籍管理系统，挺好用的！-an expulsion management system, the very good!

北大ACM1005(I Think I Need a Houseboat)-North ACM1005 (I Think I Need a Houseboat)

我写的数据结构小程序是关于排序算法的，功能比较全-I write the data structure of small programs algorithm, the entire comparison function