是一个C语言的KMP代码， 包含可执行文件。

施伯乐@黄皮书《数据结构教程》part1-Shi Bole @ beige book Data Structure Course part1

数据结构课程的实验之一，有关于数组的循环位移，简单的小程序-Experimental data structure course one of the cycle of displacement on the array, a simple applet

huffman树的基本实现. 利用读取TXT文件统计产生huffman树,从而对TXT文件进行压缩和解压.-huffman tree realize. the use of statistics to read TXT file generated huffman tree, thus TXT file compression and decompression.

图的深度优先遍利 图的深度优先搜寻法 有注释-Fig times the depth of Victoria map priority depth-first search method has the Notes

删除ORACLE数据库记录，条件选择，多表选择，删除结果显示，显示删除表数据的条码，对应每一个表多少记录，数据库多表可选择删除，结果多条显示

将文件中的字符作为结点，每个字符在文件中出现的频率作为结点的权值，采用Huffman算法构造Huffman树，将字符用尽可能短的二进制数位表示（频率越低，二进制数位越长），而不是用8位的ASCII码进行存储，已达到节省存储空间，压缩文件的目的。

采用链式存储结构设计广义表,实现以下操作:创建广义表,取广义表的表头元素和表尾元素 求广义表的深度-Chain store use of the structural design of the generalized form, realize the following: create a generalized form, check the generalized table header elements and table elements for the end of the depth of the generalized form

题目：设计一个题目，演示用算符优先法对算术表达式求值的过程。 概要设计 1、顺序扫描中缀算术表达式，当读到数字时直接将其送至输出队列中； 2、当读到运算符时，将栈中所有优先级高于或等于该运算符弹出，送至输出队列中，再将当前运算符入栈； 3、当读入左括号时，即入栈； 4、当读到右括号时，将靠近栈顶的第一个左括号上面的运算符全部一次弹出，送至输出队列中，再删除栈中的左括号。 5、使用VS栈来存储读入的操作和运算结果，然后进行数字字符到数值的转换。 -Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical co

vc下的ADO数据库编程-vc the ADO database programming

数据结构自考试题及答案 希望能够帮助大家-Data structure questions and answers to help everyone