USB上位机程序，非常好的界面，基于MFC的开发，很适合初学者开发...

学生管理系统，开发环境Microsoft Visual Studio 2005、asp.net2.0、sql server2-Student management system, development environment Microsoft Visual Studio 2005, asp.net2.0, sql server2000

模拟显示器逐行扫描的程序,在tc2.0环境下 做的.很好的哦-progressive scan analogue monitors procedures, the tc2.0 environment so. Oh well

Iocmp控件库的vb例程，有60多个源程序代码-It is Iocmp control s VB sample, including more than 60 sample program.

基于Qt的考勤管理系统，实现对学生，教师各个工种的考勤管理。方便快捷。与后台数据库相连，扩展性良好。

cricket statistics using vb

简单职工信息系统程序-simple procedures for workers Information System

一个继电模拟测试系统,用VC编写，包括直流测试,UI测试,交流边频,差动测试,阻抗测试等。用拆分视图实现，左边是对话框，右边是图形界面，形象直观，而且程序中还有通过调用WEB页的方式对各模块的简短介绍，在初始界面，可以控制播放GIF动画，实现了两个视图同步播放。-Simulation tests of a relay system, using VC prepared, including the DC testing, UI testing, the exchange of side-frequency, differential test, impedance test. Split view with the realization of the left is the dialog box, and the right is the graphical interface, visual image, but there are procedures by calling on the WEB-page brief description of each module, in the initial interface, players can control GIF animation, achieved two views simultaneously broadcast.

本书是Brian W. Kernighan和Rob Pike合著的最新力作。本书从排错、测试、性能、可移植性、设计、界面、风格和记法等方面，讨论了程序设计中实际的、又是非常深刻和具有广泛意义的思想、技术和方法，它的翻译出版将填补国内目前这方面书籍的空白。本书值得每个梦想并努力使自己成为优秀程序员的人参考，值得每个计算机专业的学生和计算机工作者阅读，也可作为程序设计高级课程的教材或参考书。 -This book is Brian W. Kernighan and Rob Pike

本程式是用VB6编写的程序，主要用于空调工程中铜管重量价格的计算。-the VB6 program is prepared by the procedure, mainly for air-conditioning engineering brass weight of the price calculation.

2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列 1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 创建的二叉树： -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 of a list prepared by using the binary form of a binary tree stored in the creation, the first sequence, in sequence, after the order and by level traversal algorithms. Create a binary tree: