[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$friHADN3vc_GfjS4KQvSlwu7LTecqA3FNOXXFpIvM0e0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":27,"type":28},[],"2023-10-22 08:50:22",101062788,[8,9,10,11],"单源最短路径问题","N皇后问题","最小生成树问题","背包问题",{"courseId":13,"courseImg":14,"courseName":15},"f1c7d6b3f24461ca1f3b171d087775bd","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","算法","下面问题中不能使用贪心法解决的是( )",[18,29,32,38,48,56,65,74,83,92],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],101062787,[22,23,24,25],"哈夫曼编码","单源最短路径","活动安排问题","多机调度问题","以下问题中,除了( ),其余问题都可以利用贪心算法得到全局最优解","v1",0,{"answer":30,"createTime":5,"id":6,"options":31,"question":16,"source":27,"type":28},[],[8,9,10,11],{"answer":33,"createTime":5,"id":34,"options":35,"question":37,"source":27,"type":28},[],101062791,[24,36,25,11],"最优装载问题","贪心算法不能对( )得到整体最优解",{"answer":39,"createTime":40,"id":41,"options":42,"question":47,"source":27,"type":28},[],"2023-10-22 08:50:23",101062792,[43,44,45,46],"最优前缀码问题只满足贪心选择性质,不满足最优子结构性质","最优前缀码问题不满足贪心选择性质,但满足最优子结构性质","最优前缀码问题既不满足贪心选择性质,也不满足最优子结构性质","最优前缀码问题既满足贪心选择性质,也满足最优子结构性质","关于哈夫曼算法的正确性,以下叙述正确的是( )",{"answer":49,"createTime":40,"id":50,"options":51,"question":55,"source":27,"type":28},[],101062793,[52,53,54,52],"n","n-1","n2","含有n个顶点的连通图的生成树含有( )条边",{"answer":57,"createTime":40,"id":58,"options":59,"question":64,"source":27,"type":28},[],101062795,[60,61,62,63],"{5,6,7,8}","{6,7,8,9}","{5,6,7,10}","{6,7,9,10}","某体育馆有一羽毛球场出租,现有10位客户申请租用,每个客户的开始时间和结束时间如下表所示,其中s(i)表示开始租用时间,f(i)表示结束租用时间.同一时刻,该羽毛球场只能租给一位客户,请设计一个方案,使得体育馆尽可能多地安排客户.根据贪心算法,最后应该安排的活动集合是( ). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F735ab64e9a2a53aac1bffc609082971a.png\">",{"answer":66,"createTime":40,"id":67,"options":68,"question":73,"source":27,"type":28},[],101062796,[69,70,71,72],"如果将该问题视为0-1背包问题,利用贪心算法可以得到最优解","如果将该问题视为0-1背包问题,则可以利用动态规划算法得到最优值270","如果将该问题视为背包问题,则可以采用贪心算法,得到最优值300","如果将该问题视为背包问题,利用动态规划算法可以得到最优解","假定背包容量为C=50千克,有3种物品,物品1重10千克,价值100元;物品2重20千克,价值120元;物品3重30千克,价值150元.以下叙述中,正确的是( )",{"answer":75,"createTime":40,"id":76,"options":77,"question":82,"source":27,"type":28},[],101062797,[78,79,80,81],"60\u002F2","60\u002F5","45\u002F2","45\u002F5","利用Dijkstra算法计算下图中从源顶点1到其余各顶点的最短路径,其计算结果见下表,请问,在表的空白处应该填上( ). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc4d8eec07b130e32e7342be2218b95f7.png\"> \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff1740ffec984c37b527ecbc88b8bfaaf.png\">",{"answer":84,"createTime":40,"id":85,"options":86,"question":91,"source":27,"type":28},[],101062798,[87,88,89,90],"1010","011","100","1011","字符a-g出现的频率如下表,如果已知字符f、g的Huffman编码分别为0101、0100,则字符e的Huffman编码为( ). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd31fe926caf53f77aa45c0673c5b4e90.png\">",{"answer":93,"createTime":40,"id":94,"options":95,"question":100,"source":27,"type":28},[],101062799,[96,97,98,99],"(3,4)","(3,6)","(4,6)","(3,5)","针对左图的最小生成树问题,如果采用Prim算法,则在选取(1,2)和(2,3)两条边(如右图)之后,将选择哪一条边加入到最小生成树中?( )\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F123eff9a00ea417c0761ba4112b500b0.png\"> \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc978da1c9d01e61126cbd8752be1f3b4.png\"> \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcca0e63e1dc387e0df6b33d9a315ce12.png\">"]