VB learning their assignments, the bad things a great weekend!

这程序实现pascal词法分析，把源程序逐行读入一个字符串缓冲区中，然后逐行分析。适合手一看。-this program pascal lexical analysis, source progressive read into a string buffer, and then progressive analysis. For a look at hand.

PowerBuilder行命令编译器,完全可以代替PowerBuilder.你需要PowerBuilder基本环境.-PowerBuilder compiler command line, we can replace the PowerBuilder. You need basic PowerBuilder environment.

Think in C++ 2nd Edition，Volume 1和2,加原代码-Think in C++ 2nd Edition, Volume 1 and 2, plus source code

ms-word2003的专业用户junior

几篇有关雷达目标识别的优秀论文（基于非线性方法的雷达目标识别研究.NH基于高分辨距离像的雷达目标识别.NH雷达目标识别系统的研究和设计.KDH）.part5-Several of the radar target recognition of outstanding paper (based on nonlinear methods of study of radar target recognition. NH HRRP-based radar target identification. NH radar target identification system research and design. KDH). Part5

内附调用ITLSSPProc.dll 调用说明，用于NV200型人民币识别程序的开发，让客户快速了解 NV200 的通讯过程; 适用于初次使用识币器的客户, 这样可以 不用过多的了解串口通讯机制, 也不用去过多了解适用于 NV200 的 Crc 计算, 以及 SEQ 交替等; 

快速排序与交换排序算法比较 在Visual C++中建立一个单文档Windows应用程序，并实现下述功能： 运用随机函数自动生成一定规模的测试数据 (10000个测试元素)，并输出到文件中。 分别执行快速排序算法和交换排序算法对测试数据排序，并输出到不同的文件中。 使用较为精确的QueryPerformanceCounter和QueryPerformanceFrequency等函数记录算法耗时，精确到毫秒，以便更好地进行算法耗时比较。 分析两种不同算法，有针对性地设计与调整测试数据，进而通过比较算法耗时来得到更充分且更深刻的认识。 编写模块校验两种不同排序算法的输出结果正确且相同 -Quicksort sorting algorithm comparison and exchange In the Visual C++ to create a single document Windows application, and to achieve the following functions: The use of random function automatically generates a certain amount of test data (10000 test elements), and output to a file. Respectively, and the exchange of the implementation of quick sort algorithm sorting algorithm to sort of test data, and output to a different file. Using a more accurate record of QueryPerformanceCounter and QueryPerformanceFrequency algorithms such as time-consuming functions, accurate to the millisecond, in order to better carry out time-consuming compared algorithms. Analysis of two d

Designing and Engineering Time: The Psychology of Time Perception in Software by Steven C. Seow Ph.D. 2008

一个用变形贪婪法解货郎回路的C程序代码 思想 1．选择一条最短的边作为部分解。 2．选择一条最短的且将之加入到部分解不形成回路的边。 3．重复第2步，直至所有的结点都包含在部分解中。-deformation with a greedy method for the Traveling Salesman circuit C code ideological one. Choose a minimum as part of the solution side. 2. Choose one of the shortest but to incorporate it into solutions that do not form part of the loop side. 3. Repeat Step 2 until all the nodes are included in some solution.

用c语言写的一个小画面，画面中有一朵莲花，如果还要显示中文的话，就要下载汉字库HZK16-language used to write a small picture, the picture is a lotus flower, if we show the Chinese, then we would HZK16 Download Store