[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fJXBs21lDkLyLpAREV7acfnpUs-J48BSjB6809aY0muk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":13,"question":20,"related":21,"source":31,"type":32},[],"2024-03-28 20:47:53",136039870,[8,9,10,11,12],"表元素","字符","数据元素","数据项","信息项",{"count":14,"courseId":15,"courseImg":16,"courseName":17,"workId":18,"workName":19},10,"d2faf4eebf597fd58dfb815937f6b87d","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F440e65da403a63e56fb527127d4066d6.png","数据结构（第5期）","work_33636084","作业三 线性表","线性表是具有n个( )的有限序列(n>0)",[22,33,42,51,58,67,74,83,92,101],{"answer":23,"createTime":5,"id":24,"options":25,"question":30,"source":31,"type":32},[],136039860,[26,27,28,29],"单链表","单循环链表","带尾指针的单循环链表","带头结点的双循环链表","设一个链表最常用的操作是在末尾插入结点和删除尾结点,则选用( )最节省时间","v1",0,{"answer":34,"createTime":5,"id":35,"options":36,"question":41,"source":31,"type":32},[],136039861,[37,38,39,40],"p->next=head","p->next=NULL","p=NULL","p=head","非空的循环单链表head的尾结点p满足",{"answer":43,"createTime":5,"id":44,"options":45,"question":50,"source":31,"type":32},[],136039863,[46,47,48,49],"插入、删除不需要移动元素","可随机访问任一元素","不必事先估计存储空间","所需空间与线性长度成正比","链表不具有的特点是( )",{"answer":52,"createTime":5,"id":53,"options":54,"question":57,"source":31,"type":32},[],136039864,[55,56,29,27],"顺序表","双链表","若某线性表最常用的操作是存取任一指定序号的元素和在最后进行插入和删除运算,则利用( )存储方式最节省时间",{"answer":59,"createTime":5,"id":60,"options":61,"question":66,"source":31,"type":32},[],136039865,[62,63,64,65],"110","108","100","120","一个向量第一个元素的存储地址是100,每个元素的长度为2,则第5个元素的地址是",{"answer":68,"createTime":5,"id":69,"options":70,"question":73,"source":31,"type":32},[],136039866,[26,71,56,72],"仅有头指针的单循环链表","仅有尾指针的单循环链表","某线性表中最常用的操作是在最后一个元素之后插入一个元素和删除第一个元素,则采用( )存储方式最节省运算时间",{"answer":75,"createTime":5,"id":76,"options":77,"question":82,"source":31,"type":32},[],136039867,[78,79,80,81],"访问第i个结点(1≤i≤n)和求第i个结点的直接前驱(2≤i≤n)","在第i个结点后插入一个新结点(1≤i≤n)","删除第i个结点(1≤i≤n)","将n个结点从小到大排序","在n个结点的顺序表中,算法的时间复杂度是O(1)的操作是",{"answer":84,"createTime":5,"id":85,"options":86,"question":91,"source":31,"type":32},[],136039868,[87,88,89,90],"大于1","等于1","小于1","不能确定","单链表的存储密度",{"answer":93,"createTime":5,"id":94,"options":95,"question":100,"source":31,"type":32},[],136039869,[96,97,98,99],"分两部分,一部分存放结点值,另一部分存放表示结点间关系的指针","只有一部分,存放结点值","只有一部分,存储表示结点间关系的指针","分两部分,一部分存放结点值,另一部分存放结点所占单元数","链式存储的存储结构所占存储空间",{"answer":102,"createTime":5,"id":6,"options":103,"question":20,"source":31,"type":32},[],[8,9,10,11,12]]