串的KMP算法，无回溯的模式匹配中最具代表性的是KMP算法。它是基于对模式本身的字符分布特征所进行的分析，生成模式的特征向量，显示了P= aab 匹配S= ab...

中缀表达式转换为后缀表达式并求值 使用switch语句-Infix expression into a suffix for the value of expression and the use of switch statement

北京邮电大学计算机应用硕士论文__数据仓库体系结构设计 包括答辩稿 水平自然是高希望对你有所帮助-Beijing University of Posts and Telecommunications Computer Application master"s thesis __ data warehouse architecture design includes text reply is naturally high level of hope for your help

vfp转换成excel表格-vfp change to excel

ACCESS常用窗体查询，例举多种窗体查询的方法-ACCESS commonly used form inquiry, examples of a variety of form queries

vfp原程序prg-Probe original program prg

免费的Delphi控件，可以替代BDE，直接访问.dbf数据库-Free Delphi ActiveX component,replace BDE and direct access .dbf database

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

数据结构和算法,C++描述，数据结构习题，数据结构答案-datastruct

数据结构往年试题及答案-Data structure in previous years questions and answers

直接附加数据库！ 修改 Include/ Class_Main.asp 为自己信息 后台admin admin 绍兴人才网程序-Direct-attached database! Modify Include/Class_Main.asp background information for their own talent network admin admin procedures Shaoxing