[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$ffOIZMJGwF8MuMYkU_sFC_EGBpPNmIciE_CLfiOgKUqw":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2025-10-08 11:50:23",219750784,[8,9,10,11],"近似","置换","对数","重构",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},125,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","exam_167586472","","KdB-树的插入可以使用()的方法",[21,33,42,51,60,69,78,87,96,105],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2025-10-08 11:50:22",219750775,[26,27,28,29],"Ratio Bound","相对误差","绝对误差","(1-ℇ)-近似","以下()不是衡量分析近似解代价与优化解代价差距的方法","v1",0,{"answer":34,"createTime":5,"id":35,"options":36,"question":41,"source":31,"type":32},[],219750776,[37,38,39,40],"分类","区分","确认","搜索","人脸识别是利用众包改进图像()的例子",{"answer":43,"createTime":5,"id":44,"options":45,"question":50,"source":31,"type":32},[],219750777,[46,47,48,49],"避免创建对象","避免缓冲","避免通信","避免Mapper和Reducer间的全局变量传递","在实现MapReduce程序时,需要注意的事项不包括()",{"answer":52,"createTime":5,"id":53,"options":54,"question":59,"source":31,"type":32},[],219750778,[55,56,57,58],"维护worker","恢复workers产生的错误","提供Web-UI监督工作进程工具","与worker交流","Pregel系统中Master的作用不包括()",{"answer":61,"createTime":5,"id":62,"options":63,"question":68,"source":31,"type":32},[],219750779,[64,65,66,67],"Microsoft","Google","Tencent","Alibaba Group","MapReduce是由()开发的分布式编程模型",{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":31,"type":32},[],219750780,[73,74,75,76],"Map函数的输出键作为连接键","Map函数的输出键变化为连接键和表名的组合","Partition函数中Hashcode仅从组合键的连接键计算","Grouping函数仅根据连接键分组纪录","在repartition join的改进中,说法错误的是()",{"answer":79,"createTime":5,"id":80,"options":81,"question":86,"source":31,"type":32},[],219750781,[82,83,84,85],"个人","计算机","群体","软件","众包通过一系列的机制和方法来指导和协调()的行为,从而达到目的",{"answer":88,"createTime":5,"id":89,"options":90,"question":95,"source":31,"type":32},[],219750782,[91,92,93,94],"外存","数据库","寄存器","内存","构建KDB-树时,完成网格建立之后,计算每个网格中点的个数,并且存储在()中",{"answer":97,"createTime":5,"id":98,"options":99,"question":104,"source":31,"type":32},[],219750783,[100,101,102,103],"判断可计算否","判断能行可计算否","算法设计与分析","用计算机语言实现算法","大数据求解计算问题过程的第三步一般是()",{"answer":106,"createTime":5,"id":6,"options":107,"question":19,"source":31,"type":32},[],[8,9,10,11]]