This is a set of relatively complete applicable to the parties Hotel service sys...

很实用的程序. 用Virtual C++ 6.0做的,实现对声音的采集,处理,从而对MIC的声音进行控制的效果, 本程序是已成功测试通过.-Very useful procedure. Using Virtual C++ 6.0 to do, and realize the sound collection, treatment, thereby to control the voice of MIC results, the procedure is successfully tested.

666

代码将是des和dod AJJ；代码将是des和dod AJJS代码将是des和dod AJJS代码将是des和dod AJJS代码将是des和dod AJJS代码将是des和dod AJJS代码将是des和dod AJJS代码将是des和dod AJJS代码将是des和dod AJJS代码将是des和dod AJJS代码是des和dod ajjs代码是des和dod ajjs代码是des和dod ajjs代码是des和dod ajjs

本程序用于计算随机变量模拟仿真 已经用计算机语言写好-the procedures used to calculate the random variable simulation has been used to finish the Computer Language

这是用java实现的一个人员管理系统的例子，可以实现人员管理-This is a java implementation of the personnel management system, examples of personnel management can be achieved

数据库 SQL开发，默认 数据库 SQL开发，默认-Database SQL development, the default database SQL development, the default

图的邻接矩阵存储结构 图的优先深度遍历-Graph adjacency matrix storage structure of the priority depth traversal

Co oporate banking.is 不错的银行体系已写下 c + +.developed 由一组称为 ASN 在加纳......在 2013年 7 月中午，已投放市场

本科时参加小竞赛设计的一个代数运算器 1. 能对常用的四则运算，三角, 乘方,开方运行2. 支持变量赋值和运算 3. 增加批处理执行功能（批处理脚本文件） 4. 增加对向量或矩阵运算的支持，如输入 -Undergraduate to participate in the design a little contest an algebraic calculator. Can commonly used four arithmetic, trigonometry, involution, prescribing run 2. Supports variable assignments and operations 3. Increase the batch executive function (a batch script file) 4. increase support for vector or matrix operations, such as the input

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.