Addison.Wesley.Windows.Forms.2.0.Programming.2nd.Edition.May.2006Windows Forms 2...

初学者就应该-beginners should look at

该书以实例的方式，详细介绍了“ASP.NET 2.0 + SQL Server 2005 ”网络开发技术。 第一部分： 2个部不分层体系结构的系统：电子通讯录系统、网络选课系统。 第二部分： 3个采用三层体系结构的系统：多用户聊天室系统、网上论坛系统、图书管理系统。 第三部分： 4个采用多层体系结构的系统：在线考试系统、网络招聘系统、电子商务系统、办公自动化系统-Book by way of example, detailed information on " ASP.NET 2.0+ SQL Server 2005" Web development technique. Part I: two layered architecture are not in the system: electronic address book systems, networks, elective system. Part II: three three-tier architecture system: multi-user chat system, online forum systems, library management system. Part III: 4 with multi-tier architecture of the system: online examination system, online recruiting system, e-commerce systems, office automation system

MFC类库详解，有MFC类结构图，对初学者很有用，也是值得开发人员典藏的一个帮助文档。基本含有所有控件的说明。-MFC class library Xiangjie, there are MFC class structure diagram, useful for beginners, but also a collection worthy of developers to help documentation. Basically contains all the control instructions.

这是一个控制台程序，可以检测出一个ASF文件有几个流，以及每个流的编号、比特率、使 用的编解码器等信息。-This is a console procedures can detect an ASF several flow, the flow of each number, bit rate, the use of the codec, and other information.

基于MATLAB的BP人工神经网络设计,希望对大家有用-MATLAB-based BP artificial neural network design, we hope to useful

我搜集的一些关于C++的面试题上传上来和大家一起分享，有答案的-I have collected some information about C++ Questions From the surface up to share with everyone, there is the answer

ajax快速入门,主要讲解原理与部门实现-Quick Start ajax, mainly on the principle and sector

driverstudio教程。-driverstudio Guide.

精通和掌握matlab，内容好！我个人学习的过程中帮助很大，希望对大家有用！-Department of 精 Gallery 和 bad matlab, 内容好! Well-behaved bully 个人 conformation Shilu 的过程 帮 Liao 很大, sentence oligonucleotide sputum 对大家 Tang!

CSDN论坛-算法精华.chm文件 有各种各样的算法,如:最短路径有两种不同的提法：一是从某个顶点到其它顶点的最短路径，二是每一对顶点的最短路径，前者是否包含后者？若不然，前者与最小生成树有何区别？-CSDN Forum- the best algorithm. Chm file there is a wide range of algorithms, such as: the shortest path there are two different formulations: one from a vertex to other vertex of the shortest path, and second, each of the vertices of the shortest path The former contains the latter? If not, the former with the minimum spanning tree What