这是继一之后的第2个管理信息系统的案例 很不错的 大家来看看吧...

分布式数据库系统 清华大学研究生课程讲义、课件等相关资料-Distributed Database System, Tsinghua University graduate student lecture courses, courseware and other related information

its about the radix sort technique

一个数据库课程设计里报刊订阅管理系统，包含几个角色用户，系统管理员，投递员， 有网页形式显示的界面

纯C写的48位软件模拟浮点运算,可移植 测试版，V0.0000.01 需进一步测试及优化-Written in pure C software simulation of 48 floating-point operations can be transplanted beta, V0.0000.01 need further testing and optimization

抽奖小玩意,我的简单vf应用!-plaything of the draw, I use a simple vf!

在9（3*3）个方格的方阵中填入数字1到N(N>=10)内的某9个数字 每个方格填一个整数，要求相邻两个方格的两个整数之和为质数。 试求所有的解-in 9 (3* 3) grid matrix to fill out a number of N (Ngt; = 10) of a nine figures each box filled an integral require two adjacent box at the two integral to the quality and number. Examination for all solutions

c++写的一个关于数据结构大整数的问题,相信会给喜欢数据结构的朋友们带来帮助!-c write data on the structure of a large sum of the problem, I believe, would like the data structure to help bring friends!

数据结构实验报告等综合内容-comprehensive report contents

学生初学，c实现约瑟夫环(圆桌问题)，算法应该不是很高效，望各位高人看了改进改进！-beginner students, c achieve Joseph Central (round table), the algorithm should not be very efficient, a person looking to improve reading improvement!

约瑟夫环 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。（有详细注解）数据结构学习的好例子-Joseph ring known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people reported a few, a few of the m out of that person him from one of the next person to start off, a few m to another person out and so the law of repetition until around round-table All of the people out. (Detailed notes) data structure to learn a good example of