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