err

成绩查询系统，实现系统的登录、选课、成绩查询等功能。-Inquiry System performance to achieve the system registry, selection, features such as query results.

深度优先搜索求迷宫问题 采用深度优先搜索的方法求解迷宫问题，方便快捷-Depth-first search order to the maze problem using depth-first search method for solving a maze problem, convenient and quick

企业事务管理系统-Enterprise Management System

本程序用于数据的折半查找,是折半查找的基本算法-the procedures for the binary search data is the basic binary search algorithm

与清华大学版的《数据结构》匹配二叉树的实现：BITREE1.CPP：为主程序，其中实现了递归算法以及非递归算法的前序遍历，中序遍历，后序遍历。TSTACK1.H: 为头文件，其中定义了一些常量的值，其中也包括了书中第三章的栈的实现，只需要将注解符去掉即可。运行环境为：VC++6 或 TC3-and Tsinghua University version of the "data structure" matching the achievement of a binary tree : BITREE1.CPP : mainly procedures, which achieved a recursive and non- recursive algorithm of algorithms preorder, preorder, after preorder. TSTACK1.H : for the first document, which defines a number of the value of a constant, which also include a third chapter of the book stack the realization simply have the website notes can be removed. Operating environment : VC 6 or TC3

学生成绩管理系统实现学生成绩的查询，修改，删除等-Student achievement management system to achieve student performance of the query, modify, delete, etc.

这是一个用于计算最小生成树的程序。当人们逐个输入每条边的权，再点击生成，便能得到这个图的最小生成树。-This is a used to calculate the minimum spanning tree procedure. When people enter one by one each side of the right, then click generate, will be able to get this graph minimum spanning tree.

这是VFP的指导思想书籍，主要说明了开发软件时怎么样才做到界面与数据分离，从而在日后的维护中带来便利-This is the guiding ideology of books, mainly, the development of the software how to achieve just like interface and data separation, in order to safeguard the future brings convenience

二叉树是数据结构的重中之重，进一步认识二叉树的查询技巧-Binary tree data structure is the most important, a better understanding of tree query skills

jsp连接数据库大全，sqlserver数据库，mysql数据库，Oracle数据库，DB2数据库，Informix数据库，Sybase数据库，PostgreSQL数据库 -jsp connectivity database Guinness！！