C++, polynomial addition and multiplication, can help you run a simple program

各种电机的DSP控制程序，便于各种用户（企业、高校、爱好者）等通过嵌入式系统控制电机的运动，运用前景非常广阔，从纯电动汽车到风力发电，到轨道交通，再到高铁应用等等。本程序是基于美国德州仪器公司的TMS320F28335的芯片，采用其公司自带的CCS编译系统进行编译的。

用异或思路实现一个运动的圆和一个静止的正方形的小程序，用c写的 -with allogeneic or ideas to achieve a circular movement of a stationary and a small square of procedures used to write the c

《Visual C++高级编程及其项目应用开发》源代码-"Advanced Programming in Visual C application development projects and the" source code

《面向对象程序设计》练习10_7的源代码- Object-oriented programming, the source code of practice 10_7

通过IP地址推送显示消息到电子显示屏LED。使用16进制的方式推送

通过RS232为x86嵌入式系统提供控制接口

This example demonstrates how to embed a tree and add button cells to Chris Maunder s MFC Grid control (derived from CWnd-This example demonstrates how to embed a tree and add button cells to Chris Maunder" s MFC Grid control (derived from CWnd

模仿windows的信使服务 可以将信息发送给指定的主机-simulate the windows messager service, can send message to a given computer

发送程序段，已经调试通过，希望可以学习程序开发有帮助-Send program segment, have been debug through, hoping to develop the learning process has helped

采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接矩阵，假如图中有n个顶点，则输出形式为n行n列的邻接矩阵，输出完毕换行 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Using an undirected graph adjacency matrix representation to complete the map creation, graph depth-first traversal, graph breadth-first traversal operation. In which vertex information is character, the graph vertex number by characters in order. The input sample used in the diagram are as follows: Input Format: The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges Second row, enter information in each vertex, that enter each vertex character Start typing in the third line of each side, each side in the form of two vertices