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