VB为前台，SQL_SERVER为后台的关于宾馆的数据库编程

回溯算法迷宫问题-VB代码是回溯算法非常经典的例子。可以做游戏做简单的参考

教职工信息管理系统-staff of the Information Management System

这是一个分治解决的零件切割问题:给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？加上一个小界面-This is a solution to the partition cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut out n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? A small interface

一个演示如何根据数据库动态建立访问数据库的DSN程序。-a demonstration of how dynamic database access to the database to establish procedures for the DSN.

凌阳SPMC65bcscV1使用指南-Sunplus SPMC65bcscV1 Guide---------------

Visual+C+++6.0数据库开发技术与工程实践（下），共7个实例，有源代码，使用前看光盘使用说明-Visual+ C+++6.0 database development Technology and Engineering Practice (below), a total of seven instances, active code, CD-ROM read instructions before use

通过面向对象的对象-关系映射持久化技术，将一对多以及多对多的数据保存到数据库中并提供查询修改等功能。-Through Object-Oriented Object- Relational Mapping Persistence technology, one-to-many and many-to-many data is saved to the database and to provide features such as query modification.

该程序完成对二叉树的非递归的前序遍历，在三种遍历方法中，这种遍历最简单，所以，核心代码自然要少很多。-completion of the process of non- recursive binary tree of the former preorder, the three traverse method, which traverse the most simple, so natural to the core code is much less.

利用Fortran 90 接口读取已经创建的nc文件，并且检验其读写是否正确-The use of Fortran 90 interface to read nc file has been created, and test its read and write correctly

/*数字三角形问题 问题描述： 给定一个由n行数字组成的数字三角形如下图所示。试设计一个算法,计算出从三角形的顶至底的一条路径,使该路径经过的数字总和最大。 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 编程任务： 对于给定的由n行数字组成的数字三角形,编程计算从三角形的顶至底的路径经过的数字和的最大值-/* Digital triangle Issue Description : given an OK by the number n of triangular figures shown in the diagram below. Design of a test algorithm, calculated from the top of the triangle to the end of a path, the path through the largest sum of the figures. 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 programming tasks : for a given n line by the number of digits triangle, triangle programming calculated from the top to the bottom of the path through the figures and the maximum