动态装载WDM驱动程序,包含DEMO工程,用vc6.0编译通过.

串口开发工具串口开发工具串口开发工具串口开发工具串口开发工具

一个算法，实现如下功能：输入一个整数，输出该整数的二进制表示形式中1的个数。-An algorithm to achieve the following functions: enter an integer, the output of the binary integer that forms one of the number.

adc tlc 5510,好用可以准确的实行其功能-good， very good

在Windows下对端口编程是受保护的，而对任意物理地址的操作更是几乎很难办到，此程序则提供了上述操作。-the port of Windows programming is protected, and for any physical address of operation is hardly possible that this procedure will provide the above operations.

考试文件系统堆栈实现，，，主要实现文件系统的实现-The examination of file system implemented by Stack.

evc + mapx mobile 开发示例程序-evc+ mapx mobile development sample procedures

实现参数的识别提示，作为关键字识别参考ParamTooltip_src.zip-Realize parameter identification tips, as the keyword to identify reference ParamTooltip_src.zip

该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : a partition method (the method when the use of recursive array, which makes the recursive stack into many of the data, consume much space, the number of tested not more than 70, based in Visibility terms procedures, the use of space is also necessary!)

二叉树的递归算法：计算高度、结点个数、交换左右儿子 问题的描述 写一完整函数，计算树的结点数目int CountNode(BTNode* &t)； 完善以下两个函数： 计算树的高度int Depth(BTNode* &root)； 对树的所有子树交换左右孩子void swapsons(BTNode* &t)；-Binary Tree Recursive Algorithm: Calculate the height of node number, the exchange about the issue of his son to write a complete description of function, calculating the number of tree node int CountNode (BTNode

vc++ 一个简单的绘制3色圆，可调窗口大小，不闪烁的应用程序