易语言开发的，可以导入excel格式文件到指定数据库的student表中，并进行同名检查，再自动编号...

这是关于01背包问题的动态规划算法。采用C++语言完成的，代码间有注释。-This is about 01 knapsack problem dynamic programming algorithm. Using C++ language completed, there are comments between the code.

含并、交和差运算的集合类型试验报告，这个报告是做计算机试验的标准样式，分为了7个模块。-containing, intersection and poor computing pool type test report, the report is made to the standard computer test pattern, divided into seven modules.

一个通讯录程序 ,用编C++编的-a correspondence program, Part C series

一个特别好用得VC做数据库得控件,能实现和EXECLE 一样得功能-a particularly handy in the VC done in the database control, and can achieve as a function EXECLE

一些二叉树的功能，包括二叉树的创建，遍历，以及二叉树的深度和叶子数量的统计

问题描述：设有11种不问的钱币各若干张，可用这II种钱币产生许多不同的面值。试 设计一个算法，计算给定的某个面值，能有多少种不同的产生方法。例如有1分3张，2分 3张，5分1张，则能组成7分面值的方法有：3个1分+2个2分，1个1分十3个2分，2 个1分+1个5分，1个2分+1个5分共四种。 ^编程任务：对于给定的II种不同钱币，编程计算某个给定面值能有多少种不同的产生 方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.

插入运算符算法，123456789=a，在等式左边的任意两个数字之间插入 + - *使得等式成立，列出满足条件的所有结果-Insert operator algorithm, 123456789 = a, the left side of the equation inserted between any two figures+-* Make the equation set up, listing all of the results meet the conditions

这是开发的客户关系管理系统，有源代码和发布版本版-This is the development of customer relationship management systems, and active code releases version

应用背景学生在线注册项目。包括删除学生记录，更新，查看和搜索关键技术项目包括…1.view记录2.delete记录3.update记录和4。搜索特定的学生证记录

SQL Server、Oracle、Sybase、ODBC的JDBC驱动文件，全部测试过-SQL Server, Oracle, Sybase, and ODBC JDBC driver, all tested