一bbdd dissenyo与Java文件

TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check its leaves i n terms of algorithm as preorder. midorder or postorder.

是一小型门诊挂号软件，可帮助研究开发这方面软件者有参考价值。-is a small clinic registered software can help research and development in this regard are software reference value.

有关aql中存储过程的内容-store the contents of the course

这是在VC下本人编写的解决八皇后问题的程序 ，92种解会直接输出在C：SIGN。H文件中。是用来测试一款C编译器而写的。-This the VC I prepared by the Queen"s problem to solve eight procedures, 92 kinds of solutions will be directly output in the C : SIGN. H files. It is used to test new C compiler written.

这是一个大学录取系统，负责一所大学的录取工作asp.net使用mssql 2005后端数据库。提前欢迎

sql server 数据库结构查看程序.rar-sql server database structure viewer. Rar

马周游问题代码，走日字形的马在 一个棋盘-Ma tour problem code

题目:稀疏矩阵是指那些多数元素为0的矩阵.利用稀疏特点进行存储和计算可以大大节省存储空间,提高计算效率.实现一个能进行稀疏矩阵基本运算的运算器.基本要求:以带行逻辑连接信息的3元组顺序表表示稀疏矩阵,实现两个矩阵相加,相减和相乘的运算.矩阵的输入形式采用3元组表示,而运算结果的矩阵则以通常的阵列形式列出.概要设计:1.以带行逻辑连接信息的3元组顺序表表示稀疏矩阵2.本程序包含2个模块:(1) 各集合定义模块(2) 主程序模块-topics : sparse matrix refers to those elements for most of the matrix 0. Using sparse features storage and computation can be greatly reduced storage space and improve computational efficiency. One can achieve for sparse matrix operations basic computing device. Basic requirements : OK logical connection with the three yuan Information Group the order said the sparse matrix table to achieve two matrices together, subtract and multiply arithmetic. Matrix entry forms using three yuan Group said, and the results of the matrix operations while the usual array listed. summary of design : 1. in line with the logic of information linking the three element group said sparse chronology matrix 2. this program contains two modules : (1) Set module (2) main program module

《数据结构与算法分析+C 2B 2B+描述+第三版》答案-answer

汉诺塔演示 文本界面的-HANOR demo version of the interface