[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fUqZDCCh5Ev62efuVO_hc2qrfQbG9Yy_kmp3xqeZAGOg":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2025-06-18 08:58:23",203535942,[8,9,10,11],"2013年","2014年","2016年","2015年",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},92,"5951bb6064e36091902bd2261790c51e","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0181eda6b29a0c3189950ff6af56f9da.png","大学计算机","exam_159920106","2024-2025学年模拟试卷","国务院在哪一年印发了《促进大数据发展行动纲要》",[21,33,42,51,60,69,78,87,90,99],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2025-06-18 08:58:22",203535928,[26,27,28,29],"算法以磁盘块读写次数衡量的时间复杂性为\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff26949c7001d744755a42803b235e1fe.png\">","算法以磁盘块读写次数衡量的时间复杂性为\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F02767dd18a7c30bb41d8b2e116a564ea.png\">","算法以磁盘块读写次数衡量的时间复杂性为\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3fee429914f1ad8360712290dfd62bc4.png\">","算法以磁盘块读写次数衡量的时间复杂性为\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F4775f47bdc4f6bf87e6ec93b642cefbd.png\">","外排序是需要使用硬盘等外部存储设备进行大数据集合排序的过程或算法,其中一种策略是"排序-归并",如下图所示.仔细理解该图所表达的基本思想,回答问题.\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcb23c9e3834345883f2de7c8813b9a68.png\">参见图示.如果:内存块数为\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F23a204dba05a8b626085ba007729575d.png\">,每块可装载\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6a9d83f190840345e8d8da5c7b172a01.png\">个元素,待排序元素集合所占用磁盘块数\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2c7b53a372fb94b5ca1025e06bc5511c.png\">,采用排序-归并算法进行升序排序,下列说法正确的是_____","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],203535930,[37,38,39,40],"00000000","11111111","无法确定","10000000","对于一个 8 位二进制数,其反码为 10000000,则其原码为( )",{"answer":43,"createTime":23,"id":44,"options":45,"question":50,"source":31,"type":32},[],203535932,[46,47,48,49],"U盘","硬盘","高速缓冲存储器","内存","下列存储设备中,读取速度最快的是( )",{"answer":52,"createTime":23,"id":53,"options":54,"question":59,"source":31,"type":32},[],203535934,[55,56,57,58],"汇编语言是机器语言的符号化表示","机器语言是汇编语言的高级形式","毫无关系","汇编语言是机器语言的高级形式","汇编语言与机器语言的关系是( )",{"answer":61,"createTime":23,"id":62,"options":63,"question":68,"source":31,"type":32},[],203535936,[64,65,66,67],"数据结构,数据通信,数据完整性约束","数据结构,数据操作,数据完整性约束","数据通信,数据操作,数据完整性约束","数据结构,数据通信,关系操作","关系数据模型通常由三部分组成,它们是( )",{"answer":70,"createTime":23,"id":71,"options":72,"question":77,"source":31,"type":32},[],203535938,[73,74,75,76],"系统软件和应用软件","主机和外部设备","输入设备和输出设备","硬件系统和软件系统","计算机系统由( )两大部分组成",{"answer":79,"createTime":23,"id":80,"options":81,"question":86,"source":31,"type":32},[],203535940,[82,83,84,85],"编译或解释","解释","汇编","编译","高级语言编写的程序需要经过( )才能在计算机上运行",{"answer":88,"createTime":5,"id":6,"options":89,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":91,"createTime":5,"id":92,"options":93,"question":98,"source":31,"type":32},[],203535944,[94,95,96,97],"1","2","4","3","待传输01串为"1001",若采用偶校验,需要增加几位校验位才能判断出哪一位传输错误",{"answer":100,"createTime":5,"id":101,"options":102,"question":107,"source":31,"type":32},[],203535946,[103,104,105,106],"键盘","扫描仪","磁盘驱动器","显示器","在计算机系统中,既可以作为输入设备又可以作为输出设备的是( )"]