dq_ii

串口测试程序 (Test porgram for serial)

仿照TCP协议的UDP封装,用ACK，和滑动窗口(Modeled on the TCP protocol UDP encapsulation, with ACK, and sliding window)

这个源码是运用ado方式连接数据库的例子其中实现方式是利用ado类中的方法。运用C++实现(Examples of this source is to use ADO to connect to the database using C++ achieve)

使用C#语言编写程序，读取并显示给定的摄影图像。把图像数据读取到变量或数组中。 (Use C# language programming, read and display a given photographic images. The read image data into a variable or array.)

一个在VC6里运用SQL语言，通过DAO方法访问ACCESS文件的vc工程。实现的功能有：创建MDB文件，新建、删除表单，对某表添加、删除、插入、修改记录。(A vc Project by sql language by DAO. It can create mdb file,or create a new tab,delete a tab,also add,delete ,insert collcetion in a certain tab. )

本程序是一个获取windows系统的Version的C++程序(This program is a Get the windows system Version C++ program)

设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)

使用多媒体定时器，VC++精选编程学习源码，很好的参考资料。(Using multimedia timer, VC++ select learning programming source code, a good reference.)

通过MFC的操作进行图形的操作,可以让进行简单图形绘制(through MFC to realise some functions)

磁盘是高速、大容量、旋转型、可直接存取的存储设备。它作为计算机系统的辅助存储器，担负着繁重的输入输出工作，在现代计算机系统中往往同时会有若干个要求访问磁盘的输入输出要求。系统可采用一种策略，尽可能按最佳次序执行访问磁盘的请求。由于磁盘访问时间主要受寻道时间T的影响，为此需要采用合适的寻道算法，以降低寻道时间。本实验要求学生模拟设计一个磁盘调度程序，观察调度程序的动态运行过程。通过实验让学生理解和掌握磁盘调度的职能。(Disk is the high-speed, large capacity, rotating, direct access storage device. As a secondary computer system memory, to carry out heavy work input and output in modern computer systems often also have a number of requests to access the disk input and output requirements. System can use a strategy, as far as possible the best order of implementation of the disk access requests. As the disk access time is mainly affected by the impact of seek time T, which requires use of appropriate seeking algorithms to reduce the seek time. This experiment requires students to design a disk scheduling simulation program, observe the dynamic process scheduler. Experiments for students to understand and grasp the disk scheduling functions.)