[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fhZDmZtprjRnsQvbCuXMWp8p0AIvDNowS7Y6M9EeyEio":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2024-07-09 21:31:20",157888550,[8,9,10,11],"一对一","一对多","多对多","多对一",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},76,"ac39cc01f3195c8439f677e2020ef960","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd81de7ebc7c8c3848926d7263f5c7790.png","数据结构（第四版）曾海 尚鲜连","exam_127688463","客观题题库","线性结构中元素之间存在( )关系",[21,33,42,51,60,69,78,87,96,105],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2024-07-09 21:31:19",157888489,[26,27,28,29],"必须是不连续的","连续与否均可","必须是连续的","和头结点的存储地址相连续","线性表采用链式存储时,结点的存储地址( )","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],157888490,[37,38,39,40],"顺序存储结构、链接存储结构、索引存储结构和散列存储结构","线性存储结构、非线性存储结构、树型存储结构和图型存储结构","集合存储结构、一对一存储结构、一对多存储结构和多对多存储结","顺序存储结构、树型存储结构、图型存储结构和散列存储结构","数据的四种存储结构是( )",{"answer":43,"createTime":23,"id":44,"options":45,"question":50,"source":31,"type":32},[],157888491,[46,47,48,49],"可以有多个指针域","至多有一个域指针","有且只有一个指针域","针域的个数任意","单链表中的每一个结点()",{"answer":52,"createTime":23,"id":53,"options":54,"question":59,"source":31,"type":32},[],157888492,[55,56,57,58],"rear=(rear-1)%m","front=(front+1)%m","front=(front-1)%m","rear=(rear+1)%m","已知循环队列的存储空间为m,队头指针front指向队头元素,队尾指针rear指向队尾元素的下一个位置,则从队列中删除元素时,修改指针的操作是()",{"answer":61,"createTime":23,"id":62,"options":63,"question":68,"source":31,"type":32},[],157888493,[64,65,66,67],"操作的有限集合","映象的有限集合","类型的有限集合","关系的有限集合","若将数据结构形式定义为二元组(D, R),其中D是数据元素的有限集合,则R是D上()",{"answer":70,"createTime":23,"id":71,"options":72,"question":77,"source":31,"type":32},[],157888494,[73,74,75,76],"100","110","116","120","一个顺序表第1个元素的存储地址是 100 ,每个元素的存储长度为 4,则 第 5个元素的地址是( )",{"answer":79,"createTime":23,"id":80,"options":81,"question":86,"source":31,"type":32},[],157888496,[82,83,84,85],"先序","中序","后序","层次","对二叉排序树进行遍历,采用( )遍历方法得到的是有序序列",{"answer":88,"createTime":23,"id":89,"options":90,"question":95,"source":31,"type":32},[],157888497,[91,92,93,94],"链式存储结构","顺序存储结构","索引存储结构","散列存储结构","顺序表是线性表的( )",{"answer":97,"createTime":23,"id":98,"options":99,"question":104,"source":31,"type":32},[],157888499,[100,101,102,103],"为空","有一条记录","有两条记录","不确定","快速排序的有序区初始状态是( )",{"answer":106,"createTime":23,"id":107,"options":108,"question":113,"source":31,"type":32},[],157888500,[109,110,111,112],"数据","数据项","数据元素","整型数据","线性表是()的有限序列"]