软件技术基础上机实验报告

电子科技大学软件技术基础上机实验报告上机实验三实验名称：ex3—1#include"stdio.h"#include"stdlib.h"#definetrue1#definefalse0typedefstructnode{ intdata; structnode*next;}node_type;typedefstruct{ node_type*top; intlength;}lstack_type;intpush(lstack_type*lp,intx){ node_type*p; p=(node_type*)malloc(sizeof(node_type)); if(p!=NULL){ p->data=x; p->next=lp->top; lp->top=p; }else return; }voidpop(lstack_type*lp){ node_type*p; if(lp->top==NULL) { return; } else { p=lp->top; lp->top=lp->top->next; free(p); }}node_type*print(node_type*head){ node_type*temp; temp=head; while(temp!=NULL){ printf("%d",temp->data); temp=temp->next;} }voidmain(){ inti,j; i=0;j=0; lstack_typeM,*lp; lp=&M; lp->top=NULL; printf("Pleaseinputthedata(endby'0'):\n"); scanf("%d",&i); while(i!=0) { push(lp,i); scanf("%d",&i); } printf("Alldatais:\n"); print(lp->top); printf("\nThefirstpop:\n"); pop(lp); print(lp->top); printf("\nThesecondpop:\n"); pop(lp); print(lp->top);}实际运行结果（如图）：心得体会：对于栈的程序还需多加练习和熟悉。实验名称：ex3—2#include"stdio.h"#defineMAXNUM20#definetrue1#definefalse0typedefstruct{intdata[MAXNUM]; intfront,rear;}queue_type;intenqueue(queue_type*q,intx){ if((q->rear+1)%MAXNUM==q->front) return(false); else { q->data[q->rear]=x; /*新元素入队尾*/ q->rear=(q->rear+1)%MAXNUM;/*移rear*/ return(true); } }intdequeue(queue_type*q){ if(q->rear==q->front)/*判队列是否为空*/ { printf("queueisempty"); return(0); /*返回空值*/ } else{ q->front=(q->front+1)%MAXNUM; return(q->data[q->front-1]); }}voidaa(queue_type*q){inti,j=0,k;i=dequeue(q);while(j<10){ if(i>0){ enqueue(q,i);j++; i=dequeue(q); }else{j++; i=dequeue(q); }}if(q->front>q->rear){ for(i=q->front;i<MAXNUM-1;i++){ printf("%d",q->data[i]);}for(i=0;i<q->rear;i++){ printf("%d",q->data[i]);}}else{ for(i=q->front-1;i<q->rear;i++){ printf("%d",q->data[i]);}}}voidmain(){queue_typeM,*lp; inti,j,a[]={2,3,-4,6,-5,8,-9,7,-10,20}; lp=&M; lp->front=0; lp->rear=0; for(i=0;i<10;i++) { enqueue(lp,a[i]); } printf("调用函数前队列元素为：\n");for(i=0;i<10;i++){ printf("%d",lp->data[i]);}printf("\n调用函数后队列元素为：\n");aa(lp);}实际运行结果（如图）：实验名称：ex3—3#include"stdio.h"#defineM20#definetrue1#definefalse0typedefstruct{intdata[M]; inttop1,top2; }stack_type;intpush1(stack_type*s){ intx; printf("请输入数据（以’0‘结束）:\n"); scanf("%d",&x); while(x!=0&&s->top1<=s->top2) { s->data[s->top1]=x; s->top1=s->top1+1; scanf("%d",&x); }if(s->top1==s->top2)printf("栈已满！\n");return;}intpush2(stack_type*s){ intx; printf("请输入数据（以’0‘结束）:\n"); scanf("%d",&x); while(x!=0&&s->top1<=s->top2) { s->data[s->top2]=x; s->top2=s->top2-1; scanf("%d",&x); }if(s->top1==s->top2)printf("栈已满！\n");return;}intpop1(stack_type*s){ intout; if(s->top1<0)return(false); else { out=s->data[s->top1-1]; s->top1=s->top1-1;return(out); }}intpop2(stack_type*s){ intout; if(s->top2>=M)return(false); else { out=s->data[s->top2+1]; s->top2=s->top2+1;return(out); }}voidmain(){ inti,j,k;stack_typeas,*lp; lp=&as; lp->top1=0; lp->top2=M-1; while(1) {printf("请选择你要操作的栈:输入“1”或“2”\n");printf("返回“0”\n");scanf("%d",&i);if(i==1) { printf("请选择你要进行的操作:入栈“1”；出栈“2”\n");scanf("%d",&k);switch(k){ case1:push1(lp);break;case2:j=pop1(lp);printf("出栈元素为:%d\n",j);break;default:printf("输入错误！\n");} } elseif(i==2) { printf("请选择你要进行的操作:入栈“1”；出栈“2”\n");scanf("%d",&k);switch(k){ case1:push2(lp);break;case2:j=pop2(lp);printf("出栈元素为:%d\n",j);break;default:printf("输入错误！\n");} } elsebreak;}}实际运行结果（如图）：程序名称：ex3—4#include"stdio.h"#defineMAXNUM5#definetrue1#definefalse0typedefstruct{intdata[MAXNUM]; intfront,rear,tag;}queue_type;intenqueue(queue_type*q,intx){ q->data[q->rear]=x; q->rear=(q->rear+1)%MAXNUM; return(true); }intdequeue(queue_type*q){ if(q->rear==q->front&&q->tag==0) { printf("queueisempty"); return(0); } else{ q->front=(q->front+1)%MAXNUM; return(q->data[q->front-1]); }}voidmain(){queue_typeM,*lp; inti,j=0,k; lp=&M; lp->front=0; lp->rear=0; lp->tag=0; printf("请输入元素(以-999结束)：\n"); for(i=0;i<MAXNUM;i++) { scanf("%d",&k); if(k!=-999) { enqueue(lp,k); j++; lp->tag=2; if(j==MAXNUM) { lp->tag=1; printf("队列已满！\n"); break; } } else break; } printf("队列元素为：\n");if(lp->front>=lp->rear){ for(i=lp->front;i<MAXNUM;i++)