我上课用的计算机算法设计与分析的电子教案，内容包括了最基本的分治法，贪心法，动态规划法，...

学生成绩信息管理系统的源代码及运算结果和分析-Student performance information management system" s source code and the calculation results and analysis

求出任意两个序列的最长公共子序列,使用了动态规划的方法-Obtained the longest sequence of any two common sub-sequences, the use of dynamic programming methods

用ODBC对数据库实现连接 显示数据 修改数据-Using ODBC to connect to the database display data modification of data

用VFP编的电脑查询系统,比较简单,适合初学者参考.-with VFP addendum to the computer search system, a relatively simple reference for beginners.

这份是数据结构的一些资料，里面内容相对比较简单，但却非常值得一看～-This is some of the information data structure, which content is relatively simple, but very much worth a visit ~

数据结构实验报告-experimental data structure report

我写的那算法只是原理，要实用必须实现一个大整数类（用c++，我的算法是C的)。欢迎和我联系讨论-I wrote that the only algorithm principle, to be practical realization of such a large integers (with c, I C algorithms). And I welcome the discussion link

是我应我们学校学工部做的软件,其主要是解决想我们学校这样的条件--各个办公室之间还没有建立联网,而且学校分为两个校区（又不在一个城市). 　　因此，学工部每年的学分登记工作都很麻烦．每学年初，学工部要把当年发布的学分评测规定发到各系，学年末又要把从系里面提交的学分表收齐,然后手工登记,非常的麻烦.有时是系里面的学分报表太乱，有些资料丢失，要么是，系里面把各年的学分评测规定弄混，经常搞的他们一头雾水，于是为他们就请我做这个系统. 　　这个系统的工作流程是，每个学年初，学工部输入当年的学分评定规定，然后到处成为学分评测数据，然后Copy给各个系，各个系在每个学年中，输入新的专业，年级，班级和新生的资料，然后登记学分评测的纪录和考试的成绩．当学年末到了，各系把党学年的数据导成数据库，然后copy给学工部，学工部就可以用电脑纪录所有的学分纪录． -should I do our school among a software, it is our resolve to schools such conditions-- every office has not yet been established between the network and the school is divided into two campuses (not in a city). Therefore, each of the credit among a registration work very troublesome. Every beginning of the school year, among a year should release the credit evaluation of the provisions of the various faculties, should also learn from the end line inside the table collected credits, and then manual registration, very troublesome. Sometimes there is too much of the credit chaos statements, some of the inform

一个很简单的java web系统的需求分析及数据库设计-A very simple java web systems analysis and database design

数据结构中关于图的遍历，任意建节点，深度优先和广度优先两种方法-data structure on the map traverse, arbitrary nodes built, the depth and breadth of priority priority two methods