用VB开发的一个学生管理系统，有基本的添加、修改、查询、删除的功能，还可以把这个系统安装...

自己编的一个链表类。我自己经常用来管理内存的释放。还有两个字段用户可以自定义使用。-A calss, used to manage the data

操作Ado，得到数据信息，包括表信息、字段信息-Get Database infomation , about Table or Fields.

学籍管理系统源程序-expulsion source management system

很好的数据结构学习软件。有C语言和Pascal语言两种形式。-good data structure learning software. C language and Pascal language in two forms.

关于货箱装船问题的贪婪算法，只是简要描述-Container ship on the issue of greedy algorithm, only a brief description of

这是一个有序链表的生成和插入的源码。用C++实现。-This is an orderly list of the generation and insertion of the source. With C++ Realize.

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

页式管理缺页中断优化FIFO LRU OPT.rar 三种算法-Page-style management page fault FIFO LRU OPT.rar three kinds of optimization algorithms

用delphi编写的针对商品房销售合同格式，设计的套打程序。-with delphi prepared against real estate sales contract format, the piling design process.

实现KMP算法。 经典的模式搜索算法。-KMP algorithm realization. Classical algorithms.