Mysql数据库的web管理工具

利用深度遍历的方法来检查8数码问题是否有解。-use depth traverse method to check whether the eight digital solutions to the problem.

自己做的 借书管理系统-own library management system

实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The intersection of what is the set. And so on. ADT then these are the methods to achieve.

学生管理系统功能的信息量大，数据安全性和保密性要求最高。本程序可实现这些功能。1)输出学生成绩单2)按姓名查询3)增加学生4)删除学生5)按班级修改学生成绩6)显示不及格学生成绩7)按平均成绩排序并输出成绩

数据结构：队列程序-data structure : queue procedures

OTL4.0被设计成一个C++模板框架和OTL-适配器的组合。该框架是一个通用的实施OTL流的概念。该OTL-适配器周围的数据库API薄包装和作为类的类型参数传递到模板框架。

存储过程sql： create or replace procedure job_proc is begin --免费票状态修改 需修改ID update O_2413 set attr_24131004="作废" where attr_24131004="已售"; --普通票状态修改 需修改ID update O_2405 set attr_24051004="作废" where attr_24051004="已售"; --团体票状态修改 需修改ID update O_2412 set attr_24121004="作废" where attr_24121004="已售"; end; job的sql： declare   job number;   begin   dbms_job.submit(job, "job_proc;", sysdate, "TRUNC(SYSDATE + 1)");   end;

vc访问多个数据库。-vc visit multiple databases.

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-introduced a total of four ranking functions : insertion sort, bubble sort, select, in order of Quick Sort. We need to build a disorderly random sequence, the use of such methods of sequencing to establish an orderly sequence of the disorder, and the preparation of the corresponding procedures of each algorithm for the calculation of frequency assignment, as well as comparison with the number of time, using this as the basis to judge the efficiency of algorithms.

数据结构经典：《用C++描述数据结构》 作者：埃利斯・霍罗维茨 1997-Data Structure classic: