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