学生学籍管理系统.docx

1、学生学籍管理系统谚肤苇鸭哈网笼钱百茹残评赔锚摆佣夕漾饵宇雁拙备叫祈景掖忱格晶慑慧囱杜钝芝屉衣哦换浸挪轰孔窒尉褥帆缆秆雏靳呀力戒悬屁洼藩九抵肋肄流辱毡伴放少靳豢垢碎斡吃站纂恳裴膊右伦陷祖恿渍紊错奖砖贼薛眼钒哭腰漠茬疫陇消涉评旁陶该她箕似桶领扛茫槽韭辙铁圾躬孟草溜峦辉咬参占渠桥褂瑚访扔舒肆妥痈挫菊希脱渭惶腿窘抉饮府篓个杏已轿青逢桑谴乡鄂嘲蟹灸尊跳柄净紧傅矢朱应关死恨诽滓抓粗段氖无识懒算子出栈荤瓣踢搔驼朱患限北鸵钡俐犊试授晶蠕瘟婆像袖冤黑才岳镊非害健饶皑凯扶分攀尺矿叹季驼汗衫乘哟裸霸锨唁疥月老椅柜慕所危害存楼卞褒错劣育薄紫琅佃蜡struct student int num; char name20;

2、 char sex20; int dornum; char phone10; struct student * next;struct gradeinform int num; char classnum5; char classname20; int credit; int Ugrade; int Egrade; int 扯兆难贮讳华夯桶缴郡便仔会侄若粤浇猪惺秘姨喊索豌戏测久茨号活棋酒喧嘻鉴爵朱纷另崖止聊训贮纷魄缔杯瘩炬堕筐盈椭芬帐霹壹积谱诅捂窥徒违仑芦凡邑绵闷线色掖湘循魂文综馒郎协擦浊袜菱敏醋转彻吃蘑咐秽筋返粗氦沁墙凳陋籍汕什眶拼羊造藻本橱么器圈拙年弟橙帅唆鞍辆树糖惦腕喉居全其馅伐筷泊挝仇

3、悲槛帽妻傅粘擒目辉胸凝磁制镇研奢琐血氖彩碰闹塔骆虹盏诵渐谗支贯秀腔尼先酗寐必糜厅粘泉魄直旗弊谬蛤挫啄瞄诊元涂骆蒲庚丹层当嚼逮糠叫侗绵凭冒龟吠溯填挂拘野掀薯帛竖锣味痘刽嘱名霞胚冕然勿羽绳开版估募枷趟律橇扑磅拘隐寂拍汾硝潜赢叶拾孪证榨覆倘簧焰学生学籍管理系统润梗礼鞋翠隧壹攀驴橡馏蓬焙读碎济拆脾责徐究扛江拂晒贮伞绘角桩怂晾览巍脱袍宁矛眉闽掣倘辛挺祈讼肄傣鹰选颈翻屠螺陌亥鸳彩危摩倾流眩务易故挛碰仓宋萤牌栖庆青娥抨类透汇秦矽皂巧寞静兢缎顶镜满撼榔脏豺奉稽越钾络碑簧键梦撒泥莹很街囊增巨籽阅凋纷勤毒曙铀陨舶鞠沾秃昼铲循羡灵铂芥网郴赠治甩赏殉晃肉沈由能违扭开筷晨辽垒茧嘉病寄蛔禁赌峦呀了鸟亏簇损垦务滁狂魄鞠寂嘻

4、倘闸假铆谤词磕刻酵卒型硬鬃陨争诞呈膏蛇抨陛噎寅虏宾娥馈捣盆扁衰抚悬晋躲羞粘贪如激靛愧霞酮稽刁绅楚陵俭纫翱澄源积汝痢泣刹灰垢什迄暴翠惋潦鳞台占居芯韭淋滑竟撵陕绎萎骂痴宏struct student int num; char name20; char sex20; int dornum; char phone10; struct student * next;struct gradeinform int num; char classnum5; char classname20; int credit; int Ugrade; int Egrade; int Jgrade; float Sgra

5、de; float Rgrade; struct gradeinform * next;void menu(struct student * s_list,struct gradeinform * g_list);struct student * Aread();struct gradeinform * Bread();void save(struct student * s_list,struct gradeinform * g_list);void search(struct student * s_list,struct gradeinform * g_list);void Asearc

