用VB与ACCESS数据库结合编写的远程数据传输程序

教职工信息管理系统-staff of the Information Management System

JSP+Postgre+servlet MVC架构... 网上图书馆系统原代码. CMU课程实践课程 -JSP servlet Postgre MVC framework ... online library system source code. CMU Practice courses

严蔚敏编写的《数据结构》第9章的答案，全部为源码-the answers of chapter 9 of a book called ‘Data Structures’ writen by Yan Wei Min

学习C语言时，编写的一个多项式刮号检查程序 主要用栈实现的。-C language study, prepared by a polynomial scratching, the main inspection procedures Stack realized.

演示一个寻找最短路径的算法。-find a demonstration of the shortest path algorithm.

此程序包括三部分，通讯，数据库，和界面设计。是一个常用的工业测控用的程序。-This procedure consists of three parts, communications, databases, and interface design. Is a commonly used in industrial monitoring and control proceedings.

基于c语言和数据库的小型医院管理

数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tr-data structure Balance- Bi-Tree data structure Balance- Bi-Tr ee data structure Balance- Bi-Tree data structure Balance- Bi-Tr

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

o-r mapping 实现以面向对象的方式建立对关系型数据库的映射。-o-r mapping in order to achieve the object-oriented approach to the relational database mapping.