关于：

SSD9课程的exercise的最终版本源代码，包括数据库的脚本文件-SSD9 the final version of the exercise program source code, including database script files

快速报告3之后安装FastReport®是一个附加组件，它允许您的应用程序快速有效地产生报表。 FastReport®提供了所有必要的发展报告，其中包括一个可视化的报表设计器，报告的核心，和预览窗口的工具。

图函数，实现插入，删除，保存，恢复等功能-Map function, the realization of insert, delete, save and restore functions

这是我制的，调试过，小意思别见笑可以将输入的两字符串进行比较相等返回0，不等时返回两字符串的差值-This is my system, and the debugging that other small token of kindly feelings can be a laughing stock of the two input strings equal to 0 comparison, the returns ranging from two strings of the margin

二叉树操作源代码，以及关键源代码的注解说明-Operation of the source code tree, as well as the key to the source code annotation Help

宾馆管理系统的数据库的报告,比较详细的内容,还是比较好的-Hotel management system, database, report, compare it in detail, it is quite good

导入java.util.Scanner文件； ；类AddNumbers{公共静态void main（字符串args[]）{int x，y，z；

一个有趣的算法。。。十分有趣-an interesting algorithm. . . Very interesting

数据结构基本算法实现 用C++实现理发馆防真功能-basic data structure algorithm in C-achieving barber"s shop really function

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri