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