线性表（顺序存储）结构与功能的简易实现

db2日常维护汇总-db2 routine maintenance Summary

ACCESS VBA编写的报表生成向导源代码，很不错的-ACCESS VBA statements prepared Wizard source code, very good

《algorithm of Image Processing with VC》一篇很不错的关于图像处理的论文，简明扼要地说明用VC如何进行图像处理的编程- Algorithm of Image Processing with VC a very good paper on image processing, a succinct description of how to carry out image processing VC programming

考试管理程序，属数据库管理类，直接解压后就可以使用。-examination management processes, database management is a category that can be directly extracted after use.

这个是我们大学的一个小学期作业，是完成关键路径的搜索-this is our university a primary period of operation is the completion of the Critical Path Search

首先确认您的机器上已经安装了VC6.0以上版本，要编译生成可执行文件，需打开后缀名为dsw的文件，系统会默认用VC打开，然后选择Build菜单下的Set Active Configuration选项，选择Project Configuration为Win32 Release，然后编译项目，得到可执行文件。连接数据库请参照第2章的方法，在ODBC数据源内添加Microsoft Access数据库train.mdb，并将数据源名设定为train即可实现数据库和应用程序的正常连接，程序才能正常实现数据库的访问。另外，如果用户自己编写了.chm的帮助文档只要和可执行文件放在同一个目录下就可以了。 用户要修改程序源码可以选择相应的.h和.cpp文件，本实例使用的命名规则基本是：DIALOG_***** 为管理对话框资源， *****Info为数据输入窗口资源， *****Set为结果集对应的类 -first confirmed your machine has been installed on VC6.0 versions, to build generating executable files, Suffix required to open the document called DSW, the system will default VC opened, then select Build menu under Set Active Configuration options Project Configuration options for Win32 Release. then compile the project, to be executable. Connecting to the database please refer to Chapter 2, the ODBC data source adds Microsoft Access database train.mdb. from the data source can be set to train database, and application of the normal connections, normal procedures can achieve database. In

创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose is to solve the problem of traditional values, the importation of the @ symbol, said the end of a tree-binary tree of clues to find the current node"s successor nodes, for the current node precursor nodes, China preorder

《数据库系统实现》前四章，数据库实现的经典书，介绍了很多原理性的东西。-" Database system implementation," the first four chapters, the database to achieve a classic book describes the principles of a lot of things.

先构造一个图 用邻接矩阵存储 然后用分别普利姆算法和克努斯卡尔算法构造其最小生成树-First construct a map with the adjacency matrix is stored separately plym algorithm and then construct the minimum spanning tree algorithm克努斯卡尔

数据结构中栈的经典算法――第二类背包问题，已经通过测试！-The stack data structure in the classic method- II knapsack problem, has passed the test!