自动备份服务器数据到本地机器上.可以自动和手动设置.

相对于实验一，新增了2个类。 Class Listing vector. Class Group vector. 使用到了向量。增强了大家对STL向量容器，以及实现所给的声明函数。 压缩包里面有代码，指导书，以及Apache服务器。-Prerequisites: Students should have mastered the following prerequisite skills. C++ Class Specification- Produce C++ class implementations Standard Template Library- Knowledge of the STL, particularly sequential containers and iterators Goals: This assignment is designed to reinforce your understanding and use of the STL vector container and the Standard Template Library. Outcomes: Students successfully completing this assignment would master the following outcomes. Produce C++ class implementations given class declarations

/*最大k乘积问题 问题描述: 设I是一个n位十进制整数。如果将I划分为k段，则可得到k个整数。这k个整数的乘积称为I的一个k乘积 。 试设计一个算法，对于给定的I和k，求出I的最大k乘积（n

数据结构的一种算法方式,生死游戏 的程序-data structure of an algorithm, the process of life and death game

猴子选大王，c语言，有源码，有注释，可供使用交流。-election monkey king, c language, the source code, notes, the availability of the exchange.

数据结构课程第一次实验 要求：1.基类和派生类的定义和实现（.h .cpp） 2.+ 运算符重载 3.

C语言常用算法源代码,数据结构原理实现， 对学习应用有参考价值。-C language source code commonly used algorithms and data structures to achieve the principle of learning about the application of a reference value.

这是一个用来介绍对象关系数据库管理系统，对感兴趣的朋友应该有用-This is an introduction to object-relational database management system should be useful to interested friends

运用ADO技术连接ACCESS数据库（改变连接字串就能连接SQL数据库），做了一个家庭记账管理软件！用到了读写数据，写数据，更改数据，删除数据等操作，学习数据库编程的朋友可以看看！-The use of ADO technology to connect ACCESS database (change the connection string will be able to connect SQL database), so a family of account management software! Use the read and write data, write data, change data, delete data operation, the study database programming friends can see!

二叉树遍历 包括先序遍历 中序遍历 后序遍历 求结点个数 求树的深度-Including the first order binary tree traversal traversal sequence in order to postorder traversal node number and ask for the depth of

数据挖掘（概念与技术）书上的apiori算法实现。apiori剪枝算法使用候选项集产生发现频繁项集。-Data Mining (conceptual and technical) in a book apiori algorithm. apiori pruning algorithm uses candidate item set generated frequent itemsets found.