twoservicedemo

说明：  通信原理实验指导书,包括全部通信原理章节,原理分析,硬件解释,编程指导等(The communication principle experiment instruction book, including all the communication principle chapter, the principle analysis, the hardware explanation, the programming instruction and so on)

电位移控制台介绍和详细说明介绍了各种型号和实验(The electric displacement console and detailed description of the various models and experimental)

集合的运算：交、并、补（难度系数：1.1） 全集：大写字母 ‘A’~’Z’ 要求实现以下功能： 1、集合的输入：自动去掉重复和非法的字符 2、集合的显示：输出集合的全部元素 3、输出一个给定集合的补集 4、输出两个给定集合的交集和并集 (jiao bing bu)

队列的顺序定义，队列的调用算法等，队列的模板类及其实现(Defined in the order queue, queue calls algorithm, queue template class and its implementation)

能实现增加，搜索，删除，计数的学生通讯录（本科C++课程设计）(To achieve increase, search, delete, count the student address book (undergraduate C++ curriculum design))

惯导系统轨迹生成器，能生成不同位置转动和舰船摇摆条件下的陀螺和加速度计数据，用于研究惯导系统(INS trajectory generator can generate different locations and ships swing conditions rotating gyroscope and accelerometer data, inertial navigation systems for research)

用来仿真直流无刷电机控制系统，该系统运行良好，修改参数可以模拟任意电机的运行(used for simulation brushless DC motor control system, which is operating well, Parameter changes can simulate the operation of any motor)

this is the library to compress and decompress any file. I found it on Net

设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)

集合的运算：交、并、补（难度系数：1.1） 全集：大写字母 ‘A’~’Z’ 要求实现以下功能： 1、集合的输入：自动去掉重复和非法的字符 2、集合的显示：输出集合的全部元素 3、输出一个给定集合的补集 4、输出两个给定集合的交集和并集 (jiao bing bu)