[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$ftrjtpLA3u1ErLAj9gMMkWN5erJRtV78t-SNCWdR0ejk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-04-26 11:48:12",140369100,[8,9,10,11],"MAXQSIZE","MAXQSIZE + 1","MAXQSIZE - 1","MAXQSIZE - 2",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},11,"9eb83c0c3bcacdaf4166b9eab72b9d53","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F586356772dd1dab2fa091e7204c63fe0.jpg","数据结构","work_34617990","线上作业3——基本指令练习","已知循环队列数据结构定义如下: \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0e67383c6885b1cff4375269192e9055.png\"> 初始化时置front、num均为0,在不增加其它辅助变量条件下,该队列的最大长度为( )",[21,32,41,50,59,64,69,78,83,86],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],140369092,[25,26,27,28],"'a'、'b'、'c'、'e'、'd'","'a'、'b'、'e'、'd'、'c'","'d'、'e'、'c'、'a'、'b'","'c'、'd'、'e'、'b'、'a'","如果字符栈入栈顺序为'a'、'b'、'c'、'd'、'e',则出栈后,不可能形成的字符序列为( )","v1",1,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],140369093,[36,37,38,39],"2","3","4","5","设栈S初始状态为空栈,元素入栈序列为a、b、c、d、e、f,出栈顺序为a、b、c、e、d、f.则栈S的容量至少应该是( ).",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],140369094,[45,46,47,48],"p->data = e; p-next = S; S = p","p->data = e; S = p; p-next = S","p->data = e; p->next = S->next; S->next = p","p->data = e; S->next = p; p->next = S->next","如果使用带头结点的单链表作为链栈,S为指向单链表头结点的指针,元素e入栈时新申请的结点为p,则如下操作正确的是( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],140369095,[54,55,56,57],"e = S->data; p = S; S = S->next; delete p","e = S->data; delete S; S = S->next","e = S->next->data; delete S->next; S->next = S->next->next","e = S->next->data;p = S->next;S->next = p->next;delete p","如果使用带头结点的单链表作为链栈,S为指向单链表头结点的指针,已知该栈非空,则出栈(元素赋值给e)操作正确的是( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":63,"source":30,"type":31},[],140369096,[39,38,37,36],"当执行语句fun(5)时,则函数fun()被调用的次数为( ) \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa09f4020223ca8538e49e5cbf467bcc2.png\">",{"answer":65,"createTime":5,"id":66,"options":67,"question":68,"source":30,"type":31},[],140369097,[8,9,10,11],"已知循环队列数据结构定义如下: \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F71d923e61efb77c0455c20252b91bdbd.png\"> 初始化时置front和rear均为0,在不增加其它辅助变量条件下,该队列的最大长度为( )",{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":30,"type":31},[],140369098,[73,74,75,76],"入队:elem[rear] = e; rear = (rear + 1) % MAXQSIZE;出队:front = (front + 1) % MAXQSIZE; e = elem[front]","入队:rear = (rear + 1) % MAXQSIZE; elem[rear] = e;出队:e = elem[front]; front = (front + 1) % MAXQSIZE","入队:rear = (rear + 1) % MAXQSIZE; elem[rear] = e;出队:front = (front + 1) % MAXQSIZE; e = elem[front]","入队:elem[rear] = e; rear = (rear + 1) % MAXQSIZE;出队:e = elem[front]; front = (front + 1) % MAXQSIZE","已知循环队列数据结构定义如下: \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F31fffada5c4456ba5cb09393e6fed70b.png\"> 初始化时置front和rear均为0,则队列非空非满时,元素e入队、出队(由e输出)操作为( )",{"answer":79,"createTime":5,"id":80,"options":81,"question":82,"source":30,"type":31},[],140369099,[8,9,10,11],"已知循环队列数据结构定义如下: \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F766f25cf0669990555a60396c1607ca4.png\"> 初始化时置front、rear和num均为0,在不增加其它辅助变量条件下,该队列的最大长度为( )",{"answer":84,"createTime":5,"id":6,"options":85,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":87,"createTime":5,"id":88,"options":89,"question":94,"source":30,"type":31},[],140369101,[90,91,92,93],"可能是a、b、c、d、e","只能是a、b、c、d、e","可能是e、d、c、b、a","只能是e、d、c、b、a","已知入队元素序列为a、b、c、d、e,则出队序列( )"]