欢迎来到天天文库
浏览记录
ID:56903259
大小:87.00 KB
页数:15页
时间:2020-07-21
《教师评学管理系统.doc》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库。
1、教师评学管理系统:(上传时间:2012/7/17)注:本题目源码仅供参考,直接套用者后果自负。涉及知识:运算符重载、链表、友元、输入输出流等。####GUIDIAN####要求:该系统主要处理教师评学信息。班级信息主要包括:班级编号、班级名称、所在院系、评学成绩等内容。教师信息主要包括:编号、姓名、电话等内容。完成以下的操作:班级信息、教师信息、评学信息的录入、修改、删除和查询。提示:建立学校类、教师类、班级类、评学类学校、教师、班级、评学信息的初始化学校、教师、班级、评学信息的添加、修改、删除、查找学校、教师、班级、
2、评学信息的输出对评学信息按评学成绩排序使用方法:按照注释分别加入到各个头文件中。附录:源程序//ChainChart.h#ifndefCHAINCHART_H#defineCHAINCHART_H#include"School.h"//链表类classNode{public:Matem;Teachert;Schools;Evaluatee;Node*next;};classList{private:charSchool[32];charName[32];charTel[32];intNumber;intMark;pub
3、lic:Node*head;List();boolTof();//判断dvoidPaixu();//排序dvoidDel();//删除dvoidAdd();//增加dvoidFind();//查询dvoidFix();//修改dvoidInsert();//插入dvoidPrint();//打印dintLength();//长度判断dvoidSave();//保存dvoidLoad();//载入d};#endif//school.h#ifndefSCHOOL_H#defineSCHOOL_H//学校类#include<
4、ostream.h>classMate{private:charDepartment[32];doubleMark;public:charName[32];intNumber;voidSet();voidShow();voidSet(float);friendostream&operator<<(ostream&stream,Mate&m){cout<5、e:charTel[32];public:intNumber;charName[32];voidShow();voidSet(char*,char*,int);friendostream&operator<<(ostream&stream,Teacher&t){cout<6、ream&operator<<(ostream&stream,School&s){cout<7、ChainChart.h"#include"School.h"#include#include#includeList::List(){head=newNode;head->next=NULL;};boolList::Tof()//判断是否继续输入{chartof;cout<<"*************继续输入信息?yes:yno:n*************"<>tof;if(tof=='n'){returntrue;}elseif(t8、of=='y'){returnfalse;}else{returnTof();}};intList::Length()//求链表的长度{intsum=0;Node*cur;cur=head->next;while(cur!=NULL){cur=cur->next;sum++;}returnsum;};voidList::Add()
5、e:charTel[32];public:intNumber;charName[32];voidShow();voidSet(char*,char*,int);friendostream&operator<<(ostream&stream,Teacher&t){cout<6、ream&operator<<(ostream&stream,School&s){cout<7、ChainChart.h"#include"School.h"#include#include#includeList::List(){head=newNode;head->next=NULL;};boolList::Tof()//判断是否继续输入{chartof;cout<<"*************继续输入信息?yes:yno:n*************"<>tof;if(tof=='n'){returntrue;}elseif(t8、of=='y'){returnfalse;}else{returnTof();}};intList::Length()//求链表的长度{intsum=0;Node*cur;cur=head->next;while(cur!=NULL){cur=cur->next;sum++;}returnsum;};voidList::Add()
6、ream&operator<<(ostream&stream,School&s){cout<7、ChainChart.h"#include"School.h"#include#include#includeList::List(){head=newNode;head->next=NULL;};boolList::Tof()//判断是否继续输入{chartof;cout<<"*************继续输入信息?yes:yno:n*************"<>tof;if(tof=='n'){returntrue;}elseif(t8、of=='y'){returnfalse;}else{returnTof();}};intList::Length()//求链表的长度{intsum=0;Node*cur;cur=head->next;while(cur!=NULL){cur=cur->next;sum++;}returnsum;};voidList::Add()
7、ChainChart.h"#include"School.h"#include#include#includeList::List(){head=newNode;head->next=NULL;};boolList::Tof()//判断是否继续输入{chartof;cout<<"*************继续输入信息?yes:yno:n*************"<>tof;if(tof=='n'){returntrue;}elseif(t
8、of=='y'){returnfalse;}else{returnTof();}};intList::Length()//求链表的长度{intsum=0;Node*cur;cur=head->next;while(cur!=NULL){cur=cur->next;sum++;}returnsum;};voidList::Add()
此文档下载收益归作者所有