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