学校图书预定系统 之 数据库设计

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

北京邮电大学软件工程研究生的课程---数据库设计开发-0-1.1.ppt ... 北京邮电大学软件工程研究生的课程---数据库设计开发-5.2.ppt-Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-0-1.1.ppt ... Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-5.2.ppt

用ADO 动态连接各种异构数据库查询数据生成sql插入insert语句。-ADO dynamic link with various heterogeneous database query data generation insert insert sql statement.

程序以图形的形式对各种排序的效率进行对比，是学习排序算法的很好的工具-procedures to graphics in the form of various sort of efficiency compared learning algorithm is a good tool

hanoi

在本机票预定系统项目的前一阶段，也就是概要设计阶段中，已经将系统用户对本系统的子模块功能做了详细的阐述，这些模块功能具体设计将在本报告中详尽得以叙述及阐明。 本阶段已在系统的概要设计的基础上，对机票预定系统做详细设计。主要解决了实现该系统程序模块具体设计问题。包括确定算法，数据结构，模块接口的使用，数据库的动态操作以及界面设计等。在以下的概要设计报告中将对在本阶段中对系统所做的所有详细设计进行详细的说明。 -In the ticket reservation system project in the previous phase, which is a summary of the design phase, the system user has a subset of the system modules have done a detailed, specific design features of these modules will be detailed in this report can be described and explained . This phase of the outline design of system based on air ticket reservation system do the detailed design. The main solution to the achievement of specific program modules of the system design issues. Including the identification of algorithms, data structure, the use of module interfaces, databases, dynamic operation, as well as interface design. In the following report will outline the design at this stage of the system has done all the detailed design detail.

powerbiulder

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

经典一百道程序，包括数据结构和相关算法，对初学者非常有帮助的-Classic 100 procedures, including data structures and related algorithms, for the very helpful for beginners

本系统为VB开发的通信软件-VB of the system for the development of communications software