[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fTHtIUFLNpqp_O1ldQ_8ri_mrUmjM_mYyqkXBaE8qIiI":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":24,"origin":117,"createTime":48},140365884,"v1","【全国统考真题】设与某资源相关联的信号量初值为3,当前值为1,若M表示该资源的可用个数,N表示等待资源的进程数,则M、N分别是( )",[8,9,10,11],"0、1","1、0","1、2","2、0",[],[14,27,38,49,59,69,73,83,93,107],{"id":15,"source":5,"question":16,"options":17,"answer":22,"related":23,"type":24,"origin":25,"createTime":26},140365874,"【全国统考真题】属于同一进程的两个线程Thread1和Thread2并发执行,共享初值为0的全局变量x.Thread1和Thread2实现对全局变量x加1的机器代码描述如下.在所有可能的指令执行序列中,使x的值为2的序列个数是( ).\u003Cimg src=\"https:\u002F\u002Fp.ananas.chaoxing.com\u002Fstar3\u002Forigin\u002F0bcc3d7dae6ae361dbc8cd1f733668ae.jpg\">",[18,19,20,21],"1","2","3","4",[],[],0,null,"2024-04-26T11:25:27+08:00",{"id":28,"source":5,"question":29,"options":30,"answer":35,"related":36,"type":24,"origin":25,"createTime":37},140365876,"【全国统考真题】进程P0和P1的共享变量定义及其初值为:boolean flag[2];int turn=0;flag[0]=FALSE;flag[1]=FALSE;若进程P0和P1访问临界资源的类C代码实现如下,则并发执行进程P0和P1时发生的情况是( ).\u003Cimg src=\"https:\u002F\u002Fp.ananas.chaoxing.com\u002Fstar3\u002Forigin\u002Fe91b149765ec51ced768f6777098c206.jpg\">",[31,32,33,34],"不能保证进程互斥地进入临界区,会出现\"饥饿\"现象","不能保证进程互斥地进入临界区,不会出现\"饥饿\"现象","能保证进程互斥地进入临界区,会出现\"饥饿\"现象","能保证进程互斥地进入临界区,不会出现\"饥饿\"现象",[],[],"2024-04-26T11:25:28+08:00",{"id":39,"source":5,"question":40,"options":41,"answer":46,"related":47,"type":24,"origin":25,"createTime":48},140365878,"【全国统考真题】进程P1和进程P2均包含并发执行的线程,部分伪代码描述如下,下列选项中,必须要互斥执行的操作是( ).\u003Cimg src=\"https:\u002F\u002Fp.ananas.chaoxing.com\u002Fstar3\u002Forigin\u002Ffe525c2940bba056e773eec94b7ea7f6.png\">",[42,43,44,45],"a=1与a=2","a=x与b=x","x+=1与x+=2","x+=1与x+=3",[],[],"2024-04-26T11:25:29+08:00",{"id":50,"source":5,"question":51,"options":52,"answer":57,"related":58,"type":24,"origin":25,"createTime":48},140365880,"【全国统考真题】在下列同步机制中,可以实现让权等待的是( )",[53,54,55,56],"Peterson方法","Swap指令","信号量机制","Test-and-Set指令",[],[],{"id":60,"source":5,"question":61,"options":62,"answer":67,"related":68,"type":24,"origin":25,"createTime":48},140365882,"【全国统考真题】下列准则中实现临界区互斥机制所必须遵循的是( ).Ⅰ.两个进程不能同时进入临界区;Ⅱ.允许进程访问空闲的临界资源;Ⅲ.进程等待进入临界区的时间是有限的;Ⅳ.不能进入临界区且处于执行状态的进程立即放弃CPU",[63,64,65,66],"Ⅰ、Ⅳ","Ⅱ、Ⅲ","Ⅰ、Ⅱ、Ⅲ","Ⅰ、Ⅲ、Ⅳ",[],[],{"id":4,"source":5,"question":6,"options":70,"answer":71,"related":72,"type":24,"origin":25,"createTime":48},[8,9,10,11],[],[],{"id":74,"source":5,"question":75,"options":76,"answer":81,"related":82,"type":24,"origin":25,"createTime":48},140365886,"【全国统考真题】下列关于管程的叙述中,错误的是( )",[77,78,79,80],"管程只能用于实现进程的互斥","管程是有进程语言支持的进程同步机制","任何时候只能有一个进程在管程中执行","管程中定义的变量只能被管程内的过程访问",[],[],{"id":84,"source":5,"question":85,"options":86,"answer":91,"related":92,"type":24,"origin":25,"createTime":48},140365887,"【全国统考真题】若x是管程内的条件变量,则当进程执行x.wait()时,所做的工作是( )",[87,88,89,90],"实现对变量x的互斥访问","唤醒一个在x上阻塞的进程","根据x的值判断该进程是否进入阻塞状态","阻塞该进程,并将其插入x的阻塞队列中",[],[],{"id":94,"source":5,"question":95,"options":96,"answer":105,"related":106,"type":24,"origin":25,"createTime":48},140365888,"【名校考研真题】两段程序分别如下,其中,R是寄存器,counter是共享变量且其初值为1.试问在这两段程序对应的进程并发执行完成后,counter的值不可能为( ).\u003Cimg src=\"https:\u002F\u002Fp.ananas.chaoxing.com\u002Fstar3\u002Forigin\u002F7407030910a86b19553707ba0a35e0f9.jpg\">",[97,18,19,98,99,100,101,102,103,104],"0","除0、1、2外的所有值","除0、1外的所有值","除0、2外的所有值","除1、2外的所有值","除0外的所有值","除1外的所有值","除2外的所有值",[],[],{"id":108,"source":5,"question":109,"options":110,"answer":115,"related":116,"type":24,"origin":25,"createTime":48},140365889,"【名校考研真题】关于临界区,正确的说法是( )",[111,112,113,114],"访问不同临界资源的两个进程不要求必须互斥地进入临界区","临界区是包含临界资源的一段数据区","临界区是一种用于进程同步的机制","临界区是访问临界资源的一个进程或线程",[],[],{"courseName":118,"courseImg":119,"workName":120,"workId":121,"count":122,"courseId":123},"操作系统(Operation System)","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F4afc3414880bdcf29550ac549b7ca1d6.jpg","","work_34659272",47,"3dff6cba18339cfa3de531ce6f1a96da"]