java编写的一款简单的拼图游戏，可以下载到手机上玩

编译试验，非常有好处，有很大参考价值，是词法分析-compiler test, a very good, very important reference value of lexical analysis

操作系统实验，进程同步与互斥读者写者问题，用vc实现-experimental operating system, and coordinate the process of the readers who wrote, using vc achieve

UNIX模拟系统模拟得很完善！-写的很好 !

Config.xml配置文件处理-Config.xml configuration file handling

普通调幅电路am-Ordinary amplitude modulation circuit am

lcd工具，将图片转换为lcd可以使用的数据-lcd tools, the picture is converted to data that can be used lcd

算法实现题 最长公共子序列问题 给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列 举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }-Algorithm to achieve the longest common sub-title sequence of the problem given two sequences X = (x1, x2, ..., xm) Y = (y1, y2, ..., yn) for X and Y, a maximum common substructure sequence, for example X = (a, b, c, b, d, a, b) Y = (b, d, c, a, b, a) the longest common sub-sequence for LSC = (b, c, b, a )

gmm test... gmm test... gmm test

1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列。 3 编写一个主函数，将上面函数连在一起，构成一个完整的程序。 4 调试并运行实验源程序。 -Prepared using a binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. 2 the preparation of a binary tree will be all about the exchange of sub-tree algorithms. Tip: Verify that the exchange can be called binary tree traversal algorithm to compare the output node sequence. 3 write a main function, the above functions together to form a complete program. 4 debug and run experiments source.

马跳棋盘源程序 ,一个实际问题的解决-Ma checkerboard source, a practical solution to the problem