[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fcEgL3zC8BsQJDLdE0gIfGyjeukfjks26yFD04YvgrgY":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-11-20 08:01:36",237449806,[8,9,10,11],"(Q.front &ndash; Q.size)","(Q.front &ndash; Q.size + M)%M","(Q.front + Q.size-1 + M)%M","(Q.front + Q.size-1)",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},35,"443b2e37fe2e7321d882f42990c830e5","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc7765ba37416b4b85a326a5e215f7833.jpg","数据结构与算法","exam_167419490","第三章测试题","设循环队列Q的定义中有front和size两个域变量,其中front表示队头元素的指针,size表示队列的长度,如下图所示(队列长度为3,队头元素为x、队尾元素为z).设队列的存储空间容量为M,则队尾元素的指针为( ).\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3f269af344a5b2e0dad7cb182c9a5e40.jpg\">",[21,32,41,50,59,62,71,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],237449802,[25,26,27,28],"IOOIIOIOIO","IOIOIOIOIO","IIOOIOIOOO","IIOIIOIOOO","已知栈S 初始为空,用 I 表示入栈、O表示出栈,若入栈序列为a1a2a3a4a5,则通过栈 S 得到出栈序列a2a4a5a3a1的合法操作序列( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],237449803,[36,37,38,39],"以上说法都不对","无法判断队列是否为满","队列不可能满","无法判断队列是否为空","对于循环队列( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],237449804,[45,46,47,48],"N+1","N","N-2","N-1","当用大小为N的数组存储顺序循环队列时,该队列的最大长度为( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],237449805,[54,55,56,57],"队列","顺序表","栈","数组","在解决计算机主机与打印机之间速度不匹配问题时通常设置一个打印机缓冲区,该缓冲区应该是一个( )结构",{"answer":60,"createTime":5,"id":6,"options":61,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],237449807,[66,67,68,69],"所包含的运算个数不同","逻辑结构不同","限定插入和删除的位置不同","存储结构不同","队和栈的主要区别是( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],237449808,[75,76,77,78],"4、3、2、1","1、2、3、4","以上都正确","1、4、3、2","一个队列的入队序列是1、2、3、4,则队列的出队序列是( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],237449809,[84,85,86,87],"S-&gt;top++;*S-&gt;top=e","S-&gt;top=e","*S-&gt;top=e","*S-&gt;top=e;S-&gt;top++","一个顺序栈S,其栈顶指针为top,则将元素e入栈的操作是( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],237449810,[93,94,95,96],"6","4","5","3","设元素序列a,b,c,d,e,f经过初始为空的栈S后,得到出栈序列cedfba,则栈S的最小容量为 ( )",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":30,"type":31},[],237449811,[102,103,104,105],"Qu-&gt;front == (Qu-&gt;rear + 1) %m","Qu-&gt;front == Qu-&gt;rear","Qu-&gt;front != Qu-&gt;rear","Qu-&gt;front != (Qu-&gt;rear + 1) %m&lt;br&gt;","判断一个循环队列Qu (最多元素为m) 为空的条件是( )"]