[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f44lIbKuKhcWuxArfVpYMdMkXTSwn30zH5bmREAbC_OA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":16,"related":17,"source":23,"type":24},[],"2023-05-08 01:19:05",84810334,[8,9],"对","错",{"courseId":11,"courseImg":12,"courseName":13,"workId":14,"workName":15},"1000009278","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F4cfd1768be6f346912cffd0ad6d81cf2.png","数据结构与算法（天津理工大学）","29533118","数据结构与算法（天津理工大学）教程考试","在有向图的邻接矩阵中, 对第j列的元素进行累加,可得到第j个顶点的出度",[18,25,30,40,50,53,62,67,72,81],{"answer":19,"createTime":5,"id":20,"options":21,"question":22,"source":23,"type":24},[],84810321,[8,9],"一旦一个问题的数据模型确定,求解该问题的算法是唯一的","v2",3,{"answer":26,"createTime":5,"id":27,"options":28,"question":29,"source":23,"type":24},[],84810323,[8,9],"单链表是一种随机存取结构,可以任意存取表中元素",{"answer":31,"createTime":5,"id":32,"options":33,"question":38,"source":23,"type":39},[],84810325,[34,35,36,37],"顺序存储结构","链式存储结构","索引存储结构","散列存储结构","若结点的存储地址与其关键字之间存在某种映射关系,则称这种存储结构为( )",0,{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":23,"type":49},[],84810331,[44,45,46,47],"便于插入和删除操作","便于随机存取","元素的物理顺序与逻辑顺序相同","花费的存储空间较链表少","用顺序表表示线性表的优点是( )",1,{"answer":51,"createTime":5,"id":6,"options":52,"question":16,"source":23,"type":24},[],[8,9],{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":23,"type":49},[],84810338,[57,58,59,60],"可随机访问任一元素","插入、删除不需要移动元素","不必事先估计存储空间","查找元素代价小","下面是链表特点的是( )",{"answer":63,"createTime":5,"id":64,"options":65,"question":66,"source":23,"type":24},[],84810340,[8,9],"数据的逻辑结构与数据元素本身的内容和形式无关.(",{"answer":68,"createTime":5,"id":69,"options":70,"question":71,"source":23,"type":24},[],84810342,[8,9],"从逻辑关系上讲,数据结构主要分为两大类:线性结构和非线性结构",{"answer":73,"createTime":5,"id":74,"options":75,"question":80,"source":23,"type":49},[],84810351,[76,77,78,79],"索引","查找","修改","赋值","通常对数组进行的两种基本操作是( )",{"answer":82,"createTime":5,"id":83,"options":84,"question":89,"source":23,"type":49},[],84810355,[85,86,87,88],"ACBDE","ACBED","ABCDE","ABDEC","若一个有向图的定点集合为(A,B,C,D,E},边集为{,,,,,},则由该出产生的可能拓扑序列为( )"]