中文Access 2000 24学时教程(PDG)

包裹ca.pfv.spmf公司.关联规则.TopKRules;

用Java连接数据库实现数据的插入，删除，查找，修改等功能

客户管理系统使用ASP.NET和Acce-Customer management system using ASP.NET and Access

统计字符出现的频率的哈夫曼编码-the frequency of Huffman coding

利用Fortran 90 接口读取已经创建的nc文件，并且检验其读写是否正确-The use of Fortran 90 interface to read nc file has been created, and test its read and write correctly

对Oracle OCI的封装- To Oracle OCI seal

多项式相加 pascal源程序-polynomial combined source

数据结构用C语言实现，算法较巧妙-data structure using C language, the algorithm more cleverly

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

文件与IO存取,数据绑定,数据库更新,章立民的程序-Documents and IO access, data binding, database updates, rules and procedures for public