74芯片大全,了利用此其安全的完成电路板的设计与制作，是开发电路板的好帮手。...

Lwip协议栈的设计与实现 -LwIP Protocol Stack Design and Implementation

c专家编程, 不错的关于c语言的进一步学习-c expert programming, good on the c language to learn

xml学习4-xml studies 4

c51源程序,比较常用的源程序集锦，适合初学者学习-C51 source, commonly used source collection, suitable for beginners to learn

这里面包含了C和linux下C语言的函数文档,是两个非常好的帮助文档,他们可以在你进行window-c和linux-c编程时,能够很方便的查找相关函数,就想vc中的msdn和java script帮助文档一样.-that it contains the C and C language under linux function documentation is two very good help files, They can you window-c and linux-c programming, very easy to find the correlation function, wanted vc VARIANT of java script and help document the same.

sst39VF040.rar，sst39vf040存储芯片的说明书！很不错哦！-sst39VF040.rar, sst39vf040 memory chip specifications! Oh, very good!

达内JAVA软件工程师培训的 EJB笔记。很不错的。-JAVA Software Engineer Danesh EJB training notebook. Very good.

线程池实例,1.1版本,用于代替.net自带线程池

一个很不错的文档，特别是对编程新手而言。 内容很全面，囊括了作为程序员所需要的所有基本只是，不仅仅包括语言。 使用它，可以作为一个提纲，把这本书读厚。-A very good document, especially in terms of programming novice. Content is very comprehensive, covering as a programmer need all the basic just that, not only including language. Use it, can be used as an outline of the learning opportunities this thick.

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