[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fxOV0qbdZXo6f1AMlaD9GxMUnT58_aE8pqeDe9ymfS0M":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-11-10 04:45:12",231395682,[8,9,10,11],"数据原子是数据的最小独立单位","数据元素是数据的最小独立单位","一个数据项可以包含若干个数据元素","不能被计算机程序识别和处理的信息集合,不能称为数据",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},30,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_46524431","第14课会话预习","以下关于数据结构的描述,哪一个是正确的()",[21,32,41,50,59,68,73,79,82,91],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],231395675,[25,26,27,28],"数据段","数据项","数据表","数据元素","在数据结构概念中,数据的基本单位是()","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],231395676,[36,37,38,39],"数据项的类型","数据元素之间的关系","数据成员的先后顺序","数据对象的取值范围","在数据结构概念中,结构是描述()",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],231395677,[45,46,47,48],"正确性","可读性","健壮性","效率高","在算法设计中,要求算法便于理解和修改是属于算法要求的()",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],231395678,[54,55,56,57],"数据范围","数据判断","数据关系","数据来源","抽象数据类型ADT通过三方面描述,包括数据对象、数据操作和()",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],231395679,[63,64,65,66],"算法可以没有输入","算法可以包含无限个执行步骤","算法可以没有输出","算法的每个步骤允许带有歧义的","以下关于算法的描述,哪个是正确的()",{"answer":69,"createTime":5,"id":70,"options":71,"question":72,"source":30,"type":31},[],231395680,[45,46,47,48],"在算法设计中,要求算法满足具体问题的需求是属于算法要求的()",{"answer":74,"createTime":5,"id":75,"options":76,"question":78,"source":30,"type":31},[],231395681,[77,57,54,55],"数据对象","抽象数据类型ADT通过三方面描述,包括数据关系、数据操作和()",{"answer":80,"createTime":5,"id":6,"options":81,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":83,"createTime":5,"id":84,"options":85,"question":90,"source":30,"type":31},[],231395683,[86,87,88,89],"O(1)","O(n)","O(10000n)","O(n2)","设n为问题规模,以下程序的时间复杂度为() for (i=1; i<=10000; i++) for (j=1; j<=n; j++) a = a + 1",{"answer":92,"createTime":5,"id":93,"options":94,"question":99,"source":30,"type":31},[],231395684,[95,96,97,98],"线性表","顺序表","单链表","循环链表","以下结构中,哪一个是属于逻辑结构()"]