[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fV8-zTSMvztCASae6FrBWOl15v7LqURi_7vpFGi99Udk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2024-04-14 20:20:22",138263712,[8,9,10,11],"rear+1==front","(rear+1)%n==front","rear==front","(rear-l)%n==front",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},25,"04f117ddb5ca127a7eaf47628136594f","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F440e65da403a63e56fb527127d4066d6.png","数据结构与算法","work_34022522","第三章作业","最大容量为n的循环队列,队尾指针是rear,队头是front,则队空的条件是( )",[21,26,36,46,55,65,74,84,91,100],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":28,"id":29,"options":30,"question":35,"source":24,"type":25},[],"2024-04-14 20:24:10",138263714,[31,32,33,34],"终止条件和递归部分","递归部分","终止条件和迭代部分","迭代部分","一个递归算法必须包括( )",{"answer":37,"createTime":38,"id":39,"options":40,"question":45,"source":24,"type":25},[],"2024-04-14 13:45:25",138263716,[41,42,43,44],"栈","队列","线性表","多维数组","递归过程或函数调用时,处理参数及返回地址,要用一种称为( )的数据结构",{"answer":47,"createTime":38,"id":48,"options":49,"question":54,"source":24,"type":25},[],138263718,[50,51,52,53],"top=top+1; V[top]=x都是后进先出","V[top]=x; top=top-1","top=top-1; V[top]=x","V[top]=x; top=top+1","若一个栈以向量V[1..n]存储,初始栈顶指针top为n+1,则下面x入栈的正确操作是( )",{"answer":56,"createTime":57,"id":58,"options":59,"question":64,"source":24,"type":25},[],"2024-04-14 20:24:13",138263720,[60,61,62,63],"x=top->link","x=top;top=top->link","x=top->data;top=top->link","top=top->link;x=top->link","链式栈结点为:(data,link),top指向栈顶.若想摘除栈顶结点,并将删除结点的值保存到x中,则应执行操作( )",{"answer":66,"createTime":38,"id":67,"options":68,"question":73,"source":24,"type":25},[],138263722,[69,70,71,72],"(n+r-f)%n","n+r-f","(n+f-r)%n","r-f","数组Q[n]用来表示一个循环队列,f为当前队列头元素的前一位置,r为队尾元素的位置,假定队列中元素的个数小于n,计算队列中元素个数的公式为( )",{"answer":75,"createTime":76,"id":77,"options":78,"question":83,"source":24,"type":25},[],"2024-04-14 20:24:14",138263724,[79,80,81,82],"abc*+d-","abcd*+-","-+*abcd","abc+*d-","表达式a*(b+c)-d的后缀表达式是",{"answer":85,"createTime":76,"id":86,"options":87,"question":90,"source":24,"type":25},[],138263726,[42,41,88,89],"线性表的顺序存储结构","线性表的链式存储结构","设计一个判别表达式中左,右括号是否配对出现的算法,采用( )数据结构最佳",{"answer":92,"createTime":38,"id":93,"options":94,"question":99,"source":24,"type":25},[],138263728,[95,96,97,98],"表达式求值","递归调用","另外三个选项都有","函数调用","栈在 ( )中有所应用",{"answer":101,"createTime":76,"id":102,"options":103,"question":108,"source":24,"type":25},[],138263730,[104,105,106,107],"头、尾指针可能都要修改","头、尾指针都要修改","仅修改头指针","仅修改尾指针","用链接方式存储的队列,在进行删除运算时( )"]