机器人学，熊友伦院士，华中科大第3版，PDF，经典教材

GCC访问SD卡的源代码，基于avr单片机的SD卡驱动的完整程序。-Access SD card GCC source code, based on the SD card avr microcontroller integrity-driven process.

C51的编程规范,对于初学C51的人来说帮助不小哟,不妨看看嘛?-C51 programming norms, C51 for the beginner who is not a small yo help, it may take a look at them?

asp编程完全手册，适合新手！里面有大量实例和详细介绍，相信是你入门的好帮手！-asp programming entirely manual for novice! Where there were numerous examples and detailed information, I believe that your entry is a good helper!

make s format

纳迅河畔谈中国历史，也很有意思的-satisfied Xun River on China"s history, but also have very interesting

SEED-DEC5502，seed公司提供TI5502芯片的原理图，对开发5502的非常有用处，希望大家参考。-SEED-DEC5502, seed companies TI5502 chip schematics, 5502 on the development of very useful, I hope your reference.

谭浩强C程序设计,很经典的一本C教程。chm格式电子书。-Hao strong C programming, is a classic C tutorial. chm e-book format.

李久进的VC教程 里面有一些VC的基础知识 适合新手看-Lee Jin-VC Guide VC inside some of the basic knowledge for newcomers to s

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

单片机对lcd的读写，此程序包括能够显示数字，汉字，字符，图形，很全面的。-Single-chip to read and write to the lcd, this program including the ability to show the number of Chinese characters, characters, graphics, very comprehensive.