一个简单的公交查询管理系统，采用最短路算法，使用ODBC…

本程序是计算三角网闭合差的程序,包括建表,数据库数据输入等完整过程-This procedure is the calculation of triangulation poor closure procedures, including built form, the database integrity of the process of data entry, etc.

一些数据库的实例。共12章。如第八章： 第8章数据库环境的建立 1. 用MISDBA用户登录MISDB数据库。 2. 在ISQL中，输入第8章提供的SQL语句；或者根据表8-1至表8-4在SQL Explorer中自行创建数据表。 3. 根据表8-5至表8-7设置初始数据，另外需要在PERSON数据表中设置一个具有培训管理系统管理权限的用户（ID=’PXC’，PASSWD=’PASSWORD’，AUTHORITY=’6’，STATE=’F’）和用于外派培训的用户（ID=’PXCOUT’，NAME=’外派培训’）。 4. 修改Admin源程序中的数据库连接属性，并且重新编译training.exe。 5. 修改Client源程序中数据库连接属性，并且重新生成html文件和cab文件，然后将这两个文件拷贝到web服务器指定目录中。-some examples of the database. A total of 12 chapters. If the eighth chapter : Chapter 8 database to establish an environment. User login with MISDBA MISDB database. 2. In ISQL, the importation of Chapter 8 of SQL; Or, according to Table to Table 8-1 8-4 in SQL Explorer to create data sheets. 3. According to Table 8-5 8-7 to set up tables initial data, Another need PERSON data tables set up with a training management system for the management competence of the users (ID = "P XC ", PASSWD =" PASSWORD "AUTHORITY ="6", STATE = "F") for assignment and training of users (ID = "PXCO

sqlite包下载并使用sqlite的完整说明，并附在wince通讯录下的示例源代码。

考勤管理系统的开发目的是电脑的传统方式平时都出席。为开发这一软件的另一个目的是生成自动在末尾的会话或在报告之间的会话

p2pdbanywhere 可以通过之udp方式远程连接数据库的组件,这个组件非常好,是Delphi7,9,2006能够使用,包含源码.-p2pdbanywhere adoption udp can approach the remote database connectivity components, this component was very good Delphi7, 9,2006 to use, contains source.

数据结构源代码,c数据结构是计算机存储、组织数据的方式。数据结构是指相互之间存在一种或多种特定关系的数据元素的集合。通常情况下，精心选择的数据结构可以带来更高的运行或者存储效率。数据结构往往同高效的检索算法和索引技术有关。

一个精彩的奥运会成绩统计系统，可以统计金牌榜，总分榜，包含精彩的VFP界面，即时迅速统计各个国家的金牌及奖牌总数的变化-one of the highlights of the Olympic Games scores system, the gold medal tally and statistics, scores charts, Highlights include the VFP interface, immediate rapidly statistics in various countries gold and total medals changes

IBM Lotus 123 操作程序例子-IBM Lotus 123 examples of procedures

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

SQL Server 2000编程员指南-SQL Server 2000 Programming Guide