很实用的程序. 用Virtual C++ 6.0做的,实现对声音的采集,处理,从而对MIC的声音进行控制的效果, 本程序是已成功测试通过....

用c语言设计实现一个用事件驱动的“救护车调度”离散模型，模拟120急救中心响应每个病人的呼救信号统一调度救护车运行的情况。 我们对问题作适当简化，假设：某城市共有m个可能的呼救点(居民小区、工厂、学校、公司、机关、单位等)，分布着n所医院(包含在m个点中)，有k辆救护车分派在各医院待命，出现呼救病人时，由急救中心统一指派救护车接送至最近的医院救治。救护车完成一次接送任务后即消毒，并回原处继续待命。假定呼救者与急救中心、急救中心与救护车之间的通讯畅通无阻，也不考虑道路交通堵塞的影响。可以用m个顶点的无向网来表示该城市的各地点和道路。时间可以分钟为单位，路段长可表示为救护车行驶化费的分钟数。 这里设m=10,n=3,k=2。并且令消毒时间为２分钟-language used to achieve a design using event-driven "ambulance dispatch" dispersion model to simulate 120 emergency response center each patient"s distress signal unified dispatching ambulances running. We issue the appropriate simplified assumptions : m in a certain city a total of 000 points possible hue (residential quarters, factories, schools, companies, organizations, units, etc.), distributed by the hospital n (m included in the points), k ambulances were deployed in the various hospitals on standby there cries of the patients, from the first-aid center unified ambulance escort assigned to the nearest hospital for treatment. Ambulance completed

数据字典的说明,对数据库设计有极大的帮助-Data dictionary description of the database design a great help to

图函数，实现插入，删除，保存，恢复等功能-Map function, the realization of insert, delete, save and restore functions

排课表，对于给定的课程及其先序关系，给出所需学期数最少的排法。-Course Scheduling table, for a given sequence of courses and their relationship first, given at least the required number of semester scheduling method.

Jsp考试系统 -Jsp Examination System

本程序用于数据的折半查找,是折半查找的基本算法-the procedures for the binary search data is the basic binary search algorithm

数据结构的基本操作：顺序队列的初始化、销毁、入队、出队基本操作的实现-The basic operation of the data structure: the order of the queue initialization, destruction, into the team, out of the realization of basic operations team

一个程序而已，不过看看也有好处-a procedure adopted, but it is also good to see

简介：一个用PHP编写的，可以通过互联网控制和操作MySQL，通过phpMyAdmin可以完全对数据库进行操作，例如建立、复制、删除、导出、导入数据等。 -Introduction: A prepared using PHP, you can control and operation via the Internet MySQL, can be completely through the phpMyAdmin database operations, such as the establishment, copy, delete, export, import data.

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of