先验频繁项集挖掘

  SQLite是一个开源的跨平台的轻型数据库，WINCE本身也有一个自带的数据库SQLCE ，但占用的资源会比较大。最近项目中考虑用到 SQLite，因此特别研究了一下，下面介绍一下具体的移植方法。   去SQLite官网http://www.sqlite.org/download.htm下载最新的source code。我下载的是sqlite-amalgamation-3071401.zip。解压后会得得到四个文件（shell.c、s

作业练习题 你们-workbooks that you s

asp仓库管理系统，很实用的一个系统，功能都能实现！采用access数据库，简单适用-asp warehouse management system, a system is very practical, functional can realize! Using access database, a simple application of

extremeDB s sample code,useful for you-extremeDB"s sample code, useful for you! !

介绍了如何用VC存取数据库中的大对象的方法-on how to use the VC database access, a large object method

C++面试试题，值得一看-C interview questions, the eye-catcher

黑白棋(othello)示例算法,TC实现,提供交互界面功能-reversi (othello) algorithm for example, TC achieved, providing interface function

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t

一个c语言开发的小型的dbms系统，支持造表查询，删除等一些简单的操作-a small development of DBMS systems to support table made inquiries, delete some simple operation

算法分析，此教程介绍一些常用的算法，比如回溯法，-failed to translate