Beijing University of Chemical Technology in 2008 summer training report of a pr...

Mysql数据库的web管理工具-Mysql database web management tool

数据算法，小明买书-data algorithm, Xiao Ming books

基于C语言的各种典型排序算法：插入排序，气泡排序，希尔排序，快速排序，选择排序。可以用VC直接编译运行。-Based on the C language provides a variety of sorting algorithms: insertion sort, bubble sort, Shell sort, quick sort, selection sort. VC can be directly translated to run.

数据库程序设计，采用java,JDBC,J2EE开发数据库-Database programming, using java, JDBC, J2EE development database

C语言常用算法源代码,非常好用非常好用-C language source code commonly used algorithm, a very handy very handy!

MatrixStatic一个不错的管理系统源码-MatrixStatic a good source management system

队列,1、 掌握队列的顺序存储结构和“假溢出”的处理方法 2、 设计用标志位解决“假溢出”问题的顺序队列 -cohort, 1, the master queue storage structure and sequence "false spillover" of the two treatment methods. Design signs spaces, "false spillover" in the order queue

对文件进行文本文件处理 并采用递归法把查到的信息插入到树中-a file processing program, process a file and insert the information from the file to a tree

数据结构各章的全国各大院校的考研习题 对广大考研学生来说非常有用-data structure of the national chapter of the major institutions in taking tests for the majority of the questions the students taking tests is very useful

清华大学数据结构课上实现的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;