[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$frDr_QgMnL8Aungi3kHdLLekm4VOugm3MzB-zsWGNEsQ":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":28,"type":29},[],"2023-10-22 08:50:23",101062798,[8,9,10,11],"1010","011","100","1011",{"courseId":13,"courseImg":14,"courseName":15},"f1c7d6b3f24461ca1f3b171d087775bd","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","算法","字符a-g出现的频率如下表,如果已知字符f、g的Huffman编码分别为0101、0100,则字符e的Huffman编码为( ). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd31fe926caf53f77aa45c0673c5b4e90.png\">",[18,30,39,45,54,62,71,80,89,92],{"answer":19,"createTime":20,"id":21,"options":22,"question":27,"source":28,"type":29},[],"2023-10-22 08:50:22",101062787,[23,24,25,26],"哈夫曼编码","单源最短路径","活动安排问题","多机调度问题","以下问题中,除了( ),其余问题都可以利用贪心算法得到全局最优解","v1",0,{"answer":31,"createTime":20,"id":32,"options":33,"question":38,"source":28,"type":29},[],101062788,[34,35,36,37],"单源最短路径问题","N皇后问题","最小生成树问题","背包问题","下面问题中不能使用贪心法解决的是( )",{"answer":40,"createTime":20,"id":41,"options":42,"question":44,"source":28,"type":29},[],101062791,[25,43,26,37],"最优装载问题","贪心算法不能对( )得到整体最优解",{"answer":46,"createTime":5,"id":47,"options":48,"question":53,"source":28,"type":29},[],101062792,[49,50,51,52],"最优前缀码问题只满足贪心选择性质,不满足最优子结构性质","最优前缀码问题不满足贪心选择性质,但满足最优子结构性质","最优前缀码问题既不满足贪心选择性质,也不满足最优子结构性质","最优前缀码问题既满足贪心选择性质,也满足最优子结构性质","关于哈夫曼算法的正确性,以下叙述正确的是( )",{"answer":55,"createTime":5,"id":56,"options":57,"question":61,"source":28,"type":29},[],101062793,[58,59,60,58],"n","n-1","n2","含有n个顶点的连通图的生成树含有( )条边",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":28,"type":29},[],101062795,[66,67,68,69],"{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":72,"createTime":5,"id":73,"options":74,"question":79,"source":28,"type":29},[],101062796,[75,76,77,78],"如果将该问题视为0-1背包问题,利用贪心算法可以得到最优解","如果将该问题视为0-1背包问题,则可以利用动态规划算法得到最优值270","如果将该问题视为背包问题,则可以采用贪心算法,得到最优值300","如果将该问题视为背包问题,利用动态规划算法可以得到最优解","假定背包容量为C=50千克,有3种物品,物品1重10千克,价值100元;物品2重20千克,价值120元;物品3重30千克,价值150元.以下叙述中,正确的是( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":28,"type":29},[],101062797,[84,85,86,87],"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":90,"createTime":5,"id":6,"options":91,"question":16,"source":28,"type":29},[],[8,9,10,11],{"answer":93,"createTime":5,"id":94,"options":95,"question":100,"source":28,"type":29},[],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\">"]