系统主要由考勤机和考勤软件两部分组成，考勤机集成了发卡机、读写器、和数据传输卡，可以脱离微机单独使用，其大容量、高可靠性的存储能力，足以应付人数众多的单位使用；...

常用数据结构算法代码库，包括AVL树，链表，堆栈，hash，排序等-common data structure algorithm code base, including AVL Tree, List, Stack, hash, sort etc.

考勤系统.运行本系统时，登录界面要求输入系统的用户名和密码，此系统提供了两种类型的用户，一种是超级用户，具有执行所有功能的权限，另一种是签到用户，只具有签到功能，因此，这里提供了两个默认的用户名和密码，一个是超级用户，用户名为000，密码为000，另外一个是签到用户，用户名为111，密码为111。-Time and Attendance system. Operation of the system, the login screen for the importation of the system user name and password, the system provides two types of users, one is the super-user, with the implementation of all functions of the authority, another is a sign-user, only sign function, so, here are two default user name and password, a super-user, the user name 000, password 000, the other one is the sign user, the user name 111, password is 111.

编写一个算法，利用栈和队列的基本运算将指定队列中的内容进行逆转。 含完整程序

广义表的反序 逆置广义表的递归模型如下： F(LS) = null 　　　　　　　　　　　　　若 LS 为空 F(LS) = LS 　　　　　　　　　　　　　若 LS 为原子，且 tail(LS) 为空 F(LS) = append( F(tail(LS)), head(LS) ) 　若 LS->tag=0 ，且 LS->tp!=null F(LS) = append( F(tail(LS), F(head(LS)) ) 　若 LS->tag=1 其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.

这个程序主要是实现检查是否抄袭作业，它可以打开txt格式的文件，然后检查在所有存的文件中是否有雷同的，用了命令行参数和数据结构算法，很适合学习c++人做参考-This program is mainly to achieve check copying operation, it can open the txt file format, and then check whether all documents are kept identical, with the command line parameters and data structure algorithms, well suited to learning c++ People to do reference

A*算法，自己通过学习写的，希望大家多多指点.....mqfcu7@tom.com-A* algorithm, by learning to write their own, and I hope a lot of pointing everyone ..... mqfcu7@tom.com

用VB语言实现偏微分方程的解法 包括解边值问题的松弛法、交替方向隐式方法等-VB language PDE solution of the boundary value problems including Xie relaxation method, alternating direction implicit methods

数据结构最小生成树的求法――算法 数据结构可后实习题目-minimum spanning tree data structure for the law-- algorithm data structure can be subject after practice

c++实现的程序，真正实现查询，最短路径-c achieve the procedure, the actual realization of inquiries, the shortest path

2元树的先根遍历算法，中根遍历算法，后根遍历算法-2 yuan tree traversal algorithm first root, root traversal algorithm, after the root traversal algorithm