[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fP4L2bYDvfci3dLcGvtZG_f6G0SYuHGlEVCRegpuvy5Y":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":16,"related":17,"source":23,"type":24},[],"2023-06-21 23:15:03",897740783,[8,9],"对","错",{"courseId":11,"courseImg":12,"courseName":13,"workId":14,"workName":15},"1000008932","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F565a18baa1564c24b33cd6f84945033a.jpg","算法分析与设计","40286319","第九章单元测试","分支限界法不能解决0\u002F1背包问题",[18,25,35,45,54,63,72,75,83,92],{"answer":19,"createTime":5,"id":20,"options":21,"question":22,"source":23,"type":24},[],897740633,[8,9],"使用限界函数作优先级, 第一个扩展的叶子就是最优解","v2",3,{"answer":26,"createTime":5,"id":27,"options":28,"question":33,"source":23,"type":34},[],897740645,[29,30,31,32],"回溯","分支限界","回溯和分支限界","回溯求解子集树问题","在对问题的解空间树进行搜索的方法中,一个活结点最多有一次机会成为活结点的是( )",0,{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":23,"type":44},[],897740765,[39,40,41,42],"求解目标不同","搜索方式不同","对扩展结点的扩展方式不同","存储空间的要求不同","分支限界法与回溯法的不同点是什么",1,{"answer":46,"createTime":5,"id":47,"options":48,"question":53,"source":23,"type":34},[],897740767,[49,50,51,52],"使用限界函数作优先级, 第一个加入队列的叶子就是最优解","用约束函数在扩展结点处剪去不满足约束的子树","用限界函数剪去得不到最优解的子树","回溯和分支限界都是动态生成解空间树","下面说法不正确的是()",{"answer":55,"createTime":5,"id":56,"options":57,"question":62,"source":23,"type":44},[],897740772,[58,59,60,61],"针对所给问题,定义问题的解空间(对解进行编码)","确定易于搜索的解空间结构(按树或图组织解)","定义最优子结构","以广度优先或以最小耗费(最大收益)优先的方式搜索解空间,并在搜索过程中用剪枝函数避免无效搜索","用分支限界法设计算法的步骤是",{"answer":64,"createTime":5,"id":65,"options":66,"question":71,"source":23,"type":34},[],897740775,[67,68,69,70],"先进先出","后进先出","结点的优先级","随机","优先队列式分支限界法选取扩展结点的原则是",{"answer":73,"createTime":5,"id":6,"options":74,"question":16,"source":23,"type":24},[],[8,9],{"answer":76,"createTime":5,"id":77,"options":78,"question":82,"source":23,"type":34},[],897740857,[79,30,80,81],"回溯算法","动态规划","贪心算法","FIFO是( )的搜索方式",{"answer":84,"createTime":5,"id":85,"options":86,"question":91,"source":23,"type":34},[],897740883,[87,88,89,90],"子集树","排列树","深度优先生成树","广度优先生成树","分支限界法解旅行商问题时的解空间树是",{"answer":93,"createTime":5,"id":94,"options":95,"question":96,"source":23,"type":24},[],897740893,[8,9],"优先队列式分支限界法按照队列先进先出的原则,选取下一个节点为扩展结点"]