[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fygfKgXhnmz1J1Azj1uoxvtn-rUuIgoTa1XME6zPiWW4":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2025-10-30 09:02:25",225898148,[8,9,10,11],"动态结构和静态结构","紧凑结构和非紧凑结构","线性结构和非线性结构","内部结构和外部结构",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},45,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_46421366","第一章 人工智能概论作业","在数据结构中,从逻辑上可以把数据结构分成( )",[21,26,33,38,47,52,61,70,79,88],{"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":32,"source":24,"type":25},[],225898149,[30,31],"逻辑结构","物理结构","数据的( )结构反映数据元素之间的逻辑关系,由抽象数据类型来表达",{"answer":34,"createTime":5,"id":35,"options":36,"question":37,"source":24,"type":25},[],225898150,[30,31],"数据的( )结构反映数据元素及之间的关系在计算机中是如何存储和组织的",{"answer":39,"createTime":5,"id":40,"options":41,"question":46,"source":24,"type":25},[],225898151,[42,43,44,45],"线性结构","集合结构","树状结构","图状结构","设数据的逻辑结构如下B1=(D,R)D={1,2,3,4,5,6,7,8,9}R={}R={<1,2>,<1,3>,<3,4>,<3,5>,<4,6>,<4,7>,<5,8>,<7,9>}.请说明是何种数据结构",{"answer":48,"createTime":5,"id":49,"options":50,"question":51,"source":24,"type":25},[],225898152,[43,42,44,45],"上课老师点名用的点名册属于哪类逻辑结构( )",{"answer":53,"createTime":5,"id":54,"options":55,"question":60,"source":24,"type":25},[],225898153,[56,57,58,59],"线性表","非线性表","顺序存储结构","链式存储结构","在存储器中,数据元素是依次存放的,数据元素在物理存储器上的位置关系体现了他们在逻辑上的顺序关系.这是对( )的描述",{"answer":62,"createTime":5,"id":63,"options":64,"question":69,"source":24,"type":25},[],225898154,[65,66,67,68],"数据的操作方法","数据元素的类型","数据元素之间的关系","数据的存取方法","在存储数据时,通常不仅要存储各数据元素的值,而且还要存储( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":24,"type":25},[],225898155,[74,75,76,77],"效率、难度","可行性、确定性","正确性、稳定性","时间复杂度、空间复杂度","数据结构中评价算法的两个重要指标是( )",{"answer":80,"createTime":5,"id":81,"options":82,"question":87,"source":24,"type":25},[],225898156,[83,84,85,86],"问题规模是n的平方","执行时间等于n的平方","执行时间与n的平方成正比","问题规模与n的平方成正比","某算法的时间复杂度为平方阶,表示为O(n*n),表明该算法的( )",{"answer":89,"createTime":5,"id":90,"options":91,"question":96,"source":24,"type":25},[],225898157,[92,93,94,95],"O(logn) (该对数以2为底)","O(n)","O(nlogn) (该对数以2为底)","O(n*n) (平方阶)","以下算法的时间复杂度为:( )int count=0, k, j;for( k=1; k<=n; k*=2) for(j=1; j<=n; j++) count++"]