南理工数据库与软件工程复试资料

Addison-Velski 和 Landis (AVL-Tree s)的二叉树，可以在对数时间内进行标准的操作，如插入、搜索和删除。-Addison-Velski and Landis (AVL- Tree s) of the binary tree, the right time for a few of the standard operation, such as insert, delete and search.

一 开发环境 OS: Windows 2000 Server + SP2 IDE: Visual Studio 6.0 + SP5 DataBase: SQL 2000 Server + SP2 二 运行 1：创建数据库 将Hotel.sql中的SQL语句考入SQL Server的查询分析器中，全部运行； 2：建立ODBC数据源 数据原名称为Hotel_MIS-A development environment OS: Windows 2000 Server+ SP2 IDE: Visual Studio 6.0+ SP5 DataBase: SQL 2000 Server+ SP2 Second run 1: create a database of SQL statements Hotel.sql admitted to the SQL Server" s Query Analyzer, all running 2: Create ODBC data source data formerly known as Hotel_MIS

公交车查询系统-Bus Inquiry System

数据结构，用栈实现表达式求职，是改进后的算法-Data structure, with the stack to achieve expression for employment, is the improved algorithm

一个商品销售系统-a sales system

实现了银行家算法，操作系统课程设计时编写的，能够成功运行-The banker" s algorithm implementation, the operating system designed to prepare the curriculum, be able to run successfully

根据一棵二叉树结点的先根序列和中根序列构造该二叉树，并输出该二叉树的后序遍历结果。-According to a binary tree the root node of the first sequence and the sequence structure of the tree root and post the output of the binary tree traversal results.

折半查找算法,实现对于一组数据的查找操作,利用折半查找法进行查找-binary search algorithm, to achieve a set of data for the search operation, the use of binary search method you

利用C++对MYSQL进行数据读，写，及修改. 需要有mysql.h 头文件   数据库结名为person, 表名为 mm, 表结构如下：  字段             类型 device_id       int sav_value      int sav_date        datetime

数据结构课程实验中所编的判断哈夫曼编码.参考可用-experimental data structure courses, which include the judgment Huffman coding. Reference available