数据库管理系统，是一个管理学生学籍的

Town是一个100% 纯Java API，它位于JDBC API的顶部。这个API的目的是简化和一个JDBC兼容的关系数据库的交互。通过使用Town,可以执行和管理select/insert/update/delete　SQL语句，而不用真正写一行SQL。Town也可以使用任何JDBC连接字符串和内部连接池。-Town is 100% pure Java API, it is located JDBC API the crown. This API goal is the simplification and a JDBC compatible relational database interactive. Through uses Town, may carry out and manage select/insert/update/delete the SQL sentence, but does not need truly to write line of SQL. Town also may use any JDBC to connect the character string and internal connection pond.

kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process.

数值计算源代码来自哈尔滨工业大学计算机学院-numerical source code from the Harbin Industrial University computer science

这个项目是由帐户管理系统组成。雇员的数据给数据库。usernme 和密码用于开放系统。

ADO 数据库操作

我做的DBMS系统模拟DBMS，里面有鼠标还没有做完-DBMS system simulation DBMS, and they have not done mouse

源树b，b树结构，删除，插入，相当于搜索，搜索功能的范围

由于简单模式匹配算法在一次字符比较失败后，简单的把模式串位置向前移动一个字符位置，这样就丢掉了前面字符匹配中得到的信息，效率差。所以就需要一种无回溯的算法来提高效率，这里使用KMP（Knuth-Morris-Pratt）算法。模式串前面的连续片断部分称“前缀模式”，前缀模式在模式串后部重复出现的情况可以用来避免重复进行已经做过的检查，这是KMP算法中的一个重要概念。-as simple pattern-matching algorithm to compare a character failure, a simple model put forward position Series mobile location of a character, would be lost in front of characters matching the information inefficiently. There is a need for a non-backtracking algorithms to improve efficiency, the use of KMP here (Knuth-Morris-Pratt) algorithm. Model Series in front of a row clips part said "prefix model," prefix string pattern in the pattern of recurring back can be used to avoid duplication of inspection has been done, KMP algorithm is an important concept.

给予B/S模式在线选课系统1. 用ASP/JSP+SQL Sever实现 2. 写出详细的需求分析 3. SQL代码、网页代码+截图-Given the B/S model online courses system in the ASP/JSP+ SQL Sever 2 write detailed requirements analysis 3 the SQL code, web page code+ screenshots

关于货箱装船问题的贪婪算法，只是简要描述-Container ship on the issue of greedy algorithm, only a brief description of