[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fUhapxOlCX7Dy4n3ymU5vGyw__isYBf2D36GTpdKp3wQ":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":26,"type":27},[],"2023-06-16 19:33:07",65766886,[8,9,10,11],"广度优先","扩展结点优先","深度优先","活结点优先",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},92,"67283bba0503bdd4c3dc61ca6d7c5acc","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","算法设计与分析","work_28263007","四、回溯法与分支限界法","回溯法在问题的解空间树中,按( )策略,从根结点出发搜索解空间树",[21,28,37,46,55,61,70,79,88,91],{"answer":22,"createTime":5,"id":23,"options":24,"question":25,"source":26,"type":27},[],65766878,[9,8,10,11],"分支限界法在问题的解空间树中,按( )策略,从根结点出发搜索解空间树","v1",0,{"answer":29,"createTime":5,"id":30,"options":31,"question":36,"source":26,"type":27},[],65766879,[32,33,34,35],"回溯法","分支限界法","回溯法和分支限界法","回溯法求解子集树问题","在对问题的解空间树进行搜索的方法中,一个结点最多有一次机会成为活结点的是( )",{"answer":38,"createTime":5,"id":39,"options":40,"question":45,"source":26,"type":27},[],65766880,[41,42,43,44],"求解目标不同,搜索方式相同","求解目标不同,搜索方式也不同","求解目标相同,搜索方式也相同","求解目标相同,搜索方式不同","分支限界法与回溯法都是在问题的解空间树T上搜索问题的解,二者( )",{"answer":47,"createTime":5,"id":48,"options":49,"question":54,"source":26,"type":27},[],65766881,[50,51,52,53],"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":56,"createTime":5,"id":57,"options":58,"question":60,"source":26,"type":27},[],65766882,[33,32,59,34],"动态规划","在对问题的解空间树进行搜索的方法中,一个活结点有多次机会成为活结点的是( )",{"answer":62,"createTime":5,"id":63,"options":64,"question":69,"source":26,"type":27},[],65766883,[65,66,67,68],"2m+1-1","2m+1","m","2m","回溯法求解最优装载问题时,若待选物品为m种,则该问题的解空间树的结点个数为( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":26,"type":27},[],65766884,[74,75,76,77],"计算约束函数的时间","满足显约束值的个数","确定解空间的时间","计算限界函数的时间","回溯法的效率不依赖于下列哪个因素( )",{"answer":80,"createTime":5,"id":81,"options":82,"question":87,"source":26,"type":27},[],65766885,[83,84,85,86],"广度优先生成树","排列树","深度优先生成树","子集树","用分支限界法求解TSP问题时的解空间是()",{"answer":89,"createTime":5,"id":6,"options":90,"question":19,"source":26,"type":27},[],[8,9,10,11],{"answer":92,"createTime":5,"id":93,"options":94,"question":97,"source":26,"type":27},[],65766887,[95,86,84,96],"有序树","无序树","回溯法和分支限界法的问题的解空间树不会是( )"]