[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fQGjZ_HcLb6wHcYDHTz55Xxjd34uqKDbUD0-U-vQQeok":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":24,"origin":111,"createTime":26},78130300,"v1","下面关于二分查找的叙述正确的是( ) 【南京理工大学 1996 一、3 (2分)】",[8,9,10,11],"表必须有序,且表只能以顺序方式存储","表必须有序,而且只能从小到大排列","表必须有序,表可以顺序方式存储,也可以链表方式存储","表必须有序且表中数据必须是整型,实型或字符型",[],[14,27,37,47,57,67,77,81,91,101],{"id":15,"source":5,"question":16,"options":17,"answer":22,"related":23,"type":24,"origin":25,"createTime":26},78130294,"顺序查找不论在顺序线性表中还是在链式线性表中的时间复杂度为( )",[18,19,20,21],"O(n\u003Cimg src=\"\u002Fananas\u002Flatex\u002Fp\u002F129\">)","O(n)","O(n\u003Cimg src=\"\u002Fananas\u002Flatex\u002Fp\u002F388779\">)","O(1og2n)",[],[],0,null,"2023-06-23T00:20:59+08:00",{"id":28,"source":5,"question":29,"options":30,"answer":35,"related":36,"type":24,"origin":25,"createTime":26},78130295,"?设有n个关键字具有相同的Hash函数值,则用线性探测法把这n个关键字映射到HASH表中需要做( )次线性探测",[31,32,33,34],"n(n+1)\u002F2","n(n-1)\u002F2","n(n+1)","n2",[],[],{"id":38,"source":5,"question":39,"options":40,"answer":45,"related":46,"type":24,"origin":25,"createTime":26},78130296,"当在一个有序的顺序存储表上查找一个数据时,即可用折半查找,也可用顺序查找,但前者比后者的查找速度( ) 【南京理工大学 1997 一、7 (2分)】",[41,42,43,44],"不一定","在大部分情况下要快","必定快","取决于表递增还是递减",[],[],{"id":48,"source":5,"question":49,"options":50,"answer":55,"related":56,"type":24,"origin":25,"createTime":26},78130297,"对N个元素的表做顺序查找时,若查找每个元素的概率相同,则平均查找长度为( )【南京理工大学1998一、7(2分)】",[51,52,53,54],"N\u002F2","(N+1)\u002F2","N","[(1+N)*N ]\u002F2",[],[],{"id":58,"source":5,"question":59,"options":60,"answer":65,"related":66,"type":24,"origin":25,"createTime":26},78130298,"设顺序表的长度为n,则顺序查找的平均比较次数为( )",[61,62,63,64],"n","n\u002F2","(n-1)\u002F2","(n+1)\u002F2",[],[],{"id":68,"source":5,"question":69,"options":70,"answer":75,"related":76,"type":24,"origin":25,"createTime":26},78130299,"对于静态表顺序查找算法,若在表头设置监视哨,则正确的查找方式是( )",[71,72,73,74],"从第1个元素往后查找该数据元素","从第0个元素往后查找该数据元素","与查找顺序无关","从第n个元素开始往前查找该数据元素",[],[],{"id":4,"source":5,"question":6,"options":78,"answer":79,"related":80,"type":24,"origin":25,"createTime":26},[8,9,10,11],[],[],{"id":82,"source":5,"question":83,"options":84,"answer":89,"related":90,"type":24,"origin":25,"createTime":26},78130301,"散列函数有一个共同的性质,即函数值应当以( )取其值域的每个值",[85,86,87,88],"同等概率","最大概率","平均概率","最小概率",[],[],{"id":92,"source":5,"question":93,"options":94,"answer":99,"related":100,"type":24,"origin":25,"createTime":26},78130302,"散列表的平均查找长度( )",[95,96,97,98],"与处理冲突方法有关而与表的长度无关","与处理冲突方法有关且与表的长度有关","与处理冲突方法无关且与表的长度无关","与处理冲突方法无关而与表的长度有关",[],[],{"id":102,"source":5,"question":103,"options":104,"answer":109,"related":110,"type":24,"origin":25,"createTime":26},78130303,"解决hash法中出现的冲突问题常采用的几种方式是( )",[105,106,107,108],"数字分析法,除余法,线性探测法","线性探测法,平方探测法,多重散列法,链地址法","数字分析法,线性探测法,多重散列法","数字分析法,除余法,平方取中法",[],[],{"courseName":112,"courseImg":113,"workName":114,"workId":115,"count":116,"courseId":117},"数据结构（2023年春季学期）","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe09e38526690498f8deefb01dec2d88e.jpg","第九章 查找-单选题","work_28272793",35,"70f94d69823a7e3b2521dc7eda29e70c"]