[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fRfNvD3vxe-MpRtmsPAYFIOm1_3dNMOW4fFDQ9XgvuLU":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":8,"question":15,"related":16,"source":27,"type":88},[],"2024-04-15 12:45:47",138429810,[],{"count":9,"courseId":10,"courseImg":11,"courseName":12,"workId":13,"workName":14},18,"d9139572bd8e9b466b5947011e5c5c3f","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9f919e91c3941b64f778d058a7fcb4c7.jpg","数据结构（C语言）","work_34129665","3.1 栈","顺序栈用 data[0..n-1]存储数据,栈顶指为top,初始值为0,则元素x进栈的操作是____",[17,29,38,47,56,65,74,83,89,92],{"answer":18,"createTime":19,"id":20,"options":21,"question":26,"source":27,"type":28},[],"2024-04-09 22:56:06",137593516,[22,23,24,25],"5,4,3,2,1","2,1,5,4,3","4,3,1,2,5","2,3,5,4,1","若让元素1,2,3,4,5依次进栈,则出栈次序不可能出现在( )种情况","v1",0,{"answer":30,"createTime":19,"id":31,"options":32,"question":37,"source":27,"type":28},[],137593517,[33,34,35,36],"a","b","1","0","经过以下栈运算后,x的值是( ).InitStack(s); Push(s,a); Push(s,b); Pop(s,x); GetTop(s,x)",{"answer":39,"createTime":19,"id":40,"options":41,"question":46,"source":27,"type":28},[],137593518,[42,43,44,45],"push,pop,push,pop,push,pop","push,push,push,pop,pop,pop","push,push,pop,pop,push,pop","push,pop,push,push,pop,pop","已知一个栈的进栈序列是ABC,出栈序列为CBA,经过的栈操作是( )",{"answer":48,"createTime":19,"id":49,"options":50,"question":55,"source":27,"type":28},[],137593519,[51,52,53,54],"线性表","栈","队列","单链表","在数据处理过程中常需要保一些中间数据,如果后保存的数据先处理,则使用( )来保存这些数据",{"answer":57,"createTime":19,"id":58,"options":59,"question":64,"source":27,"type":28},[],137593520,[60,61,62,63],"st.top==st.base","st.top!=st.base","st.top-st.base>=MaxSize","以上都不对","判定一个顺序栈st为(元素个数最多为 MaxSize)空的条件为( )",{"answer":66,"createTime":19,"id":67,"options":68,"question":73,"source":27,"type":28},[],137593521,[69,70,71,72],"top++; data[top]=x","data[top]=x; top++","top--; data[top]=x","data[top]=x; top--","若一个栈用数组data[1..n]存储,初始栈顶指针top为n,则以下元素x进栈的正确操作是( )",{"answer":75,"createTime":19,"id":76,"options":77,"question":82,"source":27,"type":28},[],137593522,[78,79,80,81],"6","7","8","9","利用栈将十进制数 N(N<100)转换为二进制数时,为了确保栈在处理过程中不会发生上溢,则该栈至少要有( )个存储单元",{"answer":84,"createTime":5,"id":85,"options":86,"question":87,"source":27,"type":88},[],138429809,[],"栈是一种特殊的线性表,允许插入和删除运算的一端称为 ____ .不允许插入和删除运算的一端称为____",2,{"answer":90,"createTime":5,"id":6,"options":91,"question":15,"source":27,"type":88},[],[],{"answer":93,"createTime":5,"id":94,"options":95,"question":98,"source":27,"type":99},[],138429811,[96,97],"正确","错误","栈底元素是不能删除的元素",3]