Computer database technology three examination papers database and detailed answ...

这是凌阳单片机PPT教案，如有学凌阳的，可以下来看看，个人感觉挺不错的！-This is a single-chip Sunplus PPT lesson plans, if any school Sunplus can look down, personal feeling pretty good!

微机原理和汇编语言的课件，名师亲自制作，含金量高，适合自学-Microcomputer Principles and assembly language courseware, teacher personally making, the high gold content, suitable for self-study

自己做的第一个算法程序，非常简陋-its own algorithm for a procedure very primitive

系统集成工作规范范本-standardize the work of system integration model

C++经典书籍和代码-classic books and C code

oracle内部培训资料，dba、plsql 等-oracle internal training materials, dba, plsql, etc.

介绍有关SVM的基础知识，比较适合初学者，通过本文，可以对SVM有个大致的了解。-SVM on the basis of knowledge, more suitable for beginners, through this article, you can have a more or less of SVM understanding.

很好的C#与ASP.NET书籍。分为理论基础篇和实务篇，很实用。-good C# and ASP.NET books. For the project is divided into theoretical and practical articles and practical.

非常适合初学者的DOS教程有浅到深，步步深入，让你不知不觉中成为DOS高手-very suitable for beginners in a simple DOS Guide to the deep, in-depth step by step, so you unwittingly become master DOS

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