[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$frSXIKhVdXLp78AjjL5uqKIsIF52UujwIxjFl87F2Kqo":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":8,"question":15,"related":16,"source":26,"type":86},[],"2026-05-18 15:36:25",376235206,[],{"count":9,"courseId":10,"courseImg":11,"courseName":12,"workId":13,"workName":14},13,"4e6832edec90fa03bc8ce38f8541bb9b","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0d27132e8e4c25614916fe2373258c2e.jpg","数据结构","exam_170474960","第3章栈和队列单元测验","现将一个组数据1,2,3,4依次进行如下入栈出栈操作:push,push,pop,push,push,pop之后,当前栈中的栈顶元素值是____",[17,28,37,46,55,65,74,83,87,96],{"answer":18,"createTime":5,"id":19,"options":20,"question":25,"source":26,"type":27},[],376235193,[21,22,23,24],"都是先进后出","都是先进先出","只允许在端点处插入和删除元素","以上都不是","栈和队列的共同特点是( )","v1",0,{"answer":29,"createTime":5,"id":30,"options":31,"question":36,"source":26,"type":27},[],376235196,[32,33,34,35],"s.a[s.top++]=x","s.a[s.top]=x","s.a[++s.top]=x","s.a[top++]=x","下面程序段的功能实现数据x进栈,要求在下划线处填上正确的语句.#define M 100typedef struct {int a[M]; int top;} sqstack;void push(sqstack &s,int x){if (s.top==M) return;____________________;}",{"answer":38,"createTime":5,"id":39,"options":40,"question":45,"source":26,"type":27},[],376235198,[41,42,43,44],"s.top!=0","s.top==0","s.bottom!=0","s.bottom==0","顺序栈s,其判断是否是空栈的条件是()",{"answer":47,"createTime":5,"id":48,"options":49,"question":54,"source":26,"type":27},[],376235199,[50,51,52,53],"push,pop,push,pop,push,pop","push,push,pop,pop,push,pop","push,push,push,pop,pop,pop","push,pop,push,push,pop,pop","输入序列为ABC,可以变为CBA时,经过的栈操作为( )",{"answer":56,"createTime":57,"id":58,"options":59,"question":64,"source":26,"type":27},[],"2026-05-18 15:48:50",376235201,[60,61,62,63],"栈是先进后出的线性表","在栈中只能删除数据","在栈中只能插入数据","栈是先进先出的线性表","下列关于栈的叙述中正确的是( )",{"answer":66,"createTime":5,"id":67,"options":68,"question":73,"source":26,"type":27},[],376235203,[69,70,71,72],"(R+1)%SIZE==F","F==0&&R==0","R==F","R+1==F","设循环队列q中的数组长度为SIZE,F和R分别表示队列的头指针和尾指针,则判断该循环队列为空的条件为( )",{"answer":75,"createTime":57,"id":76,"options":77,"question":82,"source":26,"type":27},[],376235204,[78,79,80,81],"必须判别栈是否为空","必须判别栈是否为满","判别栈元素的类型","对栈不作任何判别","设用链表作为栈的存储结构则退栈操作( )",{"answer":84,"createTime":5,"id":6,"options":85,"question":15,"source":26,"type":86},[],[],2,{"answer":88,"createTime":57,"id":89,"options":90,"question":95,"source":26,"type":27},[],376262144,[91,92,93,94],"先进先出","先进后出","后进先出","不分顺序","队列的操作原则是( )",{"answer":97,"createTime":57,"id":98,"options":99,"question":104,"source":26,"type":27},[],376262145,[100,101,102,103],"头、尾指针都要修改","头、尾指针可能都要修改","仅修改尾指针","仅修改头指针","用链表方式存储的队列,在进行删除运算时( )"]