Windows Solitaire, cross

此程序是用排序实现换位递规的的版本， 对程序的操作有一定的帮助作用-This program realizes the conversion recursion by sorting, making some use to operation of program.

曾经有位网友和我讨论怎样编写一个通过服务器对客户机上的程序进行自我升级的问题，由于我的项目也涉及到自我升级，当时我把我的解决方案提了出来，那就是做一个类似于瑞星的升级程序。在这里我也发现了很多的网友对这个问题很困惑，故我愿意把我的设计方案写出来与大家共享，大家也可以通过这个思路用其他语言进行改写-had one netizen and I discussed how to prepare a server through the client on the procedures for self-promotion , I am also involved in the project to self-promotion, I use my solution mentioned, it is so similar to the one Ruixing promotion procedures. Here I also found a lot of online friends to the problem is very confused, Therefore, I am willing to put my design write and share. Members can also thinking through the use of other languages rewritten

Domain2.2 的源代码，不用太详细介绍了吧。值得一看，delphi的，-Domain2.2 the source code, not to be too detailed briefing of the hour. An eye-catcher, delphi, huh

操作系统实验:进程并发模拟-experimental operating system : Complicated process simulation

实现企业员工的上下班考勤，请假，值勤等一系列操作。采用VB编写，简单实用。-Enterprise employees to work attendance, leave, duty, such as a series of operations. Using VB to prepare, simple and practical.

增加家庭成员，管理财务，增加财务收入、借出。管理员有增加删除修改的权限，用户没有这些权限，适合学习，操作简单。

Java小程序两个： 1.输入五个同学的成绩，并将这五个数保存到文件“data.txt”中。然后再编写一个程序：从“data.txt”中读取这五个成绩，计算他们的平均数，然后从小到大排序并输出这五个人的成绩。 2.将八皇后问题的所有界保存到文件“Queen.txt”中。-Java applet 2 : 1. Importation of five students achievements, This number will be five to preserve documents "data.txt". Then the preparation of a program : "data.txt" Read this five results, calculating the average, then order from small to large output and five personal achievements. 2. Eight of the Queen"s community preservation of all documents "Queen.txt".

基于WinCE PB平台的开发指南。详细介绍了系统的启动、配置等信息。-Based on WinCE PB platform development guidelines. Details of the system startup, configuration and other information.

采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接矩阵，假如图中有n个顶点，则输出形式为n行n列的邻接矩阵，输出完毕换行 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Using an undirected graph adjacency matrix representation to complete the map creation, graph depth-first traversal, graph breadth-first traversal operation. In which vertex information is character, the graph vertex number by characters in order. The input sample used in the diagram are as follows: Input Format: The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges Second row, enter information in each vertex, that enter each vertex character Start typing in the third line of each side, each side in the form of two vertices

一个实现柏森汉姆直线算法的小程序，不是自己编的，不过还能用-柏森汉姆a straight-line algorithm to achieve a small process, rather than own, but also with