一个sql语法分析程序

该程序显示 w100 和 COM 端口的计算机之间的通信。每袋式输送机规模过大，它将保存那个袋子的重量。

编程求两个一元多项式的乘积。 输入 　　输入数据为两行，分别表示两个一元多项式。每个一元多项式以指数递增的顺序输入多项式各项的系数（整数）、指数（整数）。 　　例如：1+2x+x2表示为：,,, 输出 　　以指数递增的顺序输出乘积： ,,, 　　零多项式的输出格式为：,-Programming seeking the product of two one-polynomial. Enter the input data for the two lines represent two unary polynomial. One dollar for each polynomial order of the exponential increase of the input polynomial coefficients (integer), index (integer). For example: 1+2 x+ x2 expressed as: " 1,0" , " 2,1" , " 1,2" , the output of the order of the exponential increase output of the product: " coefficient, index" , " coefficient, index" , " coefficient, the index " , zero polynomial output format is:" 0,0 " ,

二叉树操作&图的遍历操作， 完全按照里面的文挡用VC所完成的程序， 有详细的说明-binary tree traversal operation of the plan operations, in full accordance with the text inside the block with VC performed by the procedure is described in detail in

数据结构的电子教案，对各章的重点说的比较清楚-Data structure of electronic lesson plans, the focus of the chapter, said the relatively clear

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution

数据结构一元多项式的实现-data structure of one yuan achieve polynomial

MySql，Access ADO操作数据库强大封装类 功能满足大家的需求 C++源码，有需要的下载吧

可以用4*4矩阵键盘调整的数字钟，通过动态扫描显示在四位数码管上。-Can use 4* 4 matrix keyboard adjust the digital clock, through the dynamic scan is displayed in the four digital tube.

资源描述数据结构第三章课后题二叉树，对于初学数据结构有很大的帮助

深度优先搜索求迷宫问题 采用深度优先搜索的方法求解迷宫问题，方便快捷-Depth-first search order to the maze problem using depth-first search method for solving a maze problem, convenient and quick