是关于数据库备份方面的

本书是作者编程经验的结晶，由发表在杂志上的专栏文章构成，每一章内容相对独立，但都是编程过程中的有机组成部分。本书内容包括问题定义、算法、数据结构、程序验证与测试、程序优化与效率问题，以及这些技巧在排序、查找和字符串处理等方面的几个实际应用。本书每章末尾都附带有相关内容的问题，附录中给出了一些问题的提示和解答。仔细思考问题或与同事进行讨论，可以巩固所学知识，将作者的经验应用到自己的编程实践中。-This book is the author of the crystallization of programming experience, published in the journal by the column consists of the contents of each chapter is relatively independent, but they are in the process of programming an integral part. The book includes problem definition, algorithms, data structures, program verification and testing, process optimization and efficiency issues, as well as these skills in sorting, string search and deal with several aspects of practical application. The book comes at the end of each chapter has relevant content issues, the appendix gives some tips and answers to the problem. Think carefully about questions or discussion with colleagues, you can consolidate the knowledge acquired will be applied to the author

Flexible Vector and Matrix Classes enable to use vectors and matrixes with arbitrary bounds. Content. 1. Algorithm 2. Classes 3. Program Files 4. Tests 5. Compiling 6. Running (Log File) 7. Download

使用c#编写的ftp上传、下载文件程序，基于c/s架构开发的简单上传、下载程序，内部封装了ftp操作的类，包括通过ftp协议对文件的读取、写入等，便于学习。

离散事件模拟程序，以及自定义数据类型的队列实现-Discrete event simulation program, as well as custom data types of queues to achieve

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

接下来POW2发现两个大于或等于下一个功率的指数窗口长度（CEIL（LOG2（米））），和POW2计算的功率。使用的两个用于变换长度功率优化FFT算法，虽然在实践通常有使用N = M的执行时间相差不大。为了显现在DFT，情节ofabs（Y），ABS（Y）。^ 2，andlog（ABS（Y））都常见。功率与频率的情节被称为周期图：

多项式的计算器，可以用来加减乘除各类多项式并得出正确结果-Polynomial calculator can be used all kinds of polynomial addition and subtraction multiplication and division and reached a correct result

MyDB 是一个小型、 快速、查询方便的桌面数据库。 适用于Visual C++、Visual Basic、Delphi等开发者。 只有一个DLL（188KB），所有数据以自己的格式存 在一个普通文件中，无需Dao、Ado、BDE等支持。 也无须任何安装和设置。特别适合开发那些数据量 不是很大，无需复杂查询，又不想安装Dao等一大堆 DLL，OCX的绿色软件。而且数据安全性好， 无法轻易打开！-MyDB is a small, fast and convenient desktop database query. Applies to Visual C++, Visual Basic, Delphi and other developers. There is only one DLL (188KB), all data in their own format, there is a general document, without Dao, Ado, BDE and other support. Also without any installation and settings. Particularly suitable for the development of those who is not a big amount of data without the complexity of inquiries, but also do not want to install a lot of Dao, such as DLL, OCX green software. And data security, and can not be easily opened!

这是数据结构算法中的队列的实现源码。用C++开发。-This is a data structure algorithms realize the source of the queue. With C++ Development.

拖动开发代码，关于pb 的-Drag code on the pb