Python电子书BL _出版物

介绍crc与带反馈的线性移位寄存器（lfsr） 的原理（英文）-crc with the band introduced a linear feedback shift register (lfsr) Principle (English)

C tutorial for beginning programmer

无线知识，请学习，后续会陆续添加后续章节-Wireless Knowledge, please study and follow-up follow-up will continue to add chapters

经典的C++学习书籍，不能不看-Classic C++ Learning books, can not help but look

c++ program design(third edition) c++ 程序设计(第三版) James P.Cohoon,Jack W.Davidson 著 刘瑞挺 韩毅刚 盛素英 刘海嘉 译 电子工业出版社, 麦格劳-希尔教育出版集团 2002年1月-(third edition) c Program Design (third edition) James P. Cohoon, Jack W. Davidson with LIU Hanyigang Sheng-Ting Ying Liuhaijia Translation Publishing House of Electronics Industry, McGraw-Hill Education Publishing Group in January 2002

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

自己动手写操作系统完全版,非常不错的一本书，对系统软件开发很有用-Do-It-Yourself to write the operating system full version, very good a book on the system useful for software development

专家级的汇编技术教程,是超越一般编程的宝典-A compilation of expert-level technical curricula, is to go beyond the general programming book

MPC860 scc demo code

动态装入菜单项-dynamic load menu items