[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fbVZoWeCvMlKa2bvIyROnmLoUO3CyWoSn1zxpefJQWqA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2025-11-10 04:45:12",231395675,[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,26,35,44,53,62,67,73,82,91],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":5,"id":28,"options":29,"question":34,"source":24,"type":25},[],231395676,[30,31,32,33],"数据项的类型","数据元素之间的关系","数据成员的先后顺序","数据对象的取值范围","在数据结构概念中,结构是描述()",{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":24,"type":25},[],231395677,[39,40,41,42],"正确性","可读性","健壮性","效率高","在算法设计中,要求算法便于理解和修改是属于算法要求的()",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":24,"type":25},[],231395678,[48,49,50,51],"数据范围","数据判断","数据关系","数据来源","抽象数据类型ADT通过三方面描述,包括数据对象、数据操作和()",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":24,"type":25},[],231395679,[57,58,59,60],"算法可以没有输入","算法可以包含无限个执行步骤","算法可以没有输出","算法的每个步骤允许带有歧义的","以下关于算法的描述,哪个是正确的()",{"answer":63,"createTime":5,"id":64,"options":65,"question":66,"source":24,"type":25},[],231395680,[39,40,41,42],"在算法设计中,要求算法满足具体问题的需求是属于算法要求的()",{"answer":68,"createTime":5,"id":69,"options":70,"question":72,"source":24,"type":25},[],231395681,[71,51,48,49],"数据对象","抽象数据类型ADT通过三方面描述,包括数据关系、数据操作和()",{"answer":74,"createTime":5,"id":75,"options":76,"question":81,"source":24,"type":25},[],231395682,[77,78,79,80],"数据原子是数据的最小独立单位","数据元素是数据的最小独立单位","一个数据项可以包含若干个数据元素","不能被计算机程序识别和处理的信息集合,不能称为数据","以下关于数据结构的描述,哪一个是正确的()",{"answer":83,"createTime":5,"id":84,"options":85,"question":90,"source":24,"type":25},[],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":24,"type":25},[],231395684,[95,96,97,98],"线性表","顺序表","单链表","循环链表","以下结构中,哪一个是属于逻辑结构()"]