[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fguBUnAlJgwUR4byOJpTSaofGPi7D29Lq3IN8ZqGx0NE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2024-10-19 10:07:30",162254603,[8,9,10,11],"Cq_front = (Cq_front+1)%m","Cq_front = (Cq_front+1)%(m+1)","Cq_rear = (Cq_rear+1)%m","Cq_rear = (Cq_rear+1)%(m+1)",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},19,"a42f7b179a3b8827a541b19acc768538","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F28b4f85104160b4a75b7a3bfe251d5dd.jpg","数据结构","work_37732142","第2次作业 栈和队列","一个循环队列的最大容量为m+1,front为队首指针,rear为队尾指针.那么进队操作时求队位号应该使用公式 ( )",[21,33,42,51,60,69,78,87,96,99],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2024-10-16 12:52:57",161885427,[26,27,28,29],"a1","a2","a3","a4","设有4个数据元素a1、a2、a3和a4,对他们进行栈操作.在进栈时,按a1、a2、a3、a4次序每次进入一个元素.假设栈的初始状态是空.现要进行的栈操作是进栈两次,出栈一次,再进栈两次,出栈一次;这时,第一次出栈得到的元素是( )","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],161885428,[37,38,39,40],"i","n-i","n-i+1","不确定","若已知一个栈的入栈序列是1,2,3,…,n,其输出序列为p1,p2,p3,…,pn,若p1=n,则pi为( )",{"answer":43,"createTime":23,"id":44,"options":45,"question":50,"source":31,"type":32},[],161885429,[46,47,48,49],"top++; V[top]=x","V[top]=x; top++","top--; V[top]=x","V[top]=x; top--","若一个栈以向量V[1..n]存储,初始栈顶指针top设为n+1,则元素x进栈的正确操作是( )",{"answer":52,"createTime":23,"id":53,"options":54,"question":59,"source":31,"type":32},[],161885430,[55,56,57,58],"仅修改头指针","仅修改尾指针","头、尾指针都要修改","头、尾指针可能都要修改","用链接方式存储的队列,在进行删除运算时( )",{"answer":61,"createTime":23,"id":62,"options":63,"question":68,"source":31,"type":32},[],161885431,[64,65,66,67],"b a c d e","d b a c e","d b c a e","e c b a d","某队列允许在其两端进行入队操作,但仅允许在一端进行出队操作,若元素a、b、c、d、e依次入此队列后再进行出队操作,则不可能的出队序列是( )",{"answer":70,"createTime":23,"id":71,"options":72,"question":77,"source":31,"type":32},[],161885432,[73,74,75,76],"3和4","3和0","5和0","5和1","若用数组A[0..5]实现循环队列,且当前rear和front的值分别为1和5,当从队列中删除一个元素,再加入两个元素后,则rear和front的值分别为( )",{"answer":79,"createTime":5,"id":80,"options":81,"question":86,"source":31,"type":32},[],162254600,[82,83,84,85],"e、d、c、b、a","d、e、c、b、a","d、c、e、a、b","a、b、c、d、e","一个栈的元素进栈序列是a、b、c、d、e,那么下面的( )不能做为一个出栈序列",{"answer":88,"createTime":5,"id":89,"options":90,"question":95,"source":31,"type":32},[],162254601,[91,92,93,94],"Qs_rear-Qs_front == n*size","Qs_rear-Qs_front+1 == n*size","Qs_front == Qs_rear","Qs_front == Qs_rear+size","判定一个顺序队列Qs(最多有n个元素)为满的条件是( )",{"answer":97,"createTime":5,"id":6,"options":98,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":100,"createTime":5,"id":101,"options":102,"question":109,"source":31,"type":32},[],162254606,[103,104,105,106,107,108],"加1","减1","不变","清0","加2","减2","设用一维数组A[1,…,n]来表示一个栈,A[n]为栈底,用整型变量T指示当前栈顶位置,A[T]为栈顶元素.往栈中推入(PUSH)一个新元素时,变量T的值 ( )"]