计算机软件技术实验报告

计算机软件技术基础实验报告实验一代码：//编写于VC6.0环境下#include "iostream"#include <conio.h>// 程序实现有各种方法，这里给出一个实例。

// 定义一个线性表const int nMaxSize = 15; // 最大值int nLen = 0; // 表中元素个数int nLinearList[nMaxSize];// 定义操作void LSort();void LOut();void LInsert(int n);void LDelete(int n);void main(){// 输入数据并放入线性表中printf("Please input data\n"); // std::cout << "Please input data\n";int nIn = 0;for (int i = 0; i <= 9; i++){scanf("%d",&nIn); // std::cin >> nIn;nLinearList[i] = nIn;nLen++;}LSort();// 排序线性表LOut(); // 输出结果printf("Please input a data to insert \n");scanf("%d",&nIn);LInsert(nIn); // 输入一个数字，并插入到线性表中LOut();LSort();printf("sorted:\n");LOut();while(1){printf("Please input a number of data to delete \n");scanf("%d",&nIn);if (nIn>nLen)printf("number must less than %d\n",nLen);elsebreak;}LDelete(nIn); // 输入一个数字，并从线性表中删除LOut();char chTmp;printf("Please input a char to finish this program.");chTmp = getch();}void LSort() // 冒泡排序,由大到小{int i,j,temp;for (j=0;j<nLen;j++){for (i=0;i<nLen;i++){if (nLinearList[i]<nLinearList[i+1]){temp=nLinearList[i];nLinearList[i]=nLinearList[i+1];nLinearList[i+1]=temp;}}}}void LOut(){printf( "\n");for (int i = 0; i <= nLen; i++){printf( "%d, ", nLinearList[i] );}printf( "\n");}void LInsert(int k){int i,j;while(1){printf("number of the place：");scanf("%d", &j);if (j>nLen)printf("place number must less than %d\n",nLen);elsebreak;}for(i = nLen; i >= j ; --i)nLinearList[i] =nLinearList[i - 1];nLinearList[j-1] = k;nLen++;}void LDelete(int m){int i;for(i = m; i <= nLen; ++i)nLinearList[i-1] = nLinearList[i];nLen--;}代码：//编写于VC6.0环境下#include <stdio.h>#include <String.h>#include <stdlib.h>#include <math.h>const int MAX_LEN = 10; // 字符串的长度const int MAX_SIZE = 30; // 栈或队的最大元素个数// 定义一个队列的结构struct QUEUE {int nMaxSize; // 最大值int nCount; // 个数int nFront; // 头int nRear; // 尾char szQueue[MAX_SIZE][MAX_LEN];};//定义一个栈的结构struct STACK {int nMaxSize; // 最大值int nTop; // 栈顶char szStack[MAX_SIZE][MAX_LEN];};// 队列的操作void InitQueue(QUEUE *q,int nMaxSize){q->nMaxSize=nMaxSize;q->nCount=0;q->nFront=0;q->nRear=0;q->szQueue[MAX_SIZE][MAX_LEN]=0;}void InQueue(QUEUE *q, char *pItem){if(q->nCount==q->nMaxSize){printf("Queue is full!\n");return;}strcpy(q->szQueue[q->nRear],pItem);if(q->nRear++==MAX_SIZE)q->nRear=0;q->nCount++;}void OutQueue(QUEUE *q, char *pItem) {if(q->nCount==0){printf("Queue is empty!\n");return;}strcpy(pItem,q->szQueue[q->nFront]);if(q->nFront++==MAX_SIZE)q->nFront=0;q->nCount--;}//栈的操作void InitStack(STACK *s,int nMaxSize) {s->nMaxSize=nMaxSize;s->nTop=0;s->szStack[MAX_SIZE][MAX_LEN]=0; }void PushStack(STACK *s, char *pItem) {char *p;if (s->nTop<s->nMaxSize){p=s->szStack[s->nTop];strcpy(p,pItem);s->nTop++;}else{printf("stack overflow!\n");return;}}void PopStack(STACK *s, char *pItem) {char *p;if (s->nTop==0){printf("stack is empty!\n");return;}else{p=s->szStack[--s->nTop];strcpy(pItem,p);}}void GetTopStack(STACK *s, char *pItem){char *p;char a[10]={0};if (s->nTop==0){a[0]=';';strcpy(pItem,a);}else{p=s->szStack[s->nTop-1];strcpy(pItem,p);}}//字符判断int isdigit(char x){if (x>='0'&&x<='9')return 1;return 0;}int Priority(char *op); // 获得操作符的优先级void Compute(char *num1, char *num2, char *op, char *chResult); // 计算表达式的值//主函数void main(){char x[MAX_LEN]; // 扫描的表达式char op[MAX_LEN]; // 栈顶运算符char num1[MAX_LEN], num2[MAX_LEN]; // 两个操作数char chResult[MAX_LEN]; // 运算结果// ***声明一个队列struct QUEUE q1;struct QUEUE *q;// ***声明OS栈和NS栈struct STACK OS;struct STACK NS;struct STACK *o;struct STACK *n;int i=0;int j=0;int k=0;//****初始化q=&q1;o=&OS;n=&NS;InitStack(o,20);InitStack(n,20);InitQueue(q,20);printf("please input the expression end with \";\" \n");//录入表达式do{printf("next\n");scanf("%s",x);InQueue(q,x);}while(x[0]!=';');printf("expression \n");while (true){if (q->nCount!=0){OutQueue(q, x);printf("%s",x);}if (isdigit(x[0])) // 是数PushStack(n,x);else // 认为是运算符，没有考虑空格等{GetTopStack(o,op); // 获得OS栈顶运算符if (x[0] == ';' && op[0] == ';') // 扫描结束{ printf("\n result is ");break;}if (Priority(x) > Priority(op)) // 运算符的优先级〉栈顶运算符{PushStack(o,x);continue;}while ((Priority(x) <= Priority(op))&&Priority(op)) // 不大于栈顶运算符{PopStack(n,num1);PopStack(n,num2);PopStack(o,op);Compute(num2,num1,op,chResult);PushStack(n,chResult);GetTopStack(o,op);}PushStack(o,x);}}PopStack(n,chResult);printf("%s\n",chResult);}int Priority(char *op ){int nPriority = 0;switch (op[0]){case '^':nPriority = 3;break;case '*':case '/':nPriority = 2;break;case '+':case '-':nPriority = 1;break;case ';':nPriority = 0;}return nPriority;}void Compute(char *num1, char *num2, char *op, char *chResult) {double fNum1,fNum2;double fResult = 0;fNum1 = atof(num1);fNum2 = atof(num2);switch (op[0]){case '^':fResult = pow(fNum1,fNum2);break;case '*':fResult = fNum1*fNum2;break;case '/':fResult = fNum1/fNum2;break;case '+':fResult = fNum1+fNum2;break;case '-':fResult = fNum1-fNum2;break;}sprintf(chResult,"%.4f",fResult); //把计算的结果转化为字符串return;}运行结果实验三1.查询学生出生日期2.按学号顺序查询一个班级的所有学生(Class, Sname)；3.列出学生选择各门课程的成绩(Sname, Cname, Grade) ；4.列出有过不及格成绩的学生名单(Sno, Sname, Class);5.求学生的平均成绩和总成绩(Sname, PJCJ, ZCJ)；6.查找各科成绩都>= 85 分的学生(Sname, Class)；7.将课程号为“01”的课程名称修改为“软件技术”8.修改一名学生的姓名、性别、年龄；9.将成绩为55~59分的男生的成绩修改为60分10.删除90年以后、80年以前出生的学生的所有信息(包括选课和成绩)11.删除一个班级的所有学生12.删除所有数据表和数据库程序CREATE DATABASE MyDB1CREATE TABLE stub(Sno CHAR(8)PRIMARY KEY,SNAME CHAR(10),Sex CHAR(2),Age int,Birthday datetime,class CHAR(10)); Create table Courseb (Cno char(2) primary key,Cname char(10) ,Chour int);Create table Scoreb (Sno char(8),CnO char(2),Grade int,Primary key (Sno,CnO),Foreign key (Sno) references Stub(Sno),Foreign key (CnO) references Courseb(CnO)); Insert into stub (Sno,sname,sex,age,birthday,class )values ('20092500','zhangli','m','20','19900221','4');Insert into stub (Sno,sname,sex,age,birthday,class )values ('20092501','wuhaode','m','21','19890320','4');Insert into stub (Sno,sname,sex,age,birthday,class )values ('20092502','xuronggang','m','21','19891220','4')Insert into stub (Sno,sname,sex,age,birthday,class )values ('20092503','xuweim','m','20','19900224','4');Insert into stub (Sno,sname,sex,age,birthday,class )values ('20092504','yangbing','m','20','19900212','4');Insert into stub (Sno,sname,sex,age,birthday,class )values ('20092505','mengmeng','w','20','19900206','4');Insert into stub (Sno,sname,sex,age,birthday,class )values ('20092506','aili','w','20','19900209','5');Insert into stub (Sno,sname,sex,age,birthday,class )values ('20092507','dengli','w','20','19900226','5');Insert into Courseb (Cno ,Cname ,Chour )values ('01','jsj','32');Insert into Courseb (Cno ,Cname ,Chour )values ('02','wjyl','48');Insert into Scoreb (Sno ,CnO ,Grade )values ('20092500','01','86');Insert into Scoreb (Sno ,CnO ,Grade )values ('20092501','02','58');Insert into Scoreb (Sno ,CnO ,Grade )values ('20092502','01','56');Insert into Scoreb (Sno ,CnO ,Grade )values ('20092503','02','76');Insert into Scoreb (Sno ,CnO ,Grade )values ('20092504','01','76');Insert into Scoreb (Sno ,CnO ,Grade )values ('20092505','02','85');Insert into Scoreb (Sno ,CnO ,Grade )values ('20092506','01','85');Insert into Scoreb (Sno ,CnO ,Grade )values ('20092507','02','84');select distinct sno,sname,birthday from stubselect distinct sno,sname,class from stubselect distinct * from stub,Courseb,Scorebwhere stub.Sno=Scoreb.Sno and o=Oselect distinct stub.Sno,sname,CLASS from stub,Scorebwhere stub.Sno=Scoreb.Sno and Grade<60select sname,avg(Grade) PJCJ,sum(Grade) ZCJ FROM stub,scoreb where scoreb.sno=stub.sno group by stub.snameselect distinct stub.Sno,sname,CLASS from stub,Scorebwhere stub.Sno=Scoreb.Sno and Grade>85update Courseb set Cname='软件技术' where Cno=01select distinct * from Coursebupdate stub set Sname='yangbingb',sex='m',age='21' where Sno='20092527'select distinct * from stubupdate stub,Scoreb set Grade='60' where Grade<=59 and Grade>=55 and Scoreb.sno=stub.sno and stub.sex='m'delete from stub where stub.class='5'create table tmp as select scoreb.sno from scoreb,stub where scoreb.sno=stub.sno and(stub.birthday)'19901231'or stub.birthady('19800101')group by scoreb.snodelete from scoreb where sno in (select sno from tmp)select distinct * from ScorebDrop database MyDB1。