C语言经典编程学习

XML入门教材，很不错的 强烈推荐使用！-XML Introduction to materials, it is strongly recommended to use good!

Java经典试题及答案。里面是一些关于JAVA的资料！-Java classic questions and answers. There is some information on JAVA!

易语言支持库开发文档本文件及其中所有实例的版权均为易语言作者吴涛所有，仅授权给第三方用作开发易语言支持库，禁止用于其他任何场合-Yi language support library development documentation for all instances of this document and its copyright are easy language by Wu Tao of all, only licensed to third parties for development of Yi language support library is prohibited for any other occasion

《ASP.NET办公自动化系统开发实例导航》配套光盘，人民邮电出版社2005

50个令人叹为观止的JavaScript应用站点-50 amazing JavaScript application site

C语言高级编程及实例剖析/王为青, 刘变红编著 ISBN号: 978-7-115-15423-1 出版发行项: 北京-人民邮电出版社 2007 光盘内容 附注项: 本书结合实例，深入浅出地介绍了C语言在主要应用领域的编程技术。全书共9章，分别为内存管理、文本屏幕界面设计、文件高级操作、图形图象、中断、通信技术、基本总线接口编程等。 附注项: C语言程序设计人员。 -C high-level programming language and examples of analysis/Wang Qing, Liu red for the ISBN number: 978-7-115-15423-1 published items: Beijing- People" s Posts & Telecom Press, 2007 CD-ROM of the contents of note: the book with examples, to learn more on the C language applications in the main programming. 9 book chapters, respectively, memory management, text-screen interface design, documentation of the advanced operators, graphic images, interruption, communications technology, such as the basic bus interface programming. Note item: C language programmers.

一本介绍VB的好书，最基本的VB来自国外，如果我们不想买书的话，这是一个不错的选择。

一个非常好的视听心理学的多媒体课件，找了很久才找到的-A very good audio-visual multimedia courseware psychology to find for a long time to find the

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

oracle学习资料，讲的内容比较丰富，很高兴能呵大家一起分享，一起学习-oracle learning materials, stresses the relatively rich, I am very glad to share with everyone uh, learning together