实验一实验一 代码： #include “iostream“ #include / 定义一个线性表 const int nMaxSize = 15; / 最大值 int nLen = 0;/ 表中元素个数 int nLinearListnMaxSize; / 定义操作 void LSort(); void LOut(); void LInsert(int n); void LDelete(int n); void main() / 输入数据并放入线性表中 printf(“Please input datan“); / std:cout nIn; nLinearListi = nIn; nLen+; LSort(); / 排序线性表 LOut();/ 输出结果 printf(“Please input a data to insert n“); scanf(“%d“, LInsert(nIn);/ 输入一个数字，并插入到线性表中 LOut(); LSort(); printf(“sorted:n“); LOut(); while(1) printf(“Please input a number of data to delete n“); scanf(“%d“, if (nInnLen) printf(“number must less than %dn“,nLen); else break; 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;jnLen) printf(“place number must less than %dn“,nLen); else break; for(i = nLen; i = j ; -i) nLinearListi =nLinearListi - 1; nLinearListj-1 = k; nLen+; void LDelete(int m) int i; for(i = m; i #include #include #include const int MAX_LEN = 10;/ 字符串的长度 const int MAX_SIZE = 30;/ 栈或队的最大元素个数 / 定义一个队列的结构 struct QUEUE int nMaxSize;/ 最大值 int nCount;/ 个数 int nFront;/ 头 int nRear;/ 尾 char szQueueMAX_SIZEMAX_LEN; ; /定义一个栈的结构 struct STACK int nMaxSize;/ 最大值 int nTop;/ 栈顶 char szStackMAX_SIZEMAX_LEN; ; / 队列的操作 void InitQueue(QUEUE *q,int nMaxSize) q-nMaxSize=nMaxSize; q-nCount=0; q-nFront=0; q-nRear=0; q-szQueueMAX_SIZEMAX_LEN=0; void InQueue(QUEUE *q, char *pItem) if(q-nCount=q-nMaxSize) printf(“Queue is full!n“); return; strcpy(q-szQueueq-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-szQueueq-nFront); if(q-nFront+=MAX_SIZE) q-nFront=0; q-nCount-; /栈的操作 void InitStack(STACK *s,int nMaxSize) s-nMaxSize=nMaxSize; s-nTop=0; s-szStackMAX_SIZEMAX_LEN=0; void PushStack(STACK *s, char *pItem) char *p; if (s-nTopnMaxSize) p=s-szStacks-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 a10=0; if (s-nTop=0) a0=; strcpy(pItem,a); else p=s-szStacks-nTop-1; strcpy(pItem,p); /字符判断 int isdigit(char x) if (x=0 printf(“%s“,x); if (isdigit(x0)/ 是数 PushStack(n,x); else/ 认为是运算符，没有考虑空格等 GetTopStack(o,op);/ 获得 OS 栈顶运算符 if (x0 = ; )/ 扫描结束 printf(“n result is “); break; if (Priority(x) Priority(op)/ 运算符的优先级栈顶运算符 PushStack(o,x); continue; while (Priority(x) = 85 分的学生(Sname, Class)； select distinct stub.Sno,sname,CLASS from stub,Scoreb where stub.Sno=Scoreb.Sno and Grade=85 7、将课程号为“01”的课程名称修改为“软件技术”； update Courseb set Cname=RJJS where Cno=01 select distinct * from Courseb 8、修改一名学生的姓名、性别、年龄； update stub set Sname=xuyiyang,sex=f,age=20 where Sno=0101 9、将成绩为5559分的男生的成绩修改为60分； update Scoreb set Grade=60 where Sno in(SELECT Sno FROM Stub where Sex=m) AND Grade BETWEEN 55 AND 59; 10、删除年龄不是20的学生的所有信息(包括选课和成绩)； DELETE Stub WHERE Sno IN(SELECT Sno FROM Stub WHERE Age !=20) DELETE scoreb WHERE Sno IN(SELECT Sno FROM Stub WHERE Age !=20) 11、删除一个班级的所有学生； DELETE Stub WHERE Sno IN(SELECT Sno FROM Stub WHERE dz01); DELETE Scoreb WHERE Sno IN(SELECT Sno FROM Stub WHERE dz01); 12、删除所有数据表和数据库 Drop database myDB