[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fMMQqjpvEKqwUn7a6sE_9F1N8zbrq53-YDYpwIR-xH4s":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":18,"origin":111,"createTime":20},160197469,"v1","在数据结构中,从逻辑上可以把数据结构分成( )",[8,9,10,11],"动态和静态结构","紧凑接和非紧凑结构","线性与非线性结构","内部结构和外部结构",[],[14,21,30,41,51,62,74,83,92,102],{"id":4,"source":5,"question":6,"options":15,"answer":16,"related":17,"type":18,"origin":19,"createTime":20},[8,9,10,11],[],[],0,null,"2024-09-25T19:19:33+08:00",{"id":22,"source":5,"question":23,"options":24,"answer":28,"related":29,"type":18,"origin":19,"createTime":20},160197474,"算法的时间复杂度取决于( )",[25,26,27],"问题的规模","待处理数据的初态","问题的规模和待处理数据的初态",[],[],{"id":31,"source":5,"question":32,"options":33,"answer":39,"related":40,"type":18,"origin":19,"createTime":20},160197477,"以下说法错误的是()",[34,35,36,37,38],"用数字式计算机解决问题的实质是对数据的加工处理","程序设计的实质是数据处理","数据的逻辑结构是数据的组织形式,基本运算规定了数据的基本操作方式","运算实现是完成运算功能的算法,或这些算法的设计","数据处理方式总是与数据的某种相应的表示形式相联系,反之亦然",[],[],{"id":42,"source":5,"question":43,"options":44,"answer":49,"related":50,"type":18,"origin":19,"createTime":20},160197481,"根据数据元素之间关系的不同特性,以下四类基本的逻辑结构反映了四类基本的数据组织形式.以下解释错误的是()",[45,46,47,48],"集合中任何两个结点之间都有逻辑关系,但组织形式松散","线性结构中结点按逻辑关系依次排列形成一条\"锁链\"","树形结构具有分支、层次特性,其形态有点像自然界中的树","图状结构中的各个结点按逻辑关系互相缠绕,任何两个结点都可以邻接",[],[],{"id":52,"source":5,"question":53,"options":54,"answer":60,"related":61,"type":18,"origin":19,"createTime":20},160197485,"关于逻辑结构,以下说法错误的是()",[55,56,57,58,59],"逻辑结构与数据元素本身的形成、内容无关","逻辑结构与数据元素的相对位置有关","逻辑结构与所含结点个数无关","一些表面上很不相同的数据可以有相同的逻辑结构","逻辑结构是数据组织的某种\"本质性\"的东西",[],[],{"id":63,"source":5,"question":64,"options":65,"answer":71,"related":72,"type":18,"origin":19,"createTime":73},160197489,"根据操作的效果,可将运算分成加工型运算、引用型运算两种基本类型.对于表格处理中的五种功能,以下解释错误的是()",[66,67,68,69,70],"查找 引用型运算,功能是找出满足某种条件的结点在S(线形结构)中的位置","读取 引用型运算,功能是读出S(线形结构)中某指定位置结点的内容","插入 引用型运算,功能是在S(线形结构)的某指定位置上增加一个新结点","删除 加工型运算,功能是撤消S(线形结构)某指定位置上的结点","更新 加工型运算,功能是修改S(线形结构)中某指定结点的内容",[],[],"2024-09-25T19:19:34+08:00",{"id":75,"source":5,"question":76,"options":77,"answer":81,"related":82,"type":18,"origin":19,"createTime":73},160197493,"一般地,一个存储结构包括以下三个主要部分.以下说法错误的是()",[78,79,80],"存储结点,每个存储结点可以存放一个或一个以上的数据元素","数据元素之间关联方式的表示,也就是逻辑结构的机内表示","附加设施,如为便于运算实现而设置的\"哑结点\"等等",[],[],{"id":84,"source":5,"question":76,"options":85,"answer":90,"related":91,"type":18,"origin":19,"createTime":73},160197497,[86,87,88,89],"每个存储结点只能存放一个数据元素","数据元素之间的关联方式可由存储结点之间的关联方式直接表达","一种存储结构都可以在两个级别上讨论.其一是机器级,其二是语言级","语言级描述可经编绎自动转换成机器级,因此也可以看成是一种机内表示",[],[],{"id":93,"source":5,"question":94,"options":95,"answer":100,"related":101,"type":18,"origin":19,"createTime":73},160197501,"通常从正确性、易读性、健壮性、高效性等四几个方面评价算法(包括程序)的质量.以下解释错误的是()",[96,97,98,99],"正确性 算法应能正确地实现预定的功能(即处理要求)","易读性 算法应易于阅读和理解,以便于调试、修改和扩充","健壮性 当环境发生变化时,算法能适当地做出反应或进行处理,不会产生不需要的运行结果","高效性 即达到所需要的时间性能",[],[],{"id":103,"source":5,"question":104,"options":105,"answer":109,"related":110,"type":18,"origin":19,"createTime":73},160197505,"对于数据结构课程的主要内容,以下解释错误的是()",[106,107,108],"数据结构的定义,包括逻辑结构、存储结构和基本运算集","数据结构的实现,包括存储实现、运算实现和基本运算集","数据结构的评价和选择,包括逻辑结构的选择、基本运算集的选择和存储方式的选择",[],[],{"courseName":112,"courseImg":113,"workName":114,"workId":115,"count":116,"courseId":117},"数据结构","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","第一章","work_37065123",69,"1e20f3e464666c92dc37d29542751b13"]