#include<stdio.h> #include<string.h> #include<stdlib.h> #define N 100 int iNumOfStu=0; struct score { float math; float english; float computer; }; struct student { int number; char name[20]; struct score sco; float average; }; struct student stu[N]; void print_menu(void);//輸出菜單 void choosemenu(void);//菜單選擇 void input_student1(int);//輸入學(xué)生信息 void input_student2(void);//輸入總函數(shù) void input_student3(int &,int);//判斷學(xué)號是否重復(fù) void input_student4(int,int);//覆蓋原信息 void sort_student3(student s[],int);//按照英語成績排序 void sort_student4(student s[],int);//按照計算機(jī)成績排序 void sort_student2(student s[],int);//按照數(shù)學(xué)成績排序 void sort_student5(student s[],int);//按照平均成績排序 float input_score2(int);//計算學(xué)生平均成績 void print_student2(void);//顯示表頭 void print_student3(int);//顯示學(xué)生信息 void print_student1(int);//顯示全部學(xué)生資料 void sort_student1(void);//排序總函數(shù) void menu(void);//菜單調(diào)度總函數(shù) int search_student2(int);//按學(xué)號查詢學(xué)生信息并輸出 void search_student3(int);//按平均分最高查詢并輸出 void search_student1(void);//查詢總函數(shù) void delete_student2(int,int);//刪除學(xué)生信息 void delete_student1(void);//刪除總函數(shù) void change_student2(int);//修改學(xué)生資料 void change_student1(void);//修改總函數(shù) void input_score3(int);//統(tǒng)計成績 void input_score1(void);//統(tǒng)計成績總函數(shù) void print_help(void);//輸出幫助信息 void exit_student(void);//退出系統(tǒng) void save_student(student *,int);//保存學(xué)生信息 void main() { menu(); } void save_student(student *s,int a)//保存學(xué)生信息 { FILE *fp; if((fp=fopen("d:\\學(xué)生信息.txt","wb"))==NULL) { printf("不能打開文件！\n"); } else { printf("保存信息到D盤\n"); fprintf(fp,"本班所有學(xué)生具體信息如下：\r\n"); fprintf(fp," 學(xué)號 姓名 數(shù)學(xué)成績 英語成績 計算機(jī)成績 平均成績\r\n"); for(int i=0;i<a;i++) { fprintf(fp,"%8d%12s%14.2f%14.2f%14.2f%14.2f\n",stu[i].number,stu[i].name,stu[i].sco.math,stu[i].sco.english,stu[i].sco.computer,stu[i].average); fprintf(fp,"\r\n"); } fclose(fp); printf("信息保存成功！\n"); } } void exit_student(void)//退出系統(tǒng) { exit(1); } void print_help(void)//輸出幫助信息 { printf("本系統(tǒng)所能容納的最大學(xué)生數(shù)為%d人\n學(xué)生信息保存在D盤根目錄下，保存文件為“學(xué)生信息.txt”。\n感謝使用！\n",N); } void input_score1(void)//統(tǒng)計成績總函數(shù) { int c; c=search_student2(iNumOfStu); printf("學(xué)號：%d\n",stu[c].number); printf("姓名：%s\n",stu[c].name); input_score3(c); printf("新成績錄入成功！\n"); stu[c].average=input_score2(c); } void input_score3(int a)//統(tǒng)計成績 { printf("數(shù)學(xué)新成績："); scanf("%f",&stu[a].sco.math); printf("英語新成績："); scanf("%f",&stu[a].sco.english); printf("計算機(jī)新成績："); scanf("%f",&stu[a].sco.computer); } void change_student2(int a)//修改學(xué)生資料 { printf("學(xué)號：%d----修改為：",stu[a].number); scanf("%d",&stu[a].number); getchar(); printf("姓名：%s----修改為：",stu[a].name); gets(stu[a].name); printf("數(shù)學(xué)成績：%.2f----修改為：",stu[a].sco.math); scanf("%f",&stu[a].sco.math); printf("英語成績：%.2f----修改為：",stu[a].sco.english); scanf("%f",&stu[a].sco.english); printf("計算機(jī)成績：%.2f----修改為：",stu[a].sco.computer); scanf("%f",&stu[a].sco.computer); } void change_student1(void)//修改總函數(shù) { int c; c=search_student2(iNumOfStu); getchar(); printf("是否要修改此學(xué)生信息？（“y”代表是）"); char d; scanf("%c",&d); if(d=='y'||d=='Y') { change_student2(c); stu[c].average=input_score2(c); printf("信息修改成功！\n"); } } void delete_student1(void)//刪除總函數(shù) { int c; c=search_student2(iNumOfStu); getchar(); printf("是否刪除此條記錄？（“y”代表是）"); char d; scanf("%c",&d); if(d=='y'||d=='Y') { delete_student2(c,iNumOfStu); printf("記錄已刪除！\n"); } } void delete_student2(int a,int b)//刪除學(xué)生信息 { for(int i=a;i<b-1;i++) { stu[i]=stu[i+1]; } --iNumOfStu; } void search_student1(void)//查詢總函數(shù) { printf("1、按學(xué)號查詢\n2、按平均分最高查詢\n請選擇："); int c; scanf("%d",&c); switch(c) { case 1: { search_student2(iNumOfStu); break; } case 2: { search_student3(iNumOfStu); break; } default: break; } } void menu(void)//菜單調(diào)度總函數(shù) { print_menu(); choosemenu(); } void sort_student1(void)//排序總函數(shù) { printf("1、按數(shù)學(xué)成績排序\n2、按英語成績排序\n3、按計算機(jī)成績排序\n4、按平均成績排序\n請選擇："); int c; scanf("%d",&c); switch(c) { case 1: { sort_student2(stu,iNumOfStu); break; } case 2: { sort_student3(stu,iNumOfStu); break; } case 3: { sort_student4(stu,iNumOfStu); break; } case 4: { sort_student5(stu,iNumOfStu); break; } default: break; } } void print_student1(int a)//顯示全部學(xué)生資料 { printf("本班所有學(xué)生具體信息如下\n"); print_student2(); for(int i=0;i<a;i++) { print_student3(i); } } void print_student3(int a)//顯示學(xué)生信息 { printf("%8d%12s%14.2f%14.2f%14.2f%14.2f\n",stu[a].number,stu[a].name,stu[a].sco.math,stu[a].sco.english,stu[a].sco.computer,stu[a].average); } void print_student2(void)//顯示表頭 { printf(" 學(xué)號 姓名 數(shù)學(xué)成績 英語成績 計算機(jī)成績 平均成績\n"); } void input_student4(int a,int b)//覆蓋原信息 { stu[a]=stu[b-1]; --iNumOfStu; } void input_student3(int &a,int b)//判斷學(xué)號是否重復(fù) { if(a!=0) { int i=0; do { if(stu[a].number==stu[i].number) { printf("此學(xué)號代表的學(xué)生已錄入\n1、覆蓋原信息\n2、重新輸入\n請選擇："); int c; scanf("%d",&c); switch(c) { case 1: { input_student4(i,iNumOfStu); a=iNumOfStu-1; printf("信息已替換！\n"); break; } case 2: { printf("請重新輸入學(xué)生信息：\n"); input_student1(iNumOfStu-1); break; } default: break; } break; } ++i; } while(i<b-1); } } void print_menu(void)//輸出菜單 { printf("======歡迎來到學(xué)生信息管理系統(tǒng)======\n"); printf(" 1、輸入學(xué)生資料\n"); printf(" 2、刪除學(xué)生資料\n"); printf(" 3、查詢學(xué)生資料\n"); printf(" 4、修改學(xué)生資料\n"); printf(" 5、顯示學(xué)生資料\n"); printf(" 6、統(tǒng)計學(xué)生成績\n"); printf(" 7、排序?qū)W生成績\n"); printf(" 8、保存學(xué)生資料\n"); printf(" 9、獲取幫助信息\n"); printf(" 10、退出系統(tǒng)\n"); printf("====================================\n"); printf("請選擇："); } void input_student2(void)//輸入總函數(shù) { char end; printf("請輸入學(xué)生信息（在最后一個學(xué)生信息錄入完成后以“/”結(jié)束錄入）：\n"); for(int i=0;(end=getchar())!='/';i++) { input_student1(i); ++iNumOfStu; input_student3(i,iNumOfStu); } for(int j=0;j<iNumOfStu;j++) { stu[j].average=input_score2(j); } } void input_student1(int a)//輸入學(xué)生信息 { printf("學(xué)號："); scanf("%d",&stu[a].number); getchar(); printf("姓名："); gets(stu[a].name); printf("數(shù)學(xué)成績："); scanf("%f",&stu[a].sco.math); printf("英語成績："); scanf("%f",&stu[a].sco.english); printf("計算機(jī)成績："); scanf("%f",&stu[a].sco.computer); } float input_score2(int a)//計算學(xué)生平均成績 { return (stu[a].sco.math+stu[a].sco.english+stu[a].sco.computer)/3; } void search_student3(int a)//按平均分最高查詢并輸出 { int max=0; for(int i=0;i<a;i++) { if(stu[max].average<stu[i].average) { max=i; } } print_student2(); print_student3(max); } void sort_student2(student s[],int a)//按照數(shù)學(xué)成績排序 { struct student temp; for(int i=0;i<a-1;i++) { int max=i; for(int j=i+1;j<a;j++) if(stu[j].sco.math>stu[max].sco.math) { max=j; } if(max!=i) { temp=stu[max]; stu[max]=stu[i]; stu[i]=temp; } } print_student2(); for(int k=0;k<a;k++) { print_student3(k); } } void sort_student3(student s[],int a)//按照英語成績排序 { struct student temp; for(int i=0;i<a-1;i++) { int max=i; for(int j=i+1;j<a;j++) if(stu[j].sco.english>stu[max].sco.english) { max=j; } if(max!=i) { temp=stu[max]; stu[max]=stu[i]; stu[i]=temp; } } print_student2(); for(int k=0;k<a;k++) { print_student3(k); } } void sort_student4(student s[],int a)//按照計算機(jī)成績排序 { struct student temp; for(int i=0;i<a-1;i++) { int max=i; for(int j=i+1;j<a;j++) if(stu[j].sco.computer>stu[max].sco.computer) { max=j; } if(max!=i) { temp=stu[max]; stu[max]=stu[i]; stu[i]=temp; } } print_student2(); for(int k=0;k<a;k++) { print_student3(k); } } void sort_student5(student s[],int a)//按照平均成績排序 { struct student temp; for(int i=0;i<a-1;i++) { int max=i; for(int j=i+1;j<a;j++) if(stu[j].average>stu[max].average) { max=j; } if(max!=i) { temp=stu[max]; stu[max]=stu[i]; stu[i]=temp; } } print_student2(); for(int k=0;k<a;k++) { print_student3(k); } } int search_student2(int a)//按照學(xué)號查找學(xué)生并輸出 { int num; int c; printf("請輸入要查詢的學(xué)號："); scanf("%d",&num); for(int i=0;i<a;i++) { if(num==stu[i].number) { c=i; } } printf("此學(xué)生的信息是：\n"); print_student2(); print_student3(c); return c; } void choosemenu(void)//菜單選擇 { int i; scanf("%d",&i); switch(i) { case 1: { input_student2(); printf("按回車鍵返回主菜單"); getchar(); getchar(); menu(); break; } case 2: { delete_student1(); printf("按回車鍵返回主菜單"); getchar(); getchar(); menu(); break; } case 3: { search_student1(); printf("按回車鍵返回主菜單"); getchar(); getchar(); menu(); break; } case 4: { change_student1(); printf("按回車鍵返回主菜單"); getchar(); getchar(); menu(); break; } case 5: { print_student1(iNumOfStu); printf("按回車鍵返回主菜單"); getchar(); getchar(); menu(); break; } case 6: { input_score1(); printf("按回車鍵返回主菜單"); getchar(); getchar(); menu(); break; } case 7: { sort_student1(); printf("按回車鍵返回主菜單"); getchar(); getchar(); menu(); break; } case 8: { save_student(stu,iNumOfStu); printf("按回車鍵返回主菜單"); getchar(); getchar(); menu(); break; } case 9: { print_help(); printf("按回車鍵返回主菜單"); getchar(); getchar(); menu(); break; } case 10: { exit_student(); } default: break; } } 運(yùn)行結(jié)果： 源文件下載地址： http://115.com/file/clnq138g#一個簡單的學(xué)生成績管理系統(tǒng).rar （請將此地址復(fù)制到瀏覽器地址欄中訪問下載頁面） #include<stdio.h> #include<string.h> #include<stdlib.h> #define N 100 int iNumOfStu=0; struct score { float math; float english; float computer; }; struct student { int number; char name[20]; struct score sco; float average; }; struct student stu[N]; void print_menu(void);//輸出菜單 void choosemenu(void);//菜單選擇 void input_student1(int);//輸入學(xué)生信息 void input_student2(void);//輸入總函數(shù) void input_student3(int &,int);//判斷學(xué)號是否重復(fù) void input_student4(int,int);//覆蓋原信息 void sort_student3(student s[],int);//按照英語成績排序 void sort_student4(student s[],int);//按照計算機(jī)成績排序 void sort_student2(student s[],int);//按照數(shù)學(xué)成績排序 void sort_student5(student s[],int);//按照平均成績排序 float input_score2(int);//計算學(xué)生平均成績 void print_student2(void);//顯示表頭 void print_student3(int);//顯示學(xué)生信息 void print_student1(int);//顯示全部學(xué)生資料 void sort_student1(void);//排序總函數(shù) void menu(void);//菜單調(diào)度總函數(shù) int search_student2(int);//按學(xué)號查詢學(xué)生信息并輸出 void search_student3(int);//按平均分最高查詢并輸出 void search_student1(void);//查詢總函數(shù) void delete_student2(int,int);//刪除學(xué)生信息 void delete_student1(void);//刪除總函數(shù) void change_student2(int);//修改學(xué)生資料 void change_student1(void);//修改總函數(shù) void input_score3(int);//統(tǒng)計成績 void input_score1(void);//統(tǒng)計成績總函數(shù) void print_help(void);//輸出幫助信息 void exit_student(void);//退出系統(tǒng) void save_student(student *,int);//保存學(xué)生信息 void main() { menu(); } void save_student(student *s,int a)//保存學(xué)生信息 { FILE *fp; if((fp=fopen("d:\\學(xué)生信息.txt","wb"))==NULL) { printf("不能打開文件！\n"); } else { printf("保存信息到D盤\n"); fprintf(fp,"本班所有學(xué)生具體信息如下：\r\n"); fprintf(fp," 學(xué)號 姓名 數(shù)學(xué)成績 英語成績 計算機(jī)成績 平均成績\r\n"); for(int i=0;i<a;i++) { fprintf(fp,"%8d%12s%14.2f%14.2f%14.2f%14.2f\n",stu[i].number,stu[i].name,stu[i].sco.math,stu[i].sco.english,stu[i].sco.computer,stu[i].average); fprintf(fp,"\r\n"); } fclose(fp); printf("信息保存成功！\n"); } } void exit_student(void)//退出系統(tǒng) { exit(1); } void print_help(void)//輸出幫助信息 { printf("本系統(tǒng)所能容納的最大學(xué)生數(shù)為%d人\n學(xué)生信息保存在D盤根目錄下，保存文件為“學(xué)生信息.txt”。\n感謝使用！\n",N); } void input_score1(void)//統(tǒng)計成績總函數(shù) { int c; c=search_student2(iNumOfStu); printf("學(xué)號：%d\n",stu[c].number); printf("姓名：%s\n",stu[c].name); input_score3(c); printf("新成績錄入成功！
標(biāo)簽： c語言
上傳時間： 2019-06-09
上傳用戶：啊的撒旦
《計算機(jī)操作系統(tǒng)課程設(shè)計》教學(xué)大綱 課程名稱：計算機(jī)操作系統(tǒng) 學(xué)時（周）：10 學(xué)分：1 課程英文名稱：Operating System of computer 課程類別：專業(yè)基礎(chǔ)課 適用專業(yè)：計算機(jī)科學(xué)與技術(shù)、軟件工程 一、課程設(shè)計的目的 操作系統(tǒng)課程設(shè)計是操作系統(tǒng)課程的重要實(shí)踐性環(huán)節(jié)。通過課程設(shè)計，可以加深學(xué)生對課堂中所講授內(nèi)容的理解，培養(yǎng)學(xué)生的系統(tǒng)開發(fā)能力，加強(qiáng)學(xué)生的項目經(jīng)驗，使學(xué)生初步具有研究、設(shè)計、編制和調(diào)試操作系統(tǒng)模塊的能力。 二、課程設(shè)計方式 1、課程設(shè)計題目的選定 采用指導(dǎo)教師提供參考題目學(xué)生自行選定課程設(shè)計題目。每2~3人為一組，但課程設(shè)計報告不得雷同，否則判定成績?yōu)?。 2、課程設(shè)計任務(wù)的完成 在指導(dǎo)教師的指導(dǎo)下，每組學(xué)生共同完成課題的分析，并做好分工，在此基礎(chǔ)上完成自己那部分工作的設(shè)計、代碼編寫和調(diào)試，獨(dú)立撰寫課程設(shè)計報告。所有工作任務(wù)主要在實(shí)驗室完成。 三、基本要求 課程設(shè)計教學(xué)方法：主要以學(xué)生上機(jī)操作為主，教師指導(dǎo)為輔 課程設(shè)計要求： 1、對系統(tǒng)進(jìn)行功能分解、模塊分析、控制模塊分析正確 2、選擇合適的操作系統(tǒng)原理所需要數(shù)據(jù)結(jié)構(gòu)以及相應(yīng)的算法 3、程序規(guī)模適中，盡可能的使系統(tǒng)的功能更加完善和全面 4、掌握程序調(diào)試的方法 5、說明書、流程圖要清楚，闡明設(shè)計思路。 6、撰寫課程設(shè)計報告。按格式要求寫出完整、規(guī)范的報告并打印。其中模塊圖、流程圖要清楚、規(guī)范。
標(biāo)簽： 計算機(jī)操作系統(tǒng) 設(shè)計指導(dǎo)
上傳時間： 2019-06-24
上傳用戶：aoye
During the past two decades, technological development related to telecommuni- cation technologies has allowed organizations of all types and size to be able to de- velop effective networking applications in support of information management. Fur- thermore, telecommunication technologies combined with computer technology have created the foundation of modern information technology which has affected all as- pects of societal and organizational functions in our modern world.
標(biāo)簽： Telecommunications Cases on
上傳時間： 2020-05-26
上傳用戶：shancjb
This introduction takes a visionary look at ideal cognitive radios (CRs) that inte- grate advanced software-defined radios (SDR) with CR techniques to arrive at radios that learn to help their user using computer vision, high-performance speech understanding, global positioning system (GPS) navigation, sophisticated adaptive networking, adaptive physical layer radio waveforms, and a wide range of machine learning processes.
標(biāo)簽： Technology Cognitive Radio
上傳時間： 2020-05-26
上傳用戶：shancjb
Designing for Networked Communications: Strategies and Development is a book about how we plan, use, and understand the products, dynamic social processes, and tasks upon which depend some of the most vital innovations in the knowledge society—social as well as technological ones. Focusing on various forms of design, implementation, and integration of computer-mediated communication (CMC), the book bridges the academic fields of computer science and communication stud- ies.
標(biāo)簽： Communications Designing Networked for
上傳時間： 2020-05-27
上傳用戶：shancjb
Much of Game Theory has developed within the community of Economists, starting from the book “Theory of Games and Economic behavior” by Mor- genstern and Von Neumann (1944). To a lesser extent, it has had an impact on biology (with the development of evolutionarygames) and on road traffic Engi- neering (triggered by the concept of Wardrop equilibrium introduced already in 1952 along with the Beckmann potential approach introduced in 1956). Since 1999 game theory has had a remarkable penetration into computer sci- ence with the formation of the community of Algorithmic game theory.
標(biāo)簽： Distributed Strategic Learning
上傳時間： 2020-05-27
上傳用戶：shancjb
With the rapid expansion of wireless consumer products,there has been a con- siderable increase in the need for radio-frequency (RF) planning, link plan- ning, and propagation modeling.A network designer with no RF background may find himself/herself designing a wireless network. A wide array of RF planning software packages can provide some support, but there is no substi- tute for a fundamental understanding of the propagation process and the lim- itations of the models employed. Blind use of computer-aided design (CAD) programs with no understanding of the physical fundamentals underlying the process can be a recipe for disaster. Having witnessed the results of this approach, I hope to spare others this frustration.
標(biāo)簽： Introduction Propagation to RF
上傳時間： 2020-05-27
上傳用戶：shancjb
This book presents millimeter wave communication system design and analysis at the level to produce an understanding of the interaction between a wireless system and its front end so that the overall performance can be predicted. Gigabit wireless commu- nications require a considerable amount of bandwidth, which can be supported by millimeter waves. Millimeter wave technology has come of age, and at the time of writing the standards of IEEE 802.15.3c, WiGig, Wireless HD TM , and the European Computer Manufacturers Association have recently been finalized.
標(biāo)簽： Communication Millimeter Systems Wave
上傳時間： 2020-05-28
上傳用戶：shancjb
Do you have a mobile phone? We think you probably do, one way or another. We would also guess that you might use it for many diff erent things in the course of your everyday life—as a telephone certainly, but also as an address book, as a clock or watch, as a camera, or now as a connection to your computer, email and the internet. Th ere will be a range of people you use it to contact (or not), and various strategies you use to take calls—or send texts, or take photos, or receive emails, or search online (or not, in diff erent situations). Th ere are also likely to be a range of social relation- ships in your life that your mobile phone helps to maintain—or disrupts, or inter- venes in, or makes possible, or complicates, or just plain helps to handle.
標(biāo)簽： Communications Introduction Mobile Media New An to
上傳時間： 2020-05-30
上傳用戶：shancjb
In general there are three different techniques for performance evaluation of systems and networks: mathematical analysis, measurements, and computer simulation. All these techniques have their strength and weaknesses. In the literature there are plenty of discussions about when to use which technique, how to apply it, and which pitfalls are related to which evaluation technique.
標(biāo)簽： Simulation Modeling Network Tools and for
上傳時間： 2020-05-31
上傳用戶：shancjb
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
