Database SQL development, the default database SQL development, the default

操作系统中的文件是通过文件目录项来管理的，为了管理和查找的方便，按层次把文件目录项组织起来，同一层上的目录构成该层上的目录，第一层为根目录，一下为各层子目录。 假设以一串字符代表一个文件，每个字符表示一个记录。 在建立上述目录结构的基础上，建立相应的管理系统并要求完成以下各项操作： 1． 一次建立各个文件 2． 查访两个用户的所有文件 3． 查访用户sun 是否有文件AB 4． 删除用户sun的文件AC,然后在分别查访两个用户的全部文件，检查是否已经删除文件AC 5． 撤销用户sun,并检查是否被删除 6． 删除用户sun的全部文件，然后在撤销sun用户，在查访用户sun, 检查其是否已被撤销。 在建立一个新用户及新用户的两个文件，然后查该两个用户的所有文件-operating system, the paper is to document catalog items to the management, in order to manage and facilitate the search, according to the document level directory entries organizations, the same floor on which constitute the directory contents on the floor, the first layer of the root directory to look for levels of subdirectories. Assuming that the representative of a string of characters, each character expressed a record. In establishing the directory structure on the basis of the establishment of a corresponding system of management and asked to accomplish the following : 1. Once established two separate files. Visits to the two users of all three docum

迷宫的又一解法。该算法简单、实用、可读性强，是学习递归和回溯很好的例子。-maze of another solution. The algorithm is simple, practical and readable study is recursive and backtracking good example.

哈夫曼编码(Huffman Coding)以哈夫曼树─即最优二叉树，带权路径长度最小的二叉树，经常应用于数据压缩。-Huffman coding (Huffman Coding) ─ a Huffman tree that is optimal binary tree, with the right of the path length of the smallest tree, often used in data compression.

备份还原firebird或interbase

数据结构 银行程序-data structure banking procedures

篮球赛抽签系统，先输入球队数，由随机函数在1-N抽取一个数，作为初始密码，出列第一支球队，然后根据各队输入本队密码，利用joseph环，使每次出列的球队密码作为新的密码，直到所有球队出列，即可确定分组顺序-Basketball lottery system, first enter the team number by the random function in the 1-N taken a number, as the initial password, the first teams out of the column, and then each team enter the team password, using joseph ring, so that each second team out of the column as a new password password, until all the teams out of the column, you can determine the packet sequence

算符有限分析法 //程序功能： //根据算符优先分析法，将表达式进行语法分析，判断一个表达式是否正确。 //文法：E→E+E E-E E*E E/E (E) i // 其中i为无符号整数-operator limited analysis// procedural functions :// operator under priority analysis, to conduct regular expression syntax analysis, judgment, an expression is correct.// Grammar : E E E E-E E E* E/E (E) i// for which i unsigned integers

墨香完整数据库 如果哪位大大有 请你 send edwinking094@gmail.com 给我因为我的墨香数据出问题 急找大大帮助我~

以邻接矩阵作为图的存储结构，根据键盘输入创建图，并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan

BM关键字查找算法，在用于查找子字符串的算法当中，BM（Boyer-Moore）算法是目前相当有效又容易理解的一种，一般情况下，比KMP算法快3-5倍。-BM keyword search algorithm used in the sub-string search algorithm which, BM (Boyer-Moore) algorithm is quite effective and easy to understand A, under normal circumstances, more than 3-5 times the KMP algorithm quickly.