这次毕业设计的内容，计算机数据库所需的翻译…

Data Structures and Algorithms with Object-Oriented Design Patterns in C# 这本书的范例代码dll自己反编译的source code http://www.brpreiss.com/books/opus6/-Data Structures and Algorithms with Objec t-Oriented Design Patterns in C# this book since dll code examples his opposition to the compiler source code http :// www.brpreiss.com/books/opus6/

一元稀疏表达式计算器 大学数据结构实验，关于线性表的实验题目，我的作品，如有问题发邮件给我-one yuan sparse expression calculator University experimental data structure on the linear scale experimental subject, my work, and if made to the mail I

B-树实现索引和快速查找-B-Tree indexing and quick search

ACM解题报告，必有有用，特别对于初学者，看是否对你有帮助-ACM problem-solving report, there must be useful, especially for beginners to see if there is help for you

vb做的，好有意思，-vb done, good interesting.

重写了微软提供SQLHelper(共用的数据库调用接口） 1把SqlHelper的connectionString做成一个全局量，统一设置数据库连接字符串 2增加了返回特定表名的DataSet的各接口。 可在项目的config文件设置数据库连接字符串 private static string connectionString = System.Configuration.ConfigurationSettings.AppSettings["ConnectionString"] 当然可以把数据库连接方法修改后直接用。-rewritten Microsoft SQLHelper (shared database Call Interface) a SqlHelper the connectionString caused an overall volume, uniform database connections increased by two strings to the specific name of the table in the DataSet interface. In the config files set database connection string private static string connectionString = System.Configuration.ConfigurationSettings.AppSettings [ "ConnectionString"] lt; !-- Application specific settings-- gt; Lt; AppSettingsgt; Lt; Add key

输入人数，输入将要分配的工作数目，输入第i人干第j项工作的经费消耗，调用处理模块BackTracking输出最优分配方案。-Enter the number, type of job distribution to the number of people do i enter the first section of the work of j-expendable funds, call processing module output BackTracking optimal distribution program.

证书考试方式 SSD7 卡耐基梅隆大学的课程谁干。 证书考试方式 SSD7 卡耐基梅隆大学的课程谁干。 证书考试方式 SSD7 卡耐基梅隆大学的课程谁干。 证书考试方式 SSD7 卡耐基梅隆大学的课程谁干。 证书考试方式 SSD7 卡耐基梅隆大学的课程谁干。 证书考试方式 SSD7 卡耐基梅隆大学的课程谁干。 证书考试方式 SSD7 卡耐基梅隆大学的课程谁干。 证书考试方式 SSD7 卡耐基梅隆大学的课程谁干。 证书考试方式 SSD7 卡耐基梅隆大学的课程谁干。

本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.

经典最短路径算法C C++ 邻接矩阵实现-Classic shortest path algorithm C C++ Realize adjacency matrix