这是一本比较好的C语言程序设计电子书，特别拿出来与大家共享。 第一部分...

从CNKI下载的审计专家系统电子书（1），可不是免费的吆！-CNKI downloaded from the e-books audit expert system (1), is not free shout!

Secure Lecture Source

IBM-PC汇编语言答案 这里有清华大学出版的汇编语言的课后练习的答案,可以互相学习交流.-IBM-PC assembly language is the answer here Qinghua University published a compilation of the supplementary exercises language of the answer, we can learn from each other exchanges.

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

用vc实现创建快捷方式-vc used to create shortcuts to achieve

原书全名为＜MFC深入浅出――从MFC设计到MFC编程＞李久进编著，华中理工大学出版. -The original full name

学习编程的好资料 初学者必备 拥有理论性加实践性-Good information for beginners to learn programming theory plus practical must-have

IC资料，电源模块，不是很好弄的一种.

c++课程习题集的源代码，初学者的好帮手，请尊重作者的劳动。-c++ courses Exercises Set source code, for beginners a good helper, please respect the author

Plam 编程非常权威的书,包括UI,网络等Plam系统的各个方面.-Plam programming very authoritative book, including the UI, network Plam system in all its aspects.