根据事务文件成批地更改主文件并得到一个新的主文件，与吴伟民数据结构课本完全一致，用C实现...

主要包括：建立大学数据库的源文件，已经建立好的ACCESS数据库文件，ACCESS2007教程课件，窗体使用的经验交流课件，实验报告。希望能对学习数据库的同学产生帮助-Mainly include: the establishment of the University of the database source file, well-established ACCESS database file, ACCESS2007 tutorial courseware, the form used in the exchange of experience courseware, lab report. Hopes of learning a database created to help students

About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl

将内存中的一段数据拷贝到另外一段内存中，要考虑其中的内存覆盖问题。-A section of the memory to copy data to another section of memory, it is necessary to take into account the memory coverage problems.

数据结构上机实验内容. 快速排序源程序代码-data structure on the plane experiments. Quick Sort source code

关于管理信息系统的一些很好的案例！ 还有后续呢 很多哦-on management information systems in some very good case! There is a lot of follow-up? Oh

实现岛上建立公路的最短路径算法，调用了dikstra算法-Highway on the island to achieve the establishment of the shortest path algorithm, called algorithm dikstra

四色算法代码，已经在OMNETPP平台上编译成功！-Algorithm for four-color code has been compiled successfully OMNETPP platform!

此程序将从给定的字符串中删除模式 (子串)。 这是最简单和容易理解的 c + + 编写的代码。 这是最准确和最佳性能要使用的程序。

计算机数据库方面的有关内容,对需要毕业设计的外文翻译的同学有用-Computer database of the contents of the graduation project required the translation of foreign language students useful

问题描述： 假设一个商店，它有一个货架和一个仓库，当货架上的商品数量少于一定的数目时，从仓库运一定数量的商品摆到货架上，当仓库里的商品的数量少于一定的数目时，购买商品把仓库填满，商品的出售要按照商品的生产日期来，快要过期的商品要先出售。 解决问题的方法： 用了两个栈和 一个队列，把队列当作仓库，用一个栈作为货架，把另一个栈当作临时的存储箱。当要往货架上添商品时，先把作为货架的栈中的元素全都压到作为存储箱的栈中，再把仓库中的元素压到存储箱中，然后再把存储箱中的所有元素都压到货架上，这样，就能保证快要过期的商品先被出售。-Problem description : Suppose a shop, which has a shelf and a warehouse, when the merchandise on the shelves less than a certain quantity of the number, a certain number from the warehouses of goods on the shelves, when the warehouse volume of goods is less than certain number, purchase goods warehouse filled, the goods according to the sale of commodity production to date, is about to expire first sale of goods. The solution : a two stack and a queue, queue as a warehouse, used as a stack shelves, and another stack as a temporary storage bins. When to go to the shelves Tim commodity, first as a stack shelves of all elements of the pressure storage tank as the stack, then the warehouse down to the storage element box, and then s