数据结构课程的实验之一，有关于数组的循环位移，简单的小程序...

ACM常用代码集合，吐血推荐。 有详细的代码注释，希望对大家有帮助-ACM commonly used code sets, hematemesis recommendation. A detailed code comments, want to help everyone

ORACLE最大的逻辑组成部分。ORACLE数据库由一个或多个表空间组成，一个表空间由一个或多个数据文件组成，但一个数据文件只能属于一个表空间。数据库表等对象是存放在表空间中的。-ORACLE The largest component of the logic. ORACLE database by one or more table space for components, a table space by one or more data files, a data file can only belong to a table space. Database tables and other objects are stored in the table space.

二叉树的VC++6.0的详细源代码实现，有测试的例子，测试通过，需要的可以下载。-Binary Tree VC++ 6.0 realize the detailed source code, there are examples of test, test passed, the needs can be downloaded.

一个文档管理的演示程序，针对凌乱的文件及其繁琐的查找问题，如何在数据库中实现全文检索。-A document management demonstration program, for the messy and tedious to find the file problem, how to achieve the full-text search in the database.

内存池，如果需要减少长时间、不断开辟小内存的程序产生的内存碎片对程序运行效率的影响，可以使用该类库；-Memory pool, if the need to reduce the time, and constantly open up a small memory memory fragmentation procedures of the process the impact of operating efficiency, you can use the class library

编写了一个关于图的操作的应用程序，可以自己手动输入图的节点和节点的关系，然后可以进行查找节点，求节点的出度和入度，求最短的路径等-Prepared a map of the operation on the application, you can manually enter their own graph of the relationship between nodes and nodes, and then can search the node, and the out-degree and node-degree, and the shortest path, etc.

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

用delphi开发的一个数据库浏览器-with the development of a database browser

资源描述以字符序列的形式从键盘输入语法正确的，不含变量的整型表达式。利用教科书（严蔚敏的C语言数据结构）表3.1给出的算符优先关系，实现对算术四则混合运算表达式的求值，并仿照教科书的例3.1演示在求值中运算符栈、运算数栈、输入字符和主要操作的变化过程。

visual c++用于数据库编程的源程序-visual c++ for database programming source code