[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fDkhYbmle_TOPf7ybLtpFjcnvzKGw_XsaCGnCqvm1uQA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-06-21 16:22:45",76216477,[8,9,10,11],"1","2","3","4",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},18,"4e6832edec90fa03bc8ce38f8541bb9b","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0d27132e8e4c25614916fe2373258c2e.jpg","数据结构","01338b4d10d74645927005623407ec69","第三章栈和队列\u002F作业2","设栈S和队列Q的初始状态均为空,元素abcdefg依次进入栈S.若每个元素出栈后立即进入队列Q,且7个元素出队的顺序是bdcfeag,则栈S的容量至少是( )",[21,32,41,50,59,68,77,84,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],76216468,[25,26,27,28],"仅I","仅I、II、III","仅I、III、IV","仅II、III、IV","下列关于栈的叙述中,错误的是( ).I. 采用非递归方式重写递归程序时必须使用栈 II. 函数调用时,系统要用栈保存必要的信息 III.只要确定了入栈次序,即可确定出栈次序 IV.栈是一种受限的线性表,允许在其两端进行操作","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],76216469,[36,37,38,39],"-15","15","-20","20","若栈S1中保存整数,栈S2中保存运算符,函数F()依次执行下述各步操作: 1)从S1中依次弹出两个操作数a和b. 2)从S2中弹出一个运算符op. 3)执行相应的运算b op a. 4)将运算结果压入S1中 假定S1中的操作数依次是5, 8,3,2(2在栈顶),s2中的运算符依次是 *、-、+(+在栈顶).调用3次F()后,s1栈顶保存的值是( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],76216470,[45,46,47,48],"0 , 0","0 , n-1","n-1 , 0","n-1 , n-1","已知循环队列存储在一维数组A[0...n-1]中, 且队列非空时front和rear分别指向队头元素和队尾元素.若初始时队列为空,且要 求第一个进入队列的元素存储在A[0]处,则初始时front和rear的值分别是( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],76216471,[54,55,56,57],"队空:end1==end2 队满:end1==(end2+1)mod M","队空:end1==end2 队满:end2==(end1+1)mod (M-1)","队空:end2==(end1+1)mod M 队满:end1==(end2+1)mod M","队空:end1==(end2+1)mod M 队满:end2==(end1+1)mod (M-1)","循环队列放在一维教组A[0... M-1]中,end1指向队头元素,end2指向队尾元素的后一个位置,假设队列两端均可进行入队和出队操作,队列中最多能容的M-1个元素.初始时为空,下列判断队空和队满的条件中,正确的是( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],76216472,[63,64,65,66],"1,2,5,6,4,3","2,3,4,5,6,1","3,4,5,6,1,2","6,5,4,3,2,1","现有队列Q与栈S,初始时Q中的元素依次是1,2,3,4,5,6(1在队头),S为空.若仅允许下列3种操作: ①出队并输出出队元素: ②出队并将出队元素入栈; ③出栈并输出出栈元素. 则不能得到的输出序列是( )",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":30,"type":31},[],76216473,[72,73,74,75],"i","n-i","n-i+1","不确定","若已知一个栈的入栈序列是1,2,3,…,n,其输出序列为p1,p2,p3,…,pn,若p1=n,则pi为",{"answer":78,"createTime":5,"id":79,"options":80,"question":83,"source":30,"type":31},[],76216474,[11,81,10,82],"5","6","设栈的初始状态为空, 当字符序列 "n1_"作为栈的输入时,输出长度为3,且可用做C语言标识符的序列有( )个",{"answer":85,"createTime":5,"id":86,"options":87,"question":88,"source":30,"type":31},[],76216475,[10,11,81,82],"元素a,b,c,d,e依次进入初始为空的栈中,若元素进栈后可停留、可出栈,直到所有元素都出栈,则在所有可能的出栈序列中,以元素d开头的序列个数是( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],76216476,[93,94,95,96],"dcebfa","cbdaef","bcaefd","afedcb","若元素a,b,c,d,e,f依次进栈,允许进栈、退栈操作交替 进行,但不允许连续3次进行退栈操作,不可能得到的出栈序列是( )",{"answer":99,"createTime":5,"id":6,"options":100,"question":19,"source":30,"type":31},[],[8,9,10,11]]