[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fLMLe-be6Tl76HBQmutOSRZpNry3f1XvyAg9jynNNZM0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2023-11-21 23:20:32",107592783,[8,9,10,11],"表示单链表是线性表的链式存储结构","标识链表中某个重要节点的位置","方便插入和删除运算的实现","使单链表至少有一个节点",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},27,"84ffe6e97f117caf6e0090382bd6f77a","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcd6aa804f56468e1fa7bc4a2057046b9.png","数据结构与算法","exam_101953615","绪论与线性表2022","在单链表中,增加一个头节点的目的是为了( )",[21,33,42,51,60,69,78,87,90,99],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2023-11-21 23:20:31",107592776,[26,27,28,29],"索引结构","树状结构","线性结构","网状结构","()是数据的物理结构","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],107592777,[37,38,39,40],"Ⅰ、Ⅱ、Ⅲ","Ⅱ、Ⅳ","Ⅱ、Ⅲ","Ⅲ、Ⅳ","关于线性表的顺序存储结构和链式存储结构的描述中,正确的是( ). Ⅰ.线性表的顺序存储结构优于链式存储结构 Ⅱ.顺序存储结构比链式存储结构的存储密度高 Ⅲ.如需要频繁插入和删除元素,最好采用顺序存储结构 Ⅳ.如需要频繁插入和删除元素,最好采用链式存储结构",{"answer":43,"createTime":23,"id":44,"options":45,"question":50,"source":31,"type":32},[],107592778,[46,47,48,49],"可执行性、可移植性、可扩充性","确定性、有穷性、稳定性","易读性、稳定性、安全性","可执行性、确定性、有穷性","计算机算法必须具备哪3个特性",{"answer":52,"createTime":23,"id":53,"options":54,"question":59,"source":31,"type":32},[],107592779,[55,56,57,58],"只有一部分,存储表示结点间关系的指针","只有一部分,存放结点值","分两部分,一部分存放结点值,另一部分存放表示结点间关系的指针","分两部分,一部分存放结点值,另一部分存放结点所占单元数","链接存储的存储结构所占存储空间( )",{"answer":61,"createTime":5,"id":62,"options":63,"question":68,"source":31,"type":32},[],107592780,[64,65,66,67],"查找值为x的元素的时间与顺序表中元素个数n有关","查找序号为i的元素的时间与顺序表中元素个数n有关","查找序号为i的元素的时间与顺序表中元素个数n无关","查找值为x的元素的时间与顺序表中元素个数n无关","顺序表具有随机存取特性,指的是()",{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":31,"type":32},[],107592781,[73,74,75,76],"顺序表","双链表","带头结点的双循环链表","单循环链表","若某线性表最常用的操作是存取任一指定序号的元素和在最后进行插入和删除运算,则利用( )存储方式最节省时间",{"answer":79,"createTime":5,"id":80,"options":81,"question":86,"source":31,"type":32},[],107592782,[82,83,84,85],"head!=NULL","head→next==NULL","head→next==head","A.head==NULL","对于一个头指针为head的带头结点的单链表,判定该表为空表的条件是( )",{"answer":88,"createTime":5,"id":6,"options":89,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":91,"createTime":5,"id":92,"options":93,"question":98,"source":31,"type":32},[],107592786,[94,95,96,97],"求解问题的有限运算序列","调度方法","排序方法","计算方法","计算机算法指的是()",{"answer":100,"createTime":5,"id":101,"options":102,"question":106,"source":31,"type":32},[],107592790,[37,103,104,105],"仅Ⅱ、Ⅲ","仅Ⅰ、Ⅱ","仅Ⅰ、Ⅲ","以下关于单链表的叙述中正确的是( ). Ⅰ.节点除自身信息外还包括指针域,存储密度小于顺序表 Ⅱ.找第i个节点的时间为O(1) Ⅲ.在插入、删除运算时不必移动节点"]