[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fQSqpgCiyT829Q3NA6BPZ3rKCtohQzkwPVf4SF5vZ63Y":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":29,"type":30},[],"2023-05-07 21:17:38",87112208,[8,9,10,11],"front->next=s;front=s","s->next=rear;rear=s","rear->next=s;rear=s","s->next=front;front=s",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000000193","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F82fe3fb82f3d4349289a3e33c9dfbd9e.png","数据结构","32535997","数据结构教程考试","设指针变量front表示链式队列的队头指针,指针变量rear表示链式队列的队尾指针,指针变量s指向将要入队列的结点X,则入队列的操作序列为( )",[20,31,40,49,58,66,71,74,79,84],{"answer":21,"createTime":5,"id":22,"options":23,"question":28,"source":29,"type":30},[],87112162,[24,25,26,27],"n*n","n*n\u002F2","n*(n+1)\u002F2","(n+1)2\u002F2","一个n*n的对称矩阵,如果以行或列为主序放入内存,则容量为( )","v2",0,{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":29,"type":30},[],87112170,[35,36,37,38],"SA+144","SA+222","SA+255","SA+278","设数组A行下标i从1到8,列下标j从1到10,每个元素占3个字节,首地址为SA则该数组按行存放时,元素A[8][5]的起始地址为( )",{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":29,"type":30},[],87112172,[44,45,46,47],"ASTRUCTUR","STRUCTURE","DATA","DATASTRUCTURE","函数substr("DATASTRUCTURE",5,9)的返回值为( )",{"answer":50,"createTime":5,"id":51,"options":52,"question":57,"source":29,"type":30},[],87112192,[53,54,55,56],"必须判别栈是否为满","必须判别栈是否为空","判别栈元素的类型","对栈不作任何判别","设用链表作为栈的存储结构则退栈操作( )",{"answer":59,"createTime":5,"id":60,"options":61,"question":64,"source":29,"type":65},[],87112200,[62,63],"对","错","栈和队列是操作受限的线性表.( )",3,{"answer":67,"createTime":5,"id":68,"options":69,"question":70,"source":29,"type":65},[],87112204,[62,63],"满二叉树中不可能存在度为1的结点.( )",{"answer":72,"createTime":5,"id":6,"options":73,"question":18,"source":29,"type":30},[],[8,9,10,11],{"answer":75,"createTime":5,"id":76,"options":77,"question":78,"source":29,"type":65},[],87112217,[62,63],"普里姆算法适合稠密图.( )",{"answer":80,"createTime":5,"id":81,"options":82,"question":83,"source":29,"type":65},[],87112220,[62,63],"栈和队列的存储方式,既可以是顺序存储也可以是链式存储.( )",{"answer":85,"createTime":5,"id":86,"options":87,"question":88,"source":29,"type":65},[],87112222,[62,63],"串中任意个字符组成的子序列称为串的子串.( )"]