[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fxzvuL2A84k34o8fUADFkp8e798V6ZFXJHwE1OFb4h_s":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":24,"origin":108,"createTime":115},70469800,"v1","我国中小企业板块市场设立在(),创业板市场设立在()",[8,9,10,11],"上海证券交易所;上海证券交易所","深圳证券交易所;上海证券交易所","上海证券交易所;深圳证券交易所","深圳证券交易所;深圳证券交易所",[],[14,27,37,47,57,64,74,84,94,100],{"id":15,"source":5,"question":16,"options":17,"answer":22,"related":23,"type":24,"origin":25,"createTime":26},65766878,"分支限界法在问题的解空间树中,按( )策略,从根结点出发搜索解空间树",[18,19,20,21],"扩展结点优先","广度优先","深度优先","活结点优先",[],[],0,null,"2023-06-16T19:33:07+08:00",{"id":28,"source":5,"question":29,"options":30,"answer":35,"related":36,"type":24,"origin":25,"createTime":26},65766879,"在对问题的解空间树进行搜索的方法中,一个结点最多有一次机会成为活结点的是( )",[31,32,33,34],"回溯法","分支限界法","回溯法和分支限界法","回溯法求解子集树问题",[],[],{"id":38,"source":5,"question":39,"options":40,"answer":45,"related":46,"type":24,"origin":25,"createTime":26},65766880,"分支限界法与回溯法都是在问题的解空间树T上搜索问题的解,二者( )",[41,42,43,44],"求解目标不同,搜索方式相同","求解目标不同,搜索方式也不同","求解目标相同,搜索方式也相同","求解目标相同,搜索方式不同",[],[],{"id":48,"source":5,"question":49,"options":50,"answer":55,"related":56,"type":24,"origin":25,"createTime":26},65766881,"当所给的问题是从n个元素的集合S中找出满足某种性质的子集时,相应的解空间树称为子集树.子集树问题复杂性通常是()",[51,52,53,54],"O(n)","\u003Cimg src=\"https:\u002F\u002Fmooc1.chaoxing.com\u002Fananas\u002Flatex\u002Fp\u002F35812\">","\u003Cimg src=\"https:\u002F\u002Fmooc1.chaoxing.com\u002Fananas\u002Flatex\u002Fp\u002F353590\">","\u003Cimg src=\"https:\u002F\u002Fmooc1.chaoxing.com\u002Fananas\u002Flatex\u002Fp\u002F1058027\">",[],[],{"id":58,"source":5,"question":59,"options":60,"answer":62,"related":63,"type":24,"origin":25,"createTime":26},65766882,"在对问题的解空间树进行搜索的方法中,一个活结点有多次机会成为活结点的是( )",[32,31,61,33],"动态规划",[],[],{"id":65,"source":5,"question":66,"options":67,"answer":72,"related":73,"type":24,"origin":25,"createTime":26},65766883,"回溯法求解最优装载问题时,若待选物品为m种,则该问题的解空间树的结点个数为( )",[68,69,70,71],"2m+1-1","2m+1","m","2m",[],[],{"id":75,"source":5,"question":76,"options":77,"answer":82,"related":83,"type":24,"origin":25,"createTime":26},65766884,"回溯法的效率不依赖于下列哪个因素( )",[78,79,80,81],"计算约束函数的时间","满足显约束值的个数","确定解空间的时间","计算限界函数的时间",[],[],{"id":85,"source":5,"question":86,"options":87,"answer":92,"related":93,"type":24,"origin":25,"createTime":26},65766885,"用分支限界法求解TSP问题时的解空间是()",[88,89,90,91],"广度优先生成树","排列树","深度优先生成树","子集树",[],[],{"id":95,"source":5,"question":96,"options":97,"answer":98,"related":99,"type":24,"origin":25,"createTime":26},65766886,"回溯法在问题的解空间树中,按( )策略,从根结点出发搜索解空间树",[19,18,20,21],[],[],{"id":101,"source":5,"question":102,"options":103,"answer":106,"related":107,"type":24,"origin":25,"createTime":26},65766887,"回溯法和分支限界法的问题的解空间树不会是( )",[104,91,89,105],"有序树","无序树",[],[],{"courseName":109,"courseImg":110,"workName":111,"workId":112,"count":113,"courseId":114},"金融市场基础知识","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc160457794c431b057997aa689a3ce86.png","四、回溯法与分支限界法","work_28263007",92,"e4397f5b14390982384321e45dd83ffb","2023-06-18T22:42:31+08:00"]