数据结构课程设计图书馆管理系统实验报告.doc

文档简介:

北京石油化工学院数据结构课程设计研究所课程设计实验报告所（系，系）: 信息工程学院名称: 吉141范文虎讲师签名: 2016年6月29日·北京目录设计主题·········· ················设计··························· ··············实验分工·································· ·························································· ························································ ·························································· ·························································· ··································· ························································· ·························································· ·························································· ·······························基本业务.

需要设计一种图书馆管理信息系统，以通过计算机仿真来实现上述系统功能. （1）该书的登记内容软件工作者应具备的科学工作方法和风格. 开发环境: VC6.0或DEVC ++. 实验分工范文虎: 总体程序框架构想，算法分析，主程序编写，子功能调用，图书信息记录存储子功能编写，组合，主控制面板编写，哈希函数，结构体定义.

算法实现，添加书信息子功能编写，借书词功能编写，查询子功能设计编写，返回书子功能设计编写，最终程序调试，编写报告. 算法实现，删除书籍子功能设计和编写，查找书籍信息子功能编写，测试整体程序，纠正程序缺陷，修改后最终合成程序. 算法实现，查询书信息子功能的设计与编写，程序缺陷的修改与测试. 对算法思想的分析采用线性表进行存储，充分利用其易于添加，易于删除图书管理系统课设，易于查找的特点，并编写满足主题需求的程序. 线性表是最基本，最简单和最常用的数据结构. 算法描述实现了数据结构类型定义typedefstruct {intyear;月份当天；}数据； typedefstruct {charnum [5]; //读取器编号记录databro; databack;} ReaderNode; typedefstruct {chartitle [15];字符编辑器[15]；并发;整体整型//书号ReaderNodereader [10]; //记录读者借书的记录} BookNode; typedefstruct {BookNode * elem;积分//记录节点总数} HashTable;算法流程图建立哈萨克斯坦希腊表删除功能添加功能搜索功能添加书增量子功能借书子功能添加书子功能视图添加书子功能返回书子功能查看借书子功能查找书子函数主要函数完成程序代码#include“ stdafx.h” #include #include #include #include #include #ESS1 #ESS0#defineDUPLICATE-1#defineNULL_KEY0 //没有记录元素inthashsize [] = {17,19,23,29}; //存储容量intm = 0; //表长度typedefstruct {intyear;月份当天；}数据； typedefstruct {charnum [5]; //读者ID记录数据bro; databack;} ReaderNode; typedefstruct {chartitle [15];字符编辑器[15]；即时整体整型intmore; //书号ReaderNodereader [10]; //记录内容摘自Taodou.com，请注明出处.

本文来自电脑杂谈，转载请注明本文网址：
http://www.pc-fly.com/a/jisuanjixue/article-178790-1.html