[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fAbk9Qmn4XXD337Ecj9tUhFVeLbRME55mdw4v2mMuJW8":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":28,"type":29},[],"2025-04-28 08:10:11",1069534971,[8,9,10,11],"问题可以被拆分为互不重叠的子问题","问题的解决依赖于全局信息","问题的规模不够大","子问题之间存在重叠部分",{"courseId":13,"workId":14,"workName":15},"1000128449","61792890","第四章单元测试","分治法的核心思想是将一个复杂的问题分解为若干个较小的相同或相似的问题,分别解决后再合并结果.那么在以下哪种情况下,分治法最为有效?( )",[18,30,42,50,59,64,73,82],{"answer":19,"createTime":20,"id":21,"options":22,"question":27,"source":28,"type":29},[],"2025-04-28 08:10:10",1069534887,[23,24,25,26],"训练","预测","评估","数据预处理","在机器学习的流程中,以下哪个步骤是用于评估模型的性能并确定其在未知数据上的泛化能力?( )","v2",0,{"answer":31,"createTime":20,"id":32,"options":33,"question":40,"source":28,"type":41},[],1069534889,[34,35,36,37,38,39],"K近邻算法(KNN)","支持向量机(SVM)","线性回归","随机森林","主成分分析(PCA)","K均值聚类","在使用Scikit-learn库进行机器学习时,以下哪些算法属于分类算法?( )",1,{"answer":43,"createTime":5,"id":44,"options":45,"question":48,"source":28,"type":49},[],1069534891,[46,47],"对","错","在状态空间问题中,初始状态是指问题开始时的状态,而目标状态是问题最终希望达到的状态.操作是指从一个状态转换到另一个状态的具体步骤,而路径是从初始状态到目标状态所经过的一系列状态和操作的组合.因此,状态空间问题的四个关键要素是相互独立的.( )",3,{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":28,"type":41},[],1069534956,[54,55,56,57],"通用问题求解与算法方法学是解决各类问题的一种系统性方法","该方法学只适用于计算机科学领域","通用问题求解与算法方法学强调问题的抽象与建模能力","理解算法方法学对于提高解决问题的效率至关重要","以下关于通用问题求解与算法方法学的描述中,哪些是正确的?( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":63,"source":28,"type":49},[],1069534958,[46,47],"贪心法是一种用于求解最优化问题的算法策略,通常在问题的每一步选择中,都选择当前看起来最优的选项.根据贪心法的特性,贪心法总是能得到全局最优解,因此它适用于所有的最优化问题.( )",{"answer":65,"createTime":5,"id":66,"options":67,"question":72,"source":28,"type":29},[],1069534960,[68,69,70,71],"它帮助我们确定解决问题所需的步骤和资源","它只是在分析问题的基础上进行的无关紧要的推理","它不涉及任何实际的行动计划","它主要关注当前状态,而忽略目标状态的设定","在问题求解过程中,识别当前状态与目标状态之间的差距是非常重要的.以下哪项最能准确描述这一过程的意义?( )",{"answer":74,"createTime":5,"id":75,"options":76,"question":81,"source":28,"type":29},[],1069534962,[77,78,79,80],"首次适应策略简单易实现,但可能导致使用更多箱子","首次适应策略能确保最优解,但实现复杂度高","首次适应策略适用于所有类型的装箱问题,能够有效减少箱子数量","首次适应策略在某些情况下能减少箱子数量,但不能保证是最优解","在装箱问题中,贪心的首次适应策略是指将物品依次放入当前最适合的箱子中.如果当前箱子无法容纳该物品,则将其放入下一个箱子.当所有物品都被放入箱子时,所用的箱子数量最少.以下哪项最能说明首次适应策略的优缺点?( )",{"answer":83,"createTime":5,"id":6,"options":84,"question":16,"source":28,"type":29},[],[8,9,10,11]]