[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fzXL8dIaOTgd8xyTYbjBY54p_PIFkKW3NgHVKnoiZPhA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":27,"type":28},[],"2023-10-13 12:25:07",99681457,[8,9,10,11],"线性表可以是空表","线性表中至少有一个元素","线性表中任何一个元素有且仅有一个直接前驱","线性表中任何一个元素有且仅有一个后继",{"courseId":13,"courseImg":14,"courseName":15},"a1c2fc4a31e6c2a476e7dc8753e2f125","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe52a9b5ca46dd0e72b6dedf51961a61e.jpg","数据结构","下列有关线性表的叙述中,正确的是( )",[18,29,38,47,50,59,68,77,86,92],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],99681452,[22,23,24,25],"字符","数据元素","数据项","表元素","线性表是具有n个( )的有限序列","v1",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":28},[],99681453,[33,34,35,36],"随机存取的存储结构","顺序存取的存储结构","索引存取的存储结构","Hash存取的存储结构","线性表的顺序存储结构是一种( )",{"answer":39,"createTime":5,"id":40,"options":41,"question":46,"source":27,"type":28},[],99681455,[42,43,44,45],"110","108","100","120","一个线性表第一个元素的存储地址是100,每个元素的长度为2,则第5个元素的地址是( )",{"answer":48,"createTime":5,"id":6,"options":49,"question":16,"source":27,"type":28},[],[8,9,10,11],{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":27,"type":28},[],99681459,[54,55,56,57],"存储结构","逻辑结构","顺序存储结构","链式存储结构","数据在计算机存储器内表示时,物理地址与逻辑地址相同并且是连续的,称之为( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":27,"type":28},[],99681461,[63,64,65,66],"树形结构","集合","图形结构","线性结构","以下哪种数据结构中任何两个结点之间都没有逻辑关系.( )",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":27,"type":28},[],99681462,[72,73,74,75],"存储密度大","插入运算方便","删除运算方便","可方便地用于各种逻辑结构的存储表示","下列( )是顺序存储结构的优点",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":27,"type":28},[],99681463,[81,82,83,84],"数据元素的组织形式","数据类型","数据存储结构","数据定义","数据结构是指( )",{"answer":87,"createTime":5,"id":88,"options":89,"question":91,"source":27,"type":28},[],99681464,[54,55,57,90],"顺序存储结构的","数据在计算机存储器内表示时,物理地址与逻辑地址不相同的,称之为( )",{"answer":93,"createTime":5,"id":94,"options":95,"question":100,"source":27,"type":28},[],99681465,[96,97,98,99],"一对一","多对多","多对一","一对多","树形结构是数据元素之间存在一种( )关系"]