[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fI2Pm2LNy8Caa68peCqmwmU4rM2iXu_YGr5Ml6Lso9QM":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":8,"question":15,"related":16,"source":27,"type":109},[],"2024-07-07 09:29:05",157668432,[],{"count":9,"courseId":10,"courseImg":11,"courseName":12,"workId":13,"workName":14},429,"00c6f58b81daf079538a9c3c0aec9e6e","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F22ad777326c114fbc0eaa1e857a9c66d.png","数据结构与算法","exam_131116995","自测202407070823","数据结构中数据元素之间的逻辑关系被称为( )",[17,29,38,47,56,65,74,82,91,100],{"answer":18,"createTime":19,"id":20,"options":21,"question":26,"source":27,"type":28},[],"2024-07-07 09:29:04",157668170,[22,23,24,25],"与图的顶点数和边数都有关","只与图的边数有关","只与图的顶点数有关","与边数的平方有关","用邻接表存储图所用的空间大小( )","v1",0,{"answer":30,"createTime":19,"id":31,"options":32,"question":37,"source":27,"type":28},[],157668171,[33,34,35,36],"16902","16904","14454","答案A, B, C均不对","假设有60行70列的二维数组a[1…60, 1…70]以列序为主序顺序存储,其基地址为10000,每个元素占2个存储单元,那么第32行第58列的元素a[32,58]的存储地址为 .(无第0行第0列元素)",{"answer":39,"createTime":19,"id":40,"options":41,"question":46,"source":27,"type":28},[],157668172,[42,43,44,45],"性质相同","特定关系","相同运算","数据项","数据结构是具有( )的数据元素的集合",{"answer":48,"createTime":19,"id":49,"options":50,"question":55,"source":27,"type":28},[],157668173,[51,52,53,54],"1","20","0","21","在有51个结点的完全二叉树中,度为1的结点个数是( ).【南京大学2014年】",{"answer":57,"createTime":19,"id":58,"options":59,"question":64,"source":27,"type":28},[],157668174,[60,61,62,63],"直接选择排序","二分法插入排序","希尔排序","快速排序","下列排序中,哪一个是稳定的排序( ).【北方交通大学2001年】",{"answer":66,"createTime":19,"id":67,"options":68,"question":73,"source":27,"type":28},[],157668175,[69,70,71,72],"问题的规模","变量的多少","问题的难度","A和B","算法的时间复杂度取决于( )",{"answer":75,"createTime":19,"id":76,"options":77,"question":81,"source":27,"type":28},[],157668176,[78,79,45,80],"表元素","数据元素","信息项","线性表是具有n个( )的有限序列",{"answer":83,"createTime":19,"id":84,"options":85,"question":90,"source":27,"type":28},[],157668177,[86,87,88,89],"树的先根遍历序列与其对应的二叉树的先序遍历相同","树的后根遍历序列与其对应的二叉树的后序遍历相同","树的先根遍历序列与其对应的二叉树的中序遍历相同","以上都不对","一棵树可转换成为与其对应的二叉树,则下面叙述正确的是",{"answer":92,"createTime":19,"id":93,"options":94,"question":99,"source":27,"type":28},[],157668178,[95,96,97,98],"BA+141","BA+180","BA+222","BA+225","设有数组A[i][j],数组的每个元素长度为3字节,i=1,2,…,8,j=1,2,…,10,数组从内存首地址BA开始顺序存放.当数组以列为主序存放元素时,元素A[5][8]的存储首地址为[ ]",{"answer":101,"createTime":19,"id":102,"options":103,"question":108,"source":27,"type":28},[],157668179,[104,105,106,107],"广义表","二叉树","稀疏矩阵","串","以下数据结构中,哪一个是线性结构( ).【北方交通大学2001年】",2]