基本数据库概念:SQL语言介绍,并发处理,触发器,存储过程,事务处理

学习ORM的理论文章,对于从事数据库开发的人员可以参考这篇文章了解ORM的架构-learning ORM theoretical articles, engaged in the development of the database can refer to this article understand ORM framework

REGISTER LEVEL DESIGN

此程序是在VC环境下完成的数据结构排序算法演示系统 -askdlfhl adjsl kf asdfa

美化程序，养成良好的编程习惯，成为真正的编程高手-Landscaping procedures, to develop good programming habits, to become a true master of the programming

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

struts spring hibernate 学习可以参考的资料哦！-struts spring hibernate learning can refer to the information, oh!

其环境下的编程,有兴趣的朋友,可以下载看看.-learning db2 for alll the aasdljj fsldja lasdjl

操作系统教程(第四版)答案(孙钟秀主编)。全部答案都有。方便参考和学习。-Operating System Tutorial (fourth edition) answers (Zhongxiu Sun editor-in-chief). Have all the answers. Ease of reference and learning.

是一本讲述电脑知识的相当有用的书籍，学习电脑的同学可以-Is a very useful knowledge about computer books, computer learning students can see

Wavecom _GPRS_AT指令集.pdf-Wavecom _GPRS_AT instruction set. Pdf