C和C++汇总试题，适合要接受面试的同学面试前看一下

SOPC新手的很好的教材。一步步知道您使用SOPC。-It s the best book for SOPC starter.

一种c语言算法 k-mean.c-A c language algorithm k-mean.c

基于asp.net下的C#开发技巧，应用开发集锦。-Based on asp.net under the C# development skills, application development highlights.

h.264白皮书，是从事264研究的原本和必备书。很不错的 -h.264 White Paper, 264 are engaged in the original study and is an indispensable book. Very good

C语言程序设计及应用-C Programming Language Design and Application

恒日PLC编程软件具有非常完善的模拟运行功能，该功能能够完全反映梯形图程序下载到控制器中的实际运行结果。 XC变成软件的模拟运行窗口含有48个模拟开关量输入点，48个开关量模拟输出点，两个7段LED数码显示模块。 -PLC programming software is a very sound operation of the simulation function, The function can fully reflect Ladder downloaded to the controller of actual operating results. XC into simulation software running window containing 48 Analog Switches input, 48 Switch Analog Output, two seven-segment LED digital display module.

背包问题动态规划算法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.

VC编辑的记事本，功能强大，非常实用，MFC编辑，相信你一定很喜欢-Notebook，verygood

H.323.rar 功能的说明 -H.323.rar 功能的说明H.323.rar 功能的说明

高质量程序设计指南C加加语言，很有用的，包括编程初级及提高方面，有理论，开发环境和技巧性的东西。-High-quality programming guide C Gaga language, very useful, including primary and enhance programming, some theory, the development environment and techniques of East and West.