[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fUVuPpNpabyR7oNwFuGcfA53Ui3HoPbYh3mI9ktBNXrY":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":17,"related":18,"source":24,"type":25},[],"2025-11-19 17:53:51",237245317,[8,9],"正确","错误",{"count":11,"courseId":12,"courseImg":13,"courseName":14,"workId":15,"workName":16},44,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_47644567","Unit 2 Test","分支限界法与回溯法的搜索方式不同.( )",[19,26,29,34,39,44,49,54,59,64],{"answer":20,"createTime":5,"id":21,"options":22,"question":23,"source":24,"type":25},[],237245316,[8,9],"快速排序的划分方法包括取中间元素作为基准.( )","v1",3,{"answer":27,"createTime":5,"id":6,"options":28,"question":17,"source":24,"type":25},[],[8,9],{"answer":30,"createTime":5,"id":31,"options":32,"question":33,"source":24,"type":25},[],237245318,[8,9],"动态规划与贪心算法的主要区别是贪心算法总是做出局部最优选择.( )",{"answer":35,"createTime":5,"id":36,"options":37,"question":38,"source":24,"type":25},[],237245319,[8,9],"给定无向连通带权图 G=(V,E),prim 算法的时间复杂度 O (n³)(n 为图的顶点个数).( )",{"answer":40,"createTime":5,"id":41,"options":42,"question":43,"source":24,"type":25},[],237245320,[8,9],"在 0-1 背包问题中,用 c [i][j] 描述子问题 "1...i 共 i 个物品,背包容量为 j 的最优值" 时,当 j≥w_i 时,物品可以装入,此时 c [i][j]=max (c [i-1][j],c [i-1][j-w_i]+v_i).( )",{"answer":45,"createTime":5,"id":46,"options":47,"question":48,"source":24,"type":25},[],237245321,[8,9],"分支限界法搜索过程中,扩展结点一次性生成所有的孩子结点.( )",{"answer":50,"createTime":5,"id":51,"options":52,"question":53,"source":24,"type":25},[],237245322,[8,9],"快速排序的时间复杂度为 O (n²).( )",{"answer":55,"createTime":5,"id":56,"options":57,"question":58,"source":24,"type":25},[],237245323,[8,9],"贪心算法的特点是总是能找到最优解.( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":63,"source":24,"type":25},[],237245324,[8,9],"Kruskal 算法的典型应用场景包括最短路径规划.( )",{"answer":65,"createTime":5,"id":66,"options":67,"question":68,"source":24,"type":25},[],237245325,[8,9],"Kruskal 算法的典型应用场景包括网络布线.( )"]