护照自动化系统

把老师给的PPT，上传了。 是说数据结构。-The teacher to the PPT, uploaded. Is that data structure.

vfp表单，锁住和解锁数据表。（压缩文件）-Probe form, the lock and unlock data sheets. (Compressed files)

包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等-includes various tests, such as search and algorithm code, such as Bubble algorithm, the tree traversal, linked list, queue, stack, etc.

利用Access数据库制作的学生管理系统，可以方便的进行查询和其他管理。-use Access database produced by the student management system, to facilitate the conduct of inquiries and other management.

利用C语言实现两个多项式的加法，依次输入输入指数和系数，数据输入以（0，0）结束-use C language two polynomials additive, in order to import and importation index coefficient, data input to (0,0) end

单链表的一些简单算法。-some simple algorithm.

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

关于用nlogn的最长子序列算法，在网上摘录的-discusses the use of the longest sequences algorithm, in the extract from the Internet

用VB+access数据库设计的学生公寓管理信息系统.有一定实用参考价值!-VB access database design student apartment management information systems. Have practical value!

VB6.0下对Access数据库文件进行查找、添加、删除记录的源代码！-VB6.0 under the Access database files to search, add, delete records of the source code!