一本不错的VC开发帮手，可以随时查找VC中的函数等内容，使用非常方便！

C 和C++ 基础知识的课件，使结合两门课一起讲的。挺不错！-C and basic knowledge of courseware, combining two together for the class. Very good!

《征服Ajax+Lucene构建搜索引擎》一书的光盘源代码。-" Conquer Ajax+ Lucene to build search engine," a book, CD-ROM source code.

linux socket programming guide

外星人管理系统哈-aliens management system Minamata Minamata Kazakhstan

图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]

探索Windows 2000发展策略以及中介层技术设计的基本概念-development strategy and technology intermediary layer of the basic design concept

三级上机题中的部分-three on the plane and that the part

This the Visual C++ e book the name of the book is learn QUE Visual C++ -This is the Visual C++ e book the name of the book is learn QUE Visual C++

可以与侯捷的书相比的深入浅出java语言程序设计-Hou Jie, the book can be compared with the plain language of java programming language

ARM嵌入式系统开发--软件设计与优化随书源代码。开发环境asm+c，带mmu的小操作系统。-ARM Embedded System Development-- software design and optimization of the source code with the book. Development Environment asm2 c, the small band mmu operating system.