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