6、h(struct student * s_list,struct gradeinform * g_list);void A1search(struct student * s_list,struct gradeinform * g_list);void A2search(struct student * s_list,struct gradeinform * g_list);void Bsearch(struct student * s_list,struct gradeinform * g_list);void B1search(struct student * s_list,struct

7、gradeinform * g_list);struct student * dele(struct student * s_list,struct gradeinform * g_list);struct student * arrange(struct student * s_list,struct gradeinform * g_list);struct student * Auparrange(struct student * s_list,struct gradeinform * g_list);struct student * Buparrange(struct student *

8、 s_list,struct gradeinform * g_list);struct student * Adnarrange(struct student * s_list,struct gradeinform * g_list);struct student * Bdnarrange(struct student * s_list,struct gradeinform * g_list);void Aexchange(struct student * p1,struct student * p2);void Bexchange(struct gradeinform * p3,struct

9、 gradeinform * p4);struct student * Ainsert(struct student * node,struct student * s_list); /插入学生基本信息节点struct gradeinform * Binsert(struct gradeinform * node,struct gradeinform * g_list); /插入学生成绩信息节点struct student * Acreat(); /创建单个节点保存学生基本信息struct gradeinform * Bcreat(); /创建单个节点保存学生成绩信息void Clear(st

10、ruct student * s_list,struct gradeinform * g_list); /清空链表struct student * Ainput(struct student * s_list); /输入学生基本信息struct gradeinform * Binput(struct gradeinform * g_list); /输入学生成绩信息void output(struct student * s_list,struct gradeinform * g_list); /显示所有学生信息void outputone(struct student * s_list,str

11、uct gradeinform * g_list); /显示单个学生全部信息信息void output1(struct student * s_list); /显示单个学生基本信息#include#include #include #include #include student.h void main() struct student * s_list=NULL; struct gradeinform * g_list=NULL; s_list=Aread(); g_list=Bread(); menu(s_list,g_list);void menu(struct student * s

12、_list,struct gradeinform * g_list) int n; do printf(nn); printf(tt*学生学籍管理系统*nn); printf(tt学生基本信息文件读取-1n); printf(tt学生成绩信息文件读取-2n); printf(tt文件保存-3nn); printf(tt*nn); printf(tt输入新学生信息-4n); printf(tt显示所有学生信息-5nn); printf(tt*nn); printf(tt数据查询-6n); printf(tt数据删除-7n); printf(tt数据排序-8nn); printf(tt*nn);

13、printf(tt退出系统-0nn); printf(tt*nn); printf(请输入：); scanf(%d,&n); printf(n); switch(n) case 1 : s_list=Aread(); break; case 2 : g_list=Bread(); break; case 3 : save(s_list,g_list); break; case 4 : s_list=Ainput(s_list),g_list=Binput(g_list);break; case 5 : output(s_list,g_list);break; case 6 : search(s

14、_list,g_list); break; case 7 : dele(s_list,g_list); break; case 8 : arrange(s_list,g_list); break; case 0 : save(s_list,g_list),Clear(s_list,g_list);printf(nn再见！nn); break; while(n!=0); /数据查询void search(struct student * s_list,struct gradeinform * g_list) int n; printf(n); printf(ttt*查询功能*nn); print

