[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fFxJ1EaP2fOaiqNqKhHRcLCDWWcVpC3yROgxMJz5JcCo":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-05-28 11:41:48",32739545,[8,9,10,11],"可以使用贪心算法找到最优解","物品可以分解","使用分治法可求解任意0\u002F1背包问题","对于同一背包和相同的物品,做背包问题取得的总价值一定大于等于做0-1背包问题取得的总价值",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},28,"5a8549a948a2505d2a98bf0d8dcc39a5","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F205507044fc23821f8d0e4afbc39cc8e.jpg","算法设计与分析","exam_94651213","\"算法设计与分析\"课程模拟考试","关于0-1背包问题,以下描述正确的是___________",[21,32,41,50,59,62,70,79,88,97],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],32739541,[25,26,27,28],"解空间搜索","分治法","贪心法","动态规划法","在数据结构课程中,我们学习的求关键路径的算法,本质上都属于______________","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],32739542,[36,37,38,39],"黄志鸿的女友的做法体现了二分的思想","黄志鸿同学的做法体现了贪心的思想","如果未办理借阅手续的图书有2本以上,则黄志鸿同学的做法依旧适用","黄志鸿同学每次都把图书分大致平成两份,说明他在进行二分的时候考虑到了"平衡子问题"","某日,黄志鸿同学陪女友去图书馆做义工,女友要将一大堆办理了借阅手续的书搬出借阅室,但是已知其中混入了一本(仅一本)未办理借阅手续的书,导致警报器响了.女友准备将图书一本一本去测,找到未办理借阅手续的图书.但是黄志鸿抢过这堆图书,把图书分大致平成两份,第一份过报警器时没响,于是黄志鸿将剩下的那一份再大致平分成两份,接着测试报警器……反复如此,很快找到了那本没有办理借阅手续的图书.请问下列说法正确的是()(题目所涉及的故事纯属虚构)",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],32739543,[45,46,47,48],"用递归法求斐波那契数列的算法的算法中,对斐波那契数列问题进行分解时,子问题的性质发生了变化","用递归法求斐波那契数列的算法的算法中,对斐波那契数列问题进行分解时,子问题的解难以合并成为原问题的解","用递归法求斐波那契数列的算法的算法中,对斐波那契数列问题进行分解时,出现了"重叠子问题",导致了大量重复计算","用递归法求斐波那契数列的算法的算法中,对斐波那契数列问题进行分解时,难以找到递归的终止条件","用迭代法求斐波那契数列的算法,效率要优于用递归法求斐波那契数列的算法,这是因为()",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],32739544,[54,55,56,57],"Prim算法","Kruskal算法","Dijkstra算法","深度优先遍历","以下不属于贪心算法的是( )",{"answer":60,"createTime":5,"id":6,"options":61,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":63,"createTime":5,"id":64,"options":65,"question":69,"source":30,"type":31},[],32739546,[66,67,25,68],"动态规划","贪心","分治","通过对将棋盘分解成4个大小相同的子棋盘,来求解棋盘的L形骨牌覆盖问题算法利用的算法思想是()",{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":30,"type":31},[],32739547,[74,75,76,77],"0(都不正确)","1","2","3","关于旅行商问题的解空间搜索,有下面四句话:① 分支限界法求解旅行商问题的时间效率一定高于回溯法求解旅行商问题的时间效率② 回溯法求解旅行商问题的时间效率一定高于分支限界法求解旅行商问题的时间效率③ 分支限界法求解旅行商问题的空间效率一定高于回溯法求解旅行商问题的空间效率④ 回溯法求解旅行商问题的空间效率一定高于分支限界法求解旅行商问题的空间效率上述四句说法中,正确的有()句",{"answer":80,"createTime":5,"id":81,"options":82,"question":87,"source":30,"type":31},[],32739548,[83,84,85,86],"分而治之","以空间换时间","碰壁就回头","以时间换空间","下列哪句话最能体现回溯法的特点",{"answer":89,"createTime":5,"id":90,"options":91,"question":96,"source":30,"type":31},[],32739549,[92,93,94,95],"最长公共子序列问题","0-1背包问题","最大连续子序列和问题(最大子段和问题)","二分查找问题","下列问题中,不能使用动态规划法求解的问题是()",{"answer":98,"createTime":5,"id":99,"options":100,"question":105,"source":30,"type":31},[],32739550,[101,102,103,104],"每次决策必须是在当前看来最优的决策,才能找到问题的最优解","当前所作的决策不会影响后面的决策","原问题的最优解,包含的子问题的解,在子问题中也是最优的","在问题划分阶段的时候,要保证每个阶段的独立性","最优子结构性质指的是_________________"]