用VB6.0和ADO开发的一个专家信息查询管理系统，包括文本和图象管理，可以方便的改写为其他专家管理系统。...

模拟银行排队机系统，父进程负责调度，子进程负责接收顾客、打印顾客号、呼叫顾客到相应窗口和服务顾客。-Simulation Bank Queue System, the parent process is responsible for scheduling, sub-process is responsible for receiving clients, print customer number, call customer to the appropriate window and customer service.

李春葆的《数据结构教程》教学PPT及书中所有源码，很值得一看！-Li Chun-bao s Data Structure Course Teaching PPT and source book of all, it is worth a visit!

数值计算源代码，包括二分法，弦截法，龙贝格算法，下山法，牛顿迭代法-numerical source code, including the dichotomy, chord sheet, Lung Bergh algorithm, the mountain, the Newton iterative method

清华大学出版的数据结构（C++）的配套课件-Tsinghua University published the data structure (C) matching courseware

在llinux 服务器下，比较通用的oracle安装步骤和脚本，很实用的哟！

一个商业软件的源码，含数据库，图形等多种操作-A source of commercial software, including databases, graphics and other operating

数据结构最短路径-data structure Shortest Path

求解模糊等价矩阵的源代码,可以通过它来示模糊等价矩阵-Solving fuzzy equivalent matrix of the source code through it to show fuzzy equivalent matrix

本程序详细 演示了 vc如何连接数据库，对学习mysql与vc++ 有很大帮助-This procedure demonstrated in detail how to connect vc database mysql and studying vc++ has a lot to help

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① 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