[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fA25pIVSKwgm_YpXTi0G5b1dUh-xtUmZrOoMcyJID6VE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":8,"question":15,"related":16,"source":27,"type":59},[],"2025-12-11 16:21:11",260164092,[],{"count":9,"courseId":10,"courseImg":11,"courseName":12,"workId":13,"workName":14},5,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_48519094","数分作业4-4","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2e7fc286df7083ea2d1736962e5d2496.png\"> \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7e504a51f09f79038783fbb7ea7013ad.png\">",[17,29,38,47,56],{"answer":18,"createTime":19,"id":20,"options":21,"question":26,"source":27,"type":28},[],"2025-12-09 12:23:30",257065691,[22,23,24,25],"求解目标不同,搜索方式相同","求解目标不同,搜索方式也不同","求解目标相同,搜索方式不同","求解目标相同,搜索方式也相同","分支限界法与回溯法都是在问题的解空间树上搜索问题的解,二者( )","v1",0,{"answer":30,"createTime":19,"id":31,"options":32,"question":37,"source":27,"type":28},[],257065692,[33,34,35,36],"先进先出","后进先出","结点的优先级","随机","优先队列式分支限界法选取扩展结点的原则是( )",{"answer":39,"createTime":19,"id":40,"options":41,"question":46,"source":27,"type":28},[],257065694,[42,43,44,45],"广度优先","最小耗费优先","最大效益优先","深度优先","下面不是分支界限法搜索方式的是( )",{"answer":48,"createTime":19,"id":49,"options":50,"question":55,"source":27,"type":28},[],257065695,[51,52,53,54],"回溯法","分支限界法","回溯法和分支限界法","动态规划法","在对问题的解空间树进行搜索的方法中,一个活结点最多有一次机会成为扩展结点的是( )",{"answer":57,"createTime":5,"id":6,"options":58,"question":15,"source":27,"type":59},[],[],4]