统计字符出现的频率的哈夫曼编码

用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

本程序是一个了聊天工具  用mfc编写  可以多人同时聊天，用tcp协议编写                     

设有由n个不相同的整数组成的数列，记为: a(1)、a(2)、……、a(n)且a(i)a(j) (ij) 例如3，18，7，14，10，12，23，41，16，24。 若存在i1

数据结构典型算法实现，c实现二叉树的遍历以及赫夫曼编码-data structure typical algorithm, c achieve the traversal of a binary tree Huffman coding

本文一方面以实例的形式介绍产生数据封锁的各类情况，另一方面从数据库理论的角度加以分析，以期使读者既知其然，更知其所以然，使读者能够更加深入地理解Oracle的数据封锁机制，而不是简单地记住某些结论。-In this paper, on the one hand, to produce the form of examples of the types of data on the situation of the blockade, on the other hand, the theoretical point of view from the database to be analyzed in order to make the reader not only know-and know所以然, so that readers can be more in-depth understanding of Oracle data blockade mechanism, rather than simply to remember some of the conclusions.

一种基于二维链表的稀疏矩阵模半板类设计 A template Class of sparse matrix. Key technology: bin,2-m linked matrix. constructors: 1.normal constuctor 2.copy constuctor. 3.assignment constructor. Basic operator: 1. addition(sub) of two matrix 2. inverse of a matrix. 3. multiply of two matrix. etc.-based on two-dimensional chain of sparse matrix model semi-plate design of Class A"s template parse matrix. Key technology : bin. 2-m linked matrix. constructors : 1.normal constuctor 2.copy constuctor. 3.ass ignment constructor. Basic operator : 1. addition (sub) 2 matrix of two. inverse of a ma trix. 3. multiply of two matrix. etc

链表与数组的数据交换 数据结构的实验基本内容 讲数组中的数存进链表-chain with an array of data exchange data structure of the basic contents of the array of speakers for storing Chain

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分，并分析算法的计算复杂度。-in a circle around the playground are placed n gravel pile. Is a stone should order to be merged into a heap. Stipulated that only elected adjacent to the pile of gravel into the new heap, and a new pile of gravel credited for the combined scores. Design a test algorithm to calculate n heap into a pile of gravel to the minimum score and the biggest score and analysis of algorithm complexity.

数据结构的第二个实验-data structure to the second experiment

库存管理系统（IMS）是数据库软件，它使用的PowerBuilder10.5开发IMS的功能如下： - 1.拉手主项数据2.多个专卖店3.处理好厂商和客户主数据4.控制transactionsfor例如接受者在商店和问题，从门店的库存5.有很多reportscovers所有交易