给予B/S模式在线选课系统1. 用ASP/JSP+SQL Sever实现 2. 写出详细的需求分析 3. SQL代码、网页代码+截图...

题目:稀疏矩阵是指那些多数元素为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

DES,MD5,ZLIB算法源代码-DES, MD5, ZLIB algorithm source code

二叉树操作&图的遍历操作， 完全按照里面的文挡用VC所完成的程序， 有详细的说明-binary tree traversal operation of the plan operations, in full accordance with the text inside the block with VC performed by the procedure is described in detail in

制定这个项目是为了保持记录和有关训练的详情和布局单元格的一所大学。

数据备份与恢复源码,给需要的一个参考,可以直接运行-Data backup and recovery source, a reference to the need, you can directly run

prim算法的原理利用 prim算法构造最小生成树。有机的应用prim和数组存储生成树。-prim algorithm using the principle of Minimum Spanning Tree Algorithm prim. Application of organic prim and storage arrays spanning tree.

投票问卷管理系统 V1.2.rar-vote questionnaire management system V1.2.rar

这是数据结构中约瑟夫环问题！-This is the data structure Josephus problem!

平分算法来查找任何方程的多个根元素。它以输入的任何命令的多项式，给你的多项式的全部根。

oracle9i错误号查询-wrong inquiry