eVB 数据浏览器

用二分法解高阶方程的近似解。区间范围合计算精度可调，每一步的计算结果一列表的形式显示出来，一目了然-dichotomy solution with the higher-order equation approximate solution. The scope of a range accuracy adjustable every step of the calculation results in the form of a list show up clearly

用VB6创建的家庭地址簿程序。制作该程序的主要目的是用来为家庭中的每个成员存储个人地址信息。而且该程序的用户设定为两个类型级别：即1管理型、2用户型-built with VB6 family address book procedures. The production process is the main purpose for the family members of each of the addresses stored personal information. And the procedures set of users for the two types of levels : that is a management-type, two-users

常用结构源码 希望大家好好看看 很有帮助 -Common structure of source code I hope everyone a good look at helpful

要控制我的信息系统是一个非常聪明的简单的项目。你可以学习如何添加、 更新、 删除和查询与 php mysql 语言......

数据库程序，可实现数据的查询与修改，希望喜欢-database, which enables the data query and amended in the hope that like

支持并发访问的B+树-support concurrent visit the B-tree

这是一个决策树算法-This is a Decision Tree Algorithm

主要涉及ADO编程模型中的记录集。-mainly involve ADO programming model of the records set.

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The intersection of what is the set. And so on. ADT then these are the methods to achieve.