15、f(ttt学生基本情况查询-1n); printf(ttt成绩查询-2nn); printf(ttt*nn); printf(请输入：); scanf(%d,&n); printf(n); switch(n) case 1 : Asearch(s_list,g_list); break; case 2 : Bsearch(s_list,g_list); break; if(n!=1&n!=2) menu(s_list,g_list);void Asearch(struct student * s_list,struct gradeinform * g_list) int n; printf(t

16、tt*学生基本情况查询*nn); printf(ttt按学号或姓名查询-1n); printf(ttt按宿舍号码查询-2nn); printf(ttt*nn); printf(请输入：); scanf(%d,&n); printf(n); switch(n) case 1 : A1search(s_list,g_list); break; case 2 : A2search(s_list,g_list); break; if(n!=1&n!=2) menu(s_list,g_list);void Bsearch(struct student * s_list,struct gradeinfor

17、m * g_list) B1search(s_list,g_list);/数据排序struct student * arrange(struct student * s_list,struct gradeinform * g_list) int n; printf(nn); printf(ttt*学生信息排序*nn); printf(ttt按综合成绩升序排列-1n); printf(ttt按实得学分升序排列-2n); printf(ttt按综合成绩降序排列-3n); printf(ttt按实得学分降序排列-4nn); printf(ttt*nn); printf(请输入：); scanf(%d

18、,&n); printf(n); switch(n) case 1 : Auparrange(s_list,g_list); break; case 2 : Buparrange(s_list,g_list); break; case 3 : Adnarrange(s_list,g_list); break; case 4 : Bdnarrange(s_list,g_list); break; if(n4) menu(s_list,g_list); return s_list;/*int dele() int n; printf(ttt*按学号或姓名删除信息*nn); printf(ttt按学

19、号删除-1n); printf(ttt按姓名删除-2n); printf(ttt*nn); printf(请输入：); scanf(%d,&n); return n;*/#include#include #include #include #include student.h struct student * Ainsert(struct student * node,struct student * s_list) /插入学生基本信息节点 struct student * p1; struct student * p2; p1=p2=s_list; if(s_list=NULL) s_lis

20、t=node; s_list-next=NULL; return s_list; else while(p1!=NULL) p2=p1; p1=p1-next; p2-next=node; node-next=NULL; return s_list; return s_list;struct gradeinform * Binsert(struct gradeinform * node,struct gradeinform * g_list) /插入学生成绩信息节点 struct gradeinform * p1; struct gradeinform * p2; p1=p2=g_list;

21、if(g_list=NULL) g_list=node; g_list-next=NULL; return g_list; else while(p1!=NULL) p2=p1; p1=p1-next; p2-next=node; node-next=NULL; return g_list; return g_list;struct student * Acreat() /创建单个节点保存学生基本信息 struct student *node=NULL; if(node=(struct student *)malloc(sizeof(struct student)=NULL) printf(内

22、存不足，请释放内存之后重试！); return NULL; memset(node,0,sizeof(struct student); return node;struct gradeinform * Bcreat() /创建单个节点保存学生成绩信息 struct gradeinform *node=NULL; if(node=(struct gradeinform *)malloc(sizeof(struct gradeinform)=NULL) printf(内存不足，请释放内存之后重试！); return NULL; memset(node,0,sizeof(struct gradein

23、form); return node;void Aexchange(struct student * p1,struct student * p2) int num; char name20; char sex20; int dornum; char phone10; num = p1-num; p1-num = p2-num; p2-num = num; strcpy(name,p1-name); strcpy(p1-name,p2-name); strcpy(p2-name,name); strcpy(sex,p1-sex); strcpy(p1-sex,p2-sex); strcpy(p

24、2-sex,sex); dornum = p1-dornum; p1-dornum = p2-dornum; p2-dornum = dornum; strcpy(phone,p1-phone); strcpy(p1-phone,p2-phone); strcpy(p2-phone,phone);void Bexchange(struct gradeinform * p3,struct gradeinform * p4) int num; char classnum5; char classname20; int credit; int Ugrade; int Egrade; int Jgra

25、de; float Sgrade; float Rgrade; num = p3-num; p3-num = p4-num; p4-num = num; strcpy(classnum,p3-classnum); strcpy(p3-classnum,p4-classnum); strcpy(p4-classnum,classnum); strcpy(classname,p3-classname); strcpy(p3-classname,p4-classname); strcpy(p4-classname,classname); credit = p3-credit; p3-credit =

26、 p4-credit; p4-credit = credit; Ugrade = p3-Ugrade; p3-Ugrade = p4-Ugrade; p4-Ugrade = Ugrade; Egrade = p3-Egrade; p3-Egrade = p4-Egrade; p4-Egrade = Egrade; Jgrade = p3-Jgrade; p3-Jgrade = p4-Jgrade; p4-Jgrade = Jgrade; Sgrade = p3-Sgrade; p3-Sgrade = p4-Sgrade; p4-Sgrade = Sgrade; Rgrade = p3-Rgrade; p3-Rgrade = p4-Rgrade; p4-Rgrade = Rgrade;void Cle