C语言数值算法程序大全（第二版）

《TCP/IP详解，卷1：协议》是一本完整而详细的TCP/IP协议指南。描述了属于每一层的各个协议以及它们如何在不同操作系统中运行。-《TCP/IP Detailed, Volume 1: The agreement》is a complete and detailed TCP/IP protocol guidelines. Describe each level belonging to the various agreements and how they run on different operating systems.

ConvertVB6toVB7: This application does the form painting depending upon the VB6 from file. It uses a XML file to get most of the changed Valued from VB6 to VB7 It relies mostly on the XMl file VB7.xml we can make this program more generic as it s depends upon XML file for data transfer. The logic are mostly there and can be extended to perform most of the task Some task are left. The problem with VB7 is with Control Array It is not handeld in the Program. For this to run u require Viusal Studio.NET Hapy new Year and best of luck.-ConvertVB6toVB7: This application does the form painting depending upon the VB6 from file. It uses a XML file to get most of the changed Valued from VB6 to VB7 It relies mostly on the XMl file VB7.xml we can make this program more generic as it s depends upon XML file for data transfer. The logic are mostly there and can be extended to perform most of the task Some task are left. The problem with VB7 is with Control

vc++案例教程源码 张荣梅 试过了 很好很好 多多交流-vc++ source code Zhang Rongmei Case Tutorial

银行查询服务，可以查找你银行卡上的钱，每一次取时钱后，都会给你相应的提示。-Bank services, bank card you can find the money, every time when taking the money, it will give you appropriate advice.

进行PLC程序设计，上位机读取PLC的历史数据，OPC与PLC的详细配置说明-For PLC programming, PLC PC to read the historical data, OPC and PLC detailed configuration instructions

背包问题动态规划算法JAVA 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

VisualC++多媒体开发指南》一书的光盘源代码， 该书已经绝版，市面上找不到了-VisualC++ Multimedia Development Guide,

c语言编程技巧 不是轻易可以得到的资料-c language programming skills can not be easily available information

51单片机电路图及PCB版图!有兴趣的可以参考参考!-51 microcontroller circuit and PCB layout! Interested parties can refer to reference!

c++primer，很好的一本书，同学们现在找工作前都看这本书，有空看看，很好用-c++ primer, a good book, students are now looking for work before they look in this book, free look, a very good use