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