讲述的是分布式数据库的基本概念和原理,适于初学者了解什么是分布式数据库...

采用链式存储结构设计广义表,实现以下操作:创建广义表,取广义表的表头元素和表尾元素 求广义表的深度-Chain store use of the structural design of the generalized form, realize the following: create a generalized form, check the generalized table header elements and table elements for the end of the depth of the generalized form

清华大学的数据结构讲座，经典书籍，作为复习笔记，都可以

要求：在国际象棋的棋盘摆上8个皇后，使得任何两个皇后不在一行，不在一列，同时也不在同一条斜线上。要求找出所有解。 算法思想 利用回溯算法搜索解空间，解分量的值等于解空间的索引（行编号），求出一个解递归调用即可求出所有92种情况。 设计心得： 1、  请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

这是一个基于COM的数据库访问技术，采用 OLE_DB来封装，高速访问各种数据库接口， 比ADO ODBC_API速度更快，效率更高。强烈 推荐- This based on the COM database visit technology, uses OLE_DB to seal, high speed visits each kind of database interface, compared to ADO ODBC_API speed quicker, the efficiency is higher. Intensely recommends

智能仓库管理系统-intelligent warehouse management system

本程序包实现了各种内排序功能，可以作为头文件库使用，封装好，强度大-the package to achieve a ranking within the various functions, as can the use of the header files, Packaging, and intensity

.Net显示了友好的人机界面，以及非常少量的原代码就能够完成所要的功能-. Net shows the friendly human-machine interface, as well as a very small amount of the original code to be able to complete the function of

一个二叉树的三叉链表运用实例，求出叶子的结点并输出从根结点到该叶子结点的路径!-a binary tree using the trigeminal Chain example, the leaves are obtained and the output node from the Root of leaf nodes in the path!

三种排序方法的动态演示，可以同时开启多个线程，同时用不同的方法进行排序，直观的判断不同算法的排序效率。-three sequencing method of dynamic presentations, it also opened a number of threads, in addition to the use of different methods for sequencing, intuitive judgment different sorting algorithms efficiency.

将马随即放在国际象棋的8×8棋盘Board[8][8]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1,2,……,64依次填入一个8×8的方阵，输出之。-Ma immediately on the international chess 8 8 chessboard Board [8] [8] of a box, MA by the rules of chess go mobile. Requires each box only entered once traveled chessboard all 64 box. Preparation of non- recursive procedure, and seeking stepped routes, with a calculated routes, the figures 1, 2, ..., 64 were filled an 8 x 8 matrix, put it out.