GSM编程AT指令集

GDI+编程首选，内容详细，首选书记-GDI+ programming preferred, detailed and preferred secretary

张孝祥的Java就业培训教程,和张孝祥视频教学光盘配套,非常优秀的Java入门教材.-Zhang Xiaoxiang the Java-employment Training Course, and Zhang Xiaoxiang video teaching CD-ROM package, very good introductory textbooks on Java.

操作系统深入了解，引导探究，对操作系统原理，各种机制进行详细阐述-Depth understanding of the operating system, and guide to explore the operating principles of a variety of mechanisms in detail

第三层交换技术 网络技术书籍，有兴趣的看看吧-third layer switching technology network technology books, interested to see it

排序冒泡法，这是最原始，也是众所周知的最慢的算法了。他的名字的由来因为它的工作看来象是冒泡-Bubble sort method

本课件是本人多年来教学实践中积累和制作的《操作系统》这门课程的教学课件（ppt格式），使用多次学生反映较好，有较高实用价值。-Courseware is the teaching practice over the years I accumulated and the production of the "system" of this curriculum courseware ( ppt format), use better reflect the number of students, which have a higher value.

图论中最小生成树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]

novellnetware初学者强化手册是一个不错的选择

《MATLAB时尚百例实例》实例70-83

vc++的第二章学习-vc Chapter II study