数据库课程设计,设计一个订户订阅报刊的应用系统

1．定义哈希表数据结构。 2．除留余数法做为哈希函数、 H(key) = key P 用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。 3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table making process and output of the hash table. 3. Write function, seeking to find success, the average search length (ASL).

数据结构：有关树所有操作- Construction of data: The related tree all operates

本系统为餐饮管理系统，为现代餐饮业管理更便捷化，节约时间-This system is catering management system for modern catering industry oriented management more convenient, saving time

分别用C语言和C++语言写的用于三角网格划分的算法。划分效果和速度都不错-Were used C language and C++ language written for the triangular meshing algorithms. Into the effectiveness and speed are good

简单介绍了一种数据结构的构建及其使用情况-introduces a simple data structure of the building and its use

Josephu问题,一元多项式的相加问题,模拟停车场管理问题等问题-Josephu problem, a polynomial of the sum of the problem, simulated car park management and other problems

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution

应收款管理,管理收款项目和其他!-receivables management, project management and other receivables!

离散01串问题，(n,k)01 串定义为：长度为n 的01 串，其中不含k 个连续的相同子串。对于给定的正整数n 和k，计算(n,k)01 串的个数。-discrete series of 01 questions, and (n, k) 01 Series : the definition of the length of n strings of 01, which is non-consecutive k-the same string. For a given positive integer n and k, calculated (n, k) 01 series of numbers.

一个实现了三个查找功能的c语言源代码，分别是顺序查找，折半查找和二叉查找树上的查找。可用VC直接编译运行，对查找算法做了很好的演示。-A search function to achieve the three c-language source code, namely, sequential search, binary search and binary search tree to find. VC can be compiled to run directly on the search algorithm has done a very good presentation.