2004《Java程序设计》 上机练习题 （共包括四部分、16个练习、共96个练习题，请使用“视图”中的“文档结构图”查看）...

VS2005软件打包方法,很不错啊，很不错啊很不错啊-VS2005 software packaging methods, very Cuoa, very Cuoa very Cuoa

FPGA & CPLD eBook. Very good, must read.

代码非常干净！！

s3c2440 bsp超级终端安装视频，描述了过程和使用方式-S3C2440 bsp serial com function description

SSD7 exercise3 练习三绝对满分不雷同的答案-SSD7 exercise3 practice three non-identical answers is absolutely perfect score! ! ! ! ! ! ! ! !

拟牛顿法（变尺度法）DFP算法，求解无约束极值问题。-Quasi-Newton method (DFP) DFP algorithm for solving unconstrained extremum problem.

校际运动会的实现参加运动会有n个学校，学校编号为1……s。比赛分成m个男子项目，和n个女子项目。项目编号为男子1……m，女子m+1……m+n。不同的项目取前五名或前三名积分；取前五名的积分分别为：7、5、3、2、1，前三名的积分分别为：5、3、2；哪些取前五名或前三名由学生自己设定。-The realization of inter-school sports participate in the Games has n school, the school numbered 1 ... ... s. Men" s competition is divided into m-and n-women" s events. Item number for the men" s 1 ... ... m, women, m+1 ... ... m+ n. Different projects to take the top five or top three points to take the top five points are as follows: 7,5,3,2,1, the top three points are as follows: 5,3,2 which take five name or the top three set up by the students themselves.

ssd7数据库练习选择题1-4答案，应该比较全了-Database ssd7 answer 1-4 multiple-choice exercises, it should be a relatively wide

图书馆管理系统(论文).doc图书馆管理系统(论文).doc-Library Management System (Thesis). Doc library management system (thesis). Doc

本程序是利用Ford和Fulkerson迭加算法，求最小费用最大流-use of this procedure is superposition Ford and Fulkerson algorithm, the minimum cost for maximum flow