[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f8NPcNcTZV-jwjRRbR2UXkkCpICQH2eLyckfFIUXmfAw":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":8,"question":15,"related":16,"source":22,"type":23},[],"2023-05-25 21:50:50",29648588,[],{"count":9,"courseId":10,"courseImg":11,"courseName":12,"workId":13,"workName":14},20,"cb4702c60ee7060764eae6b09e9b223a","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff4518f75fd1598ad27a3dd5ad68842d2.jpg","算法设计与分析","exam_94109824","模拟试题2","计算机的资源最重要的是 和 资源.因而,算法的复杂性有 和 之分",[17,24,29,34,37,42,47,52,58,63],{"answer":18,"createTime":5,"id":19,"options":20,"question":21,"source":22,"type":23},[],29648585,[],"算法就是一组有穷的 ,它们规定了解决某一特定类型问题的","v1",2,{"answer":25,"createTime":5,"id":26,"options":27,"question":28,"source":22,"type":23},[],29648586,[],"在进行问题的计算复杂性分析之前,首先必须建立求解问题所用的计算模型.3个基本计算模型是 、 、",{"answer":30,"createTime":5,"id":31,"options":32,"question":33,"source":22,"type":23},[],29648587,[],"算法的复杂性是 的度量,是评价算法优劣的重要依据",{"answer":35,"createTime":5,"id":6,"options":36,"question":15,"source":22,"type":23},[],[],{"answer":38,"createTime":5,"id":39,"options":40,"question":41,"source":22,"type":23},[],29648589,[],"f(n)= 6×2n+n2,f(n)的渐进性态f(n)= O( )",{"answer":43,"createTime":5,"id":44,"options":45,"question":46,"source":22,"type":23},[],29648590,[],"贪心算法总是做出在当前看来 的选择.也就是说贪心算法并不从整体最优考虑,它所做出的选择只是在某种意义上的",{"answer":48,"createTime":5,"id":49,"options":50,"question":51,"source":22,"type":23},[],29648591,[],"许多可以用贪心算法求解的问题一般具有2个重要的性质: 性质和 性质",{"answer":53,"createTime":5,"id":54,"options":55,"question":56,"source":22,"type":57},[],29648592,[],"简单描述分治法的基本思想",4,{"answer":59,"createTime":5,"id":60,"options":61,"question":62,"source":22,"type":57},[],29648593,[],"简述动态规划方法所运用的最优化原理",{"answer":64,"createTime":5,"id":65,"options":66,"question":67,"source":22,"type":57},[],29648594,[],"何谓最优子结构性质"]