[{"data":1,"prerenderedAt":1484},["ShallowReactive",2],{"note:cs\u002Fos\u002Ftestbank\u002Fchap3":3,"site-search-catalogue":1483},{"id":4,"title":5,"body":6,"description":1469,"extension":1475,"meta":1476,"navigation":1478,"path":1479,"seo":1480,"stem":1481,"__hash__":1482},"notes\u002Fsource\u002Fcs\u002Fos\u002Ftestbank\u002Fchap3.md","Chap. 3",{"type":7,"value":8,"toc":1468},"minimark",[9,14,19,27,33,42,48,64,70,75,81,85,97,103,108,114,118,130,136,141,148,152,164,170,175,181,185,197,203,208,214,218,230,236,241,247,251,263,269,274,280,284,296,302,307,313,317,329,335,340,346,350,366,372,377,383,387,399,405,410,416,420,436,442,447,453,457,469,475,480,486,490,502,508,513,519,523,535,538,542,547,552,559,563,579,584,589,596,600,612,617,622,629,633,645,650,655,662,666,678,683,688,695,699,738,743,748,754,758,789,794,799,806,810,822,827,832,839,843,855,860,865,872,876,888,893,907,913,917,929,934,939,946,950,962,967,972,978,982,994,999,1004,1010,1014,1026,1031,1036,1042,1046,1068,1073,1078,1085,1089,1101,1103,1107,1112,1117,1124,1129,1134,1139,1146,1151,1156,1161,1168,1173,1178,1183,1190,1199,1204,1209,1216,1221,1226,1231,1238,1243,1248,1253,1260,1265,1270,1275,1282,1287,1292,1297,1304,1309,1314,1319,1326,1331,1336,1341,1348,1353,1358,1363,1370,1375,1380,1385,1392,1397,1402,1407,1414,1419,1427,1431,1437,1442,1448,1453,1459],[10,11,13],"h1",{"id":12},"chapter-3-process-description-and-control","Chapter 3 - Process Description and Control",[15,16,18],"h2",{"id":17},"true-false-questions-判断题","True \u002F False Questions (判断题)",[20,21,22,26],"p",{},[23,24,25],"strong",{},"1. 题目",": The principal function of the processor is to execute machine instructions residing in main memory.",[20,28,29,32],{},[23,30,31],{},"翻译",": 处理器的主要功能是执行驻留在主存中的机器指令。",[20,34,35,38,39],{},[23,36,37],{},"答案",": ",[23,40,41],{},"True (正确)",[20,43,44,47],{},[23,45,46],{},"解析",":",[49,50,51,58],"ul",{},[52,53,54,57],"li",{},[23,55,56],{},"知识点",": 处理器的基本功能。",[52,59,60,63],{},[23,61,62],{},"详解",": 计算机系统的核心目标是执行程序，而程序是由一系列机器指令构成的。处理器（CPU）的基本工作周期就是从主存（Main Memory）中不断地获取（Fetch）指令并执行（Execute）它们。",[20,65,66,69],{},[23,67,68],{},"2. 题目",": A process trace is a listing of the sequence of instructions that execute for that process.",[20,71,72,74],{},[23,73,31],{},": 进程轨迹（Process trace）是该进程执行的指令序列的列表。",[20,76,77,38,79],{},[23,78,37],{},[23,80,41],{},[20,82,83,47],{},[23,84,46],{},[49,86,87,92],{},[52,88,89,91],{},[23,90,56],{},": 进程轨迹（Process Trace）的定义。",[52,93,94,96],{},[23,95,62],{},": 在操作系统中，为了描述和理解单个进程的行为，我们通常使用“轨迹（Trace）”这一概念。它精确地记录了该进程在处理器上运行时的机器指令序列。",[20,98,99,102],{},[23,100,101],{},"3. 题目",": The principal responsibility of the operating system is to control the execution of processes.",[20,104,105,107],{},[23,106,31],{},": 操作系统的主要职责是控制进程的执行。",[20,109,110,38,112],{},[23,111,37],{},[23,113,41],{},[20,115,116,47],{},[23,117,46],{},[49,119,120,125],{},[52,121,122,124],{},[23,123,56],{},": 操作系统的职责。",[52,126,127,129],{},[23,128,62],{},": 操作系统作为资源管理器，其最核心的任务之一就是管理和调度多个进程的执行，确保它们公平、高效且互不干扰地使用处理器和其他系统资源。",[20,131,132,135],{},[23,133,134],{},"4. 题目",": When one process spawns another, the spawning process is referred to as the child process and the spawned process is referred to as the parent process.",[20,137,138,140],{},[23,139,31],{},": 当一个进程派生（spawn）另一个进程时，派生进程被称为子进程，被派生的进程被称为父进程。",[20,142,143,38,145],{},[23,144,37],{},[23,146,147],{},"False (错误)",[20,149,150,47],{},[23,151,46],{},[49,153,154,159],{},[52,155,156,158],{},[23,157,56],{},": 进程的创建（Process Spawning）。",[52,160,161,163],{},[23,162,62],{},": 概念颠倒了。发起创建动作（spawning）的原进程是“父进程（Parent process）”，而被创建出来的新进程是“子进程（Child process）”。",[20,165,166,169],{},[23,167,168],{},"5. 题目",": Round-Robin processing refers to a method of thread prioritization for scheduling.",[20,171,172,174],{},[23,173,31],{},": 轮转（Round-Robin）处理指的是一种用于调度的线程优先级排序方法。",[20,176,177,38,179],{},[23,178,37],{},[23,180,147],{},[20,182,183,47],{},[23,184,46],{},[49,186,187,192],{},[52,188,189,191],{},[23,190,56],{},": 轮转调度算法（Round-Robin Scheduling）。",[52,193,194,196],{},[23,195,62],{},": 轮转（Round-Robin）是一种基于时间片（Time Slicing）的公平调度算法，它不依赖于静态或动态的“优先级（prioritization）”。在这种机制下，就绪队列中的每个进程（或线程）被轮流分配一个固定大小的时间片来执行，时间片用完即被剥夺执行权。",[20,198,199,202],{},[23,200,201],{},"6. 题目",": The primary difference between the Two-State Process Model and the Five-State Process Model is that the latter splits the Running state into two new states: Ready and Blocked.",[20,204,205,207],{},[23,206,31],{},": 两态进程模型和五态进程模型之间的主要区别在于，后者将“运行（Running）”状态拆分为两个新状态：就绪（Ready）和阻塞（Blocked）。",[20,209,210,38,212],{},[23,211,37],{},[23,213,147],{},[20,215,216,47],{},[23,217,46],{},[49,219,220,225],{},[52,221,222,224],{},[23,223,56],{},": 进程状态模型。",[52,226,227,229],{},[23,228,62],{},": 描述错误。两态模型包含“运行（Running）”和“非运行（Not Running）”。五态模型实际上是将“非运行（Not Running）”状态进行了细分，拆分成了“就绪（Ready）”和“阻塞\u002F等待（Blocked\u002FWaiting）”，而不是拆分“运行”状态。",[20,231,232,235],{},[23,233,234],{},"7. 题目",": One solution to the problem of limited main memory space is swapping, which involves moving all or part of a process from main memory to secondary memory.",[20,237,238,240],{},[23,239,31],{},": 解决主存空间有限问题的一种方法是交换（swapping），它涉及将进程的全部或部分从主存移动到辅助存储器。",[20,242,243,38,245],{},[23,244,37],{},[23,246,41],{},[20,248,249,47],{},[23,250,46],{},[49,252,253,258],{},[52,254,255,257],{},[23,256,56],{},": 内存交换（Swapping）与挂起状态（Suspend）。",[52,259,260,262],{},[23,261,62],{},": 当主存中所有的进程都处于阻塞状态，且没有足够的空闲内存来加载新的就绪进程时，操作系统会将一部分被阻塞的进程“交换（Swap）”到磁盘（辅助存储器）上，以腾出物理内存，这一过程是解决内存短缺的经典技术。",[20,264,265,268],{},[23,266,267],{},"8. 题目",": In order to define the control structures (e.g., tables) that the O\u002FS needs to manage processes and resources, it must have access to configuration data during initialization.",[20,270,271,273],{},[23,272,31],{},": 为了定义操作系统管理进程和资源所需的控制结构（例如，表），它必须在初始化期间能够访问配置数据。",[20,275,276,38,278],{},[23,277,37],{},[23,279,41],{},[20,281,282,47],{},[23,283,46],{},[49,285,286,291],{},[52,287,288,290],{},[23,289,56],{},": 操作系统控制结构的建立。",[52,292,293,295],{},[23,294,62],{},": 操作系统在启动和初始化（Initialization）阶段，需要读取系统的硬件配置信息（如内存容量、设备类型和数量等），才能准确地在内存中分配和建立起内存表、I\u002FO表、文件表和进程表等控制结构。",[20,297,298,301],{},[23,299,300],{},"9. 题目",": The Process Image refers to the binary form of the program code.",[20,303,304,306],{},[23,305,31],{},": 进程映像（Process Image）指的是程序代码的二进制形式。",[20,308,309,38,311],{},[23,310,37],{},[23,312,147],{},[20,314,315,47],{},[23,316,46],{},[49,318,319,324],{},[52,320,321,323],{},[23,322,56],{},": 进程映像的组成。",[52,325,326,328],{},[23,327,62],{},": 进程映像不仅仅包含程序代码的二进制形式（User Program）。根据教科书定义，它是一个包含了四个要素的完整实体：用户程序（User Program）、用户数据（User Data）、系统栈（System Stack）以及进程控制块（Process Control Block, PCB）。",[20,330,331,334],{},[23,332,333],{},"10. 题目",": The portion of the Process Control Block that consists of the contents of the processor registers is called the Process Control Information.",[20,336,337,339],{},[23,338,31],{},": 进程控制块中包含处理器寄存器内容的部分称为进程控制信息（Process Control Information）。",[20,341,342,38,344],{},[23,343,37],{},[23,345,147],{},[20,347,348,47],{},[23,349,46],{},[49,351,352,357],{},[52,353,354,356],{},[23,355,56],{},": 进程控制块（PCB）的结构。",[52,358,359,361,362,365],{},[23,360,62],{},": 教科书中将 PCB 分为三大类：进程标识（Process Identification）、处理器状态信息（Processor State Information）和进程控制信息（Process Control Information）。其中，保存处理器寄存器（如程序计数器、PSW等）内容的区域被称为",[23,363,364],{},"处理器状态信息（Processor State Information）","。",[20,367,368,371],{},[23,369,370],{},"11. 题目",": The less-privileged processor execution mode is often referred to as kernel mode.",[20,373,374,376],{},[23,375,31],{},": 权限较低的处理器执行模式通常被称为内核模式（kernel mode）。",[20,378,379,38,381],{},[23,380,37],{},[23,382,147],{},[20,384,385,47],{},[23,386,46],{},[49,388,389,394],{},[52,390,391,393],{},[23,392,56],{},": 处理器执行模式。",[52,395,396,398],{},[23,397,62],{},": 权限较低的模式是“用户模式（User mode）”。“内核模式（Kernel mode）”（或称系统模式、控制模式）是权限最高的模式，允许执行特权指令和访问受保护的内存区域。",[20,400,401,404],{},[23,402,403],{},"12. 题目",": The primary process table contains one entry per process, unless the process spawns a new process, in which case the table contains multiple entries for the parent process.",[20,406,407,409],{},[23,408,31],{},": 主进程表为每个进程包含一个条目，除非该进程派生了一个新进程，在这种情况下，表中将为父进程包含多个条目。",[20,411,412,38,414],{},[23,413,37],{},[23,415,147],{},[20,417,418,47],{},[23,419,46],{},[49,421,422,427],{},[52,423,424,426],{},[23,425,56],{},": 进程表（Process Table）。",[52,428,429,431,432,435],{},[23,430,62],{},": 无论进程是否派生了新进程，",[23,433,434],{},"每个进程在进程表中只占据一个条目（Entry）","。当父进程派生子进程时，操作系统会为子进程在进程表中分配一个全新的、独立的条目，而不是给父进程增加条目。",[20,437,438,441],{},[23,439,440],{},"13. 题目",": One kind of system interrupt, the trap, relates to an error or exception condition in the currently running process.",[20,443,444,446],{},[23,445,31],{},": 一种系统中断——陷阱（trap），与当前正在运行的进程中的错误或异常情况有关。",[20,448,449,38,451],{},[23,450,37],{},[23,452,41],{},[20,454,455,47],{},[23,456,46],{},[49,458,459,464],{},[52,460,461,463],{},[23,462,56],{},": 陷阱（Trap）的定义。",[52,465,466,468],{},[23,467,62],{},": 中断分为异步中断（通常由外部 I\u002FO 硬件引发）和同步中断。同步中断通常被称为“陷阱（Trap）”，它是由正在执行的指令引发的异常情况，如除以零、非法内存访问等。",[20,470,471,474],{},[23,472,473],{},"14. 题目",": In the Nonprocess Kernel approach to defining the relationship between the O\u002FS and the User Process, the O\u002FS code is executed as a separate entity that operates in privileged mode.",[20,476,477,479],{},[23,478,31],{},": 在定义操作系统与用户进程之间关系的“无进程内核（Nonprocess Kernel）”方法中，操作系统代码作为在特权模式下运行的独立实体来执行。",[20,481,482,38,484],{},[23,483,37],{},[23,485,41],{},[20,487,488,47],{},[23,489,46],{},[49,491,492,497],{},[52,493,494,496],{},[23,495,56],{},": 操作系统的执行模型。",[52,498,499,501],{},[23,500,62],{},": 传统系统（如早期系统）采用 Nonprocess Kernel 模型。在这种模型下，操作系统的内核独立于任何用户进程之外运行。当发生中断或系统调用时，当前进程的状态被保存，控制权转移到内核，内核作为一个享有特权的独立代码实体进行处理。",[20,503,504,507],{},[23,505,506],{},"15. 题目",": A typical UNIX system employs two Running states, to indicate whether the process is executing in user mode or kernel mode.",[20,509,510,512],{},[23,511,31],{},": 典型的 UNIX 系统使用两种运行状态，以指示进程是在用户模式还是内核模式下执行。",[20,514,515,38,517],{},[23,516,37],{},[23,518,41],{},[20,520,521,47],{},[23,522,46],{},[49,524,525,530],{},[52,526,527,529],{},[23,528,56],{},": UNIX 进程状态模型。",[52,531,532,534],{},[23,533,62],{},": UNIX SVR4 进程状态模型在“Running”状态上进行了细化，分为“User Running（用户态运行）”和“Kernel Running（内核态运行）”。进程发生系统调用或被中断时，会从 User Running 切换到 Kernel Running。",[536,537],"hr",{},[15,539,541],{"id":540},"multiple-choice-questions-单选题","Multiple Choice Questions (单选题)",[20,543,544,546],{},[23,545,25],{},": The behavior of a processor can be characterized by examining:\na. A single process trace\nb. Multiple process traces\nc. The interleaving of the process traces\nd. All of the above",[20,548,549,551],{},[23,550,31],{},": 处理器的行为可以通过检查以下哪项来表征：\na. 单个进程的轨迹\nb. 多个进程的轨迹\nc. 进程轨迹的交织（interleaving）\nd. 以上所有",[20,553,554,38,556],{},[23,555,37],{},[23,557,558],{},"c. The interleaving of the process traces",[20,560,561,47],{},[23,562,46],{},[49,564,565,570],{},[52,566,567,569],{},[23,568,56],{},": 处理器的行为。",[52,571,572,574,575,578],{},[23,573,62],{},": 单个进程的轨迹只能描述该进程本身的行为。处理器是在多个进程之间不断切换的，因此要描述",[23,576,577],{},"处理器","在宏观上的整体行为，必须观察所有活跃进程的轨迹是如何在时间轴上交织（interleaving）执行的。",[20,580,581,583],{},[23,582,68],{},": The behavior of an individual process can be characterized by examining:\na. A single process trace\nb. Multiple process traces\nc. The interleaving of the process traces\nd. All of the above",[20,585,586,588],{},[23,587,31],{},": 单个进程的行为可以通过检查以下哪项来表征：\na. 单个进程的轨迹\nb. 多个进程的轨迹\nc. 进程轨迹的交织\nd. 以上所有",[20,590,591,38,593],{},[23,592,37],{},[23,594,595],{},"a. A single process trace",[20,597,598,47],{},[23,599,46],{},[49,601,602,607],{},[52,603,604,606],{},[23,605,56],{},": 进程的行为。",[52,608,609,611],{},[23,610,62],{},": 进程的“轨迹（Trace）”是针对特定进程的指令执行序列，只需研究这一个特定的 Trace 就可以完全了解该进程个体的行为。",[20,613,614,616],{},[23,615,101],{},": The basic Two-State Process Model defines two possible states for a process in relationship to the processor:\na. Running and Executing\nb. Running and Not Running\nc. Executing and Waiting\nd. None of the above",[20,618,619,621],{},[23,620,31],{},": 基本的两态进程模型定义了进程相对于处理器的两种可能状态：\na. 运行（Running）和执行（Executing）\nb. 运行（Running）和非运行（Not Running）\nc. 执行（Executing）和等待（Waiting）\nd. 以上都不是",[20,623,624,38,626],{},[23,625,37],{},[23,627,628],{},"b. Running and Not Running",[20,630,631,47],{},[23,632,46],{},[49,634,635,640],{},[52,636,637,639],{},[23,638,56],{},": 两态进程模型（Two-State Process Model）。",[52,641,642,644],{},[23,643,62],{},": 最简单的操作系统进程模型只区分进程当前是否占用 CPU，即“Running（正在运行）”和“Not Running（未在运行，位于队列中排队）”。",[20,646,647,649],{},[23,648,134],{},": There are a number of conditions that can lead to process termination, including:\na. Normal completion\nb. Bounds violation\nc. Parent termination\nd. All of the above",[20,651,652,654],{},[23,653,31],{},": 有许多条件可能导致进程终止，包括：\na. 正常完成\nb. 越界违规（内存越界）\nc. 父进程终止\nd. 以上所有",[20,656,657,38,659],{},[23,658,37],{},[23,660,661],{},"d. All of the above",[20,663,664,47],{},[23,665,46],{},[49,667,668,673],{},[52,669,670,672],{},[23,671,56],{},": 进程终止的原因。",[52,674,675,677],{},[23,676,62],{},": 进程可能因为多种原因退出，包括：自身执行完毕（Normal completion）、出现致命错误如访问了不属于自己的内存（Bounds violation），或者因为它的父进程被终止，操作系统连带终止了所有子进程（Parent termination）。",[20,679,680,682],{},[23,681,168],{},": In the Five-State Process Model, the following represents a valid state transition:\na. Running -> Blocked\nb. New -> Running\nc. New -> Blocked\nd. All of the above",[20,684,685,687],{},[23,686,31],{},": 在五态进程模型中，以下哪项代表有效的状态转换：\na. 运行 -> 阻塞\nb. 新建 -> 运行\nc. 新建 -> 阻塞\nd. 以上所有",[20,689,690,38,692],{},[23,691,37],{},[23,693,694],{},"a. Running -> Blocked",[20,696,697,47],{},[23,698,46],{},[49,700,701,706],{},[52,702,703,705],{},[23,704,56],{},": 五态模型中的状态转换。",[52,707,708,47,710],{},[23,709,62],{},[49,711,712,719,732],{},[52,713,714,718],{},[715,716,717],"code",{},"Running -> Blocked"," 是有效的：正在运行的进程发起 I\u002FO 请求或等待某事件时会发生此转换。",[52,720,721,724,725,728,729,365],{},[715,722,723],{},"New -> Running"," 无效：新建进程必须先进入 ",[715,726,727],{},"Ready"," 队列，由调度器选中后才能 ",[715,730,731],{},"Running",[52,733,734,737],{},[715,735,736],{},"New -> Blocked"," 无效：新建进程还未执行，不可能发起等待事件。",[20,739,740,742],{},[23,741,201],{},": In a Process Model that implements two suspend states, a valid state transition is represented by:\na. Ready\u002FSuspend -> Ready\nb. Running -> Ready\u002FSuspend\nc. Ready -> Ready\u002FSuspend\nd. All of the above",[20,744,745,747],{},[23,746,31],{},": 在实现了两个挂起状态的进程模型中，有效的状态转换由以下哪项表示：\na. 就绪\u002F挂起 -> 就绪\nb. 运行 -> 就绪\u002F挂起\nc. 就绪 -> 就绪\u002F挂起\nd. 以上所有",[20,749,750,38,752],{},[23,751,37],{},[23,753,661],{},[20,755,756,47],{},[23,757,46],{},[49,759,760,765],{},[52,761,762,764],{},[23,763,56],{},": 七态模型（引入挂起状态）。",[52,766,767,47,769],{},[23,768,62],{},[49,770,771,777,783],{},[52,772,773,776],{},[715,774,775],{},"Ready\u002FSuspend -> Ready","：当主存有足够空间，操作系统将外存中挂起的就绪进程换入主存。",[52,778,779,782],{},[715,780,781],{},"Running -> Ready\u002FSuspend","：一个正在运行的进程可能因为优先级较低或为了腾出内存而被直接抢占并挂起到外存。",[52,784,785,788],{},[715,786,787],{},"Ready -> Ready\u002FSuspend","：主存空间紧张时，操作系统会将内存中等待执行的就绪进程挂起到外存。",[20,790,791,793],{},[23,792,234],{},": The scheduling strategy where each process in the queue is given a certain amount of time, in turn, to execute and then returned to the queue, unless blocked is referred to as:\na. Prioritization\nb. Round-Robin\nc. LIFO\nd. All of the above",[20,795,796,798],{},[23,797,31],{},": 队列中的每个进程依次获得一定的时间量来执行，除非被阻塞，否则随后返回队列，这种调度策略被称为：\na. 优先级排序\nb. 轮转（Round-Robin）\nc. 后进先出（LIFO）\nd. 以上所有",[20,800,801,38,803],{},[23,802,37],{},[23,804,805],{},"b. Round-Robin",[20,807,808,47],{},[23,809,46],{},[49,811,812,817],{},[52,813,814,816],{},[23,815,56],{},": 轮转调度算法。",[52,818,819,821],{},[23,820,62],{},": 这正是轮转算法（Round-Robin）的经典定义。操作系统为每个进程分配一个时间片（Time Slice\u002FQuantum），时间耗尽发生时钟中断，进程被剥夺执行权并送回就绪队列的末尾排队。",[20,823,824,826],{},[23,825,267],{},": A Memory Table is an O\u002FS control structure that is used by the O\u002FS to:\na. Manage I\u002FO devices\nb. Manage processes\nc. Provide information about system files\nd. None of the above",[20,828,829,831],{},[23,830,31],{},": 内存表（Memory Table）是操作系统的一种控制结构，被操作系统用来：\na. 管理 I\u002FO 设备\nb. 管理进程\nc. 提供有关系统文件的信息\nd. 以上都不是",[20,833,834,38,836],{},[23,835,37],{},[23,837,838],{},"d. None of the above",[20,840,841,47],{},[23,842,46],{},[49,844,845,850],{},[52,846,847,849],{},[23,848,56],{},": 操作系统的控制表。",[52,851,852,854],{},[23,853,62],{},": 内存表（Memory Table）专门用于跟踪主存（Main Memory）和外存（Secondary Memory）的分配情况、保护属性及虚拟内存映射，而不是用来管理 I\u002FO（I\u002FO表）、管理进程（进程表）或提供文件信息（文件表）。因此前三个选项均不正确。",[20,856,857,859],{},[23,858,300],{},": The Process Image element that contains the collection of attributes needed by the O\u002FS to control a particular process is called the:\na. User Data\nb. System Stack\nc. Process Control Block\nd. None of the above",[20,861,862,864],{},[23,863,31],{},": 进程映像中包含操作系统控制特定进程所需的一组属性的元素被称为：\na. 用户数据\nb. 系统栈\nc. 进程控制块\nd. 以上都不是",[20,866,867,38,869],{},[23,868,37],{},[23,870,871],{},"c. Process Control Block",[20,873,874,47],{},[23,875,46],{},[49,877,878,883],{},[52,879,880,882],{},[23,881,56],{},": 进程控制块（PCB）的作用。",[52,884,885,887],{},[23,886,62],{},": 操作系统为了管理和调度进程，需要一种数据结构来记录进程的所有关键属性（如状态、PC、寄存器、优先级、内存指针等），这个数据结构就是 PCB。",[20,889,890,892],{},[23,891,333],{},": The Process Image element that contains the modifiable part of the user space is called the:\na. User Program\nb. System Stack\nc. Process Control Block\nd. None of the above",[20,894,895,897,898,902,903,906],{},[23,896,31],{},": 进程映像中包含用户空间可修改部分的元素被称为：\na. 用户数据（User Program 在此题选项为 a，但题意指向 User Data。Wait! 选项 a 是 User Program。但前面提到的四大元素是 User Data, User Program, System Stack, PCB）\n",[899,900,901],"em",{},"注意原文选项","：a. User Program \u002F b. System Stack \u002F c. Process Control Block \u002F d. None of the above。如果题目选项中没有 \"User Data\"，那么可修改的部分应该是 User Data，答案就是 d。\n",[23,904,905],{},"仔细审题","：\n题目：\"The Process Image element that contains the modifiable part of the user space is called the:\"\na. User Program （不可修改的代码段）\nb. System Stack （属于内核控制，用于系统调用上下文）\nc. Process Control Block （属于操作系统内核管理）\nd. None of the above",[20,908,909,38,911],{},[23,910,37],{},[23,912,838],{},[20,914,915,47],{},[23,916,46],{},[49,918,919,924],{},[52,920,921,923],{},[23,922,56],{},": 进程映像的组成部分。",[52,925,926,928],{},[23,927,62],{},": 进程映像由四部分组成：User Program（代码，通常是只读的）、User Data（用户数据，是可修改的用户空间部分）、System Stack 和 PCB。因为选项中没有提供“User Data”，故选 d。",[20,930,931,933],{},[23,932,370],{},": The processor execution mode that user programs typically execute in is referred to as:\na. User mode\nb. System mode\nc. Kernel mode\nd. None of the above",[20,935,936,938],{},[23,937,31],{},": 用户程序通常在其中执行的处理器执行模式被称为：\na. 用户模式\nb. 系统模式\nc. 内核模式\nd. 以上都不是",[20,940,941,38,943],{},[23,942,37],{},[23,944,945],{},"a. User mode",[20,947,948,47],{},[23,949,46],{},[49,951,952,957],{},[52,953,954,956],{},[23,955,56],{},": 处理器特权级。",[52,958,959,961],{},[23,960,62],{},": 为了安全性和保护操作系统不受恶意或错误程序的破坏，普通的用户级应用程序都运行在受限的“用户模式（User mode）”下。",[20,963,964,966],{},[23,965,403],{},": One step in the procedure for creating a new process involves:\na. Initializing the process control block\nb. Allocating space for the process\nc. Assigning a unique identifier\nd. All of the above",[20,968,969,971],{},[23,970,31],{},": 创建新进程过程中的一个步骤涉及：\na. 初始化进程控制块\nb. 为进程分配空间\nc. 分配一个唯一的标识符\nd. 以上所有",[20,973,974,38,976],{},[23,975,37],{},[23,977,661],{},[20,979,980,47],{},[23,981,46],{},[49,983,984,989],{},[52,985,986,988],{},[23,987,56],{},": 进程的创建步骤。",[52,990,991,993],{},[23,992,62],{},": 当操作系统创建新进程时，必须：为新进程分配一个唯一的进程ID (c)；为进程的代码、数据、栈和PCB分配内存空间 (b)；最后初始化该进程的PCB结构 (a) 等。因此全选。",[20,995,996,998],{},[23,997,440],{},": A process switch may occur when the system encounters an interrupt condition, such as that generated by a:\na. Memory fault\nb. Supervisor call\nc. Trap\nd. All of the above",[20,1000,1001,1003],{},[23,1002,31],{},": 当系统遇到中断条件时可能会发生进程切换，例如由以下情况生成的中断：\na. 内存错误（Memory fault）\nb. 访管调用（Supervisor call，即系统调用）\nc. 陷阱（Trap）\nd. 以上所有",[20,1005,1006,38,1008],{},[23,1007,37],{},[23,1009,661],{},[20,1011,1012,47],{},[23,1013,46],{},[49,1015,1016,1021],{},[52,1017,1018,1020],{},[23,1019,56],{},": 引起进程切换的事件。",[52,1022,1023,1025],{},[23,1024,62],{},": 能够中断当前进程执行并将控制权交还给操作系统的机制包括：普通中断（时钟或I\u002FO）、陷阱\u002F异常（Trap，例如除零错误或缺页引发的 Memory fault），以及进程主动发起的访管调用（Supervisor call）。这些事件发生后，操作系统内核可能会根据情况决定进行进程切换。",[20,1027,1028,1030],{},[23,1029,473],{},": In the Process Based O\u002FS:\na. Major kernel functions are organized as separate functions\nb. The User Process Image includes a kernel stack\nc. O\u002FS code and data are contained in the shared address space\nd. None of the above",[20,1032,1033,1035],{},[23,1034,31],{},": 在基于进程的操作系统（Process Based O\u002FS）中：\na. 主要内核功能被组织为独立的函数\nb. 用户进程映像包括一个内核栈\nc. 操作系统代码和数据包含在共享地址空间中\nd. 以上都不是",[20,1037,1038,38,1040],{},[23,1039,37],{},[23,1041,838],{},[20,1043,1044,47],{},[23,1045,46],{},[49,1047,1048,1053],{},[52,1049,1050,1052],{},[23,1051,56],{},": 操作系统架构模型（Process-based OS）。",[52,1054,1055,47,1057],{},[23,1056,62],{},[49,1058,1059,1062,1065],{},[52,1060,1061],{},"在教科书中，“基于进程的操作系统（Process-based OS）”是将主要的内核功能组织为“独立的系统进程（separate system processes）”，而不是选项 a 所说的“独立的函数（functions）”。",[52,1063,1064],{},"选项 b 和 c 描述的是另一种称为“Execution Within User Processes（在用户进程内执行）”的模型特征。",[52,1066,1067],{},"由于选项 a 具有迷惑性的“functions”而不是“processes”，严格来说应选 d。",[20,1069,1070,1072],{},[23,1071,506],{},": In a typical UNIX system, the element of the process image that contains the processor status information is the:\na. System-level context\nb. Register context\nc. User-level context\nd. All of the above",[20,1074,1075,1077],{},[23,1076,31],{},": 在典型的 UNIX 系统中，包含处理器状态信息的进程映像元素是：\na. 系统级上下文\nb. 寄存器上下文\nc. 用户级上下文\nd. 以上所有",[20,1079,1080,38,1082],{},[23,1081,37],{},[23,1083,1084],{},"b. Register context",[20,1086,1087,47],{},[23,1088,46],{},[49,1090,1091,1096],{},[52,1092,1093,1095],{},[23,1094,56],{},": UNIX System V 的进程控制块结构。",[52,1097,1098,1100],{},[23,1099,62],{},": 典型的 UNIX 系统将进程映像拆分为不同层次的上下文。包含 PC、程序状态字 PSW 和各通用寄存器值的部分，被称为“寄存器上下文（Register context）”。",[536,1102],{},[15,1104,1106],{"id":1105},"fill-in-the-blank-questions-填空题","Fill-In-The-Blank Questions (填空题)",[20,1108,1109,1111],{},[23,1110,25],{},": The listing of a sequence of instructions that execute for a particular process is called a __________.",[20,1113,1114,1116],{},[23,1115,31],{},": 为特定进程执行的一系列指令序列的列表被称为__________。",[20,1118,1119,38,1121],{},[23,1120,37],{},[23,1122,1123],{},"trace (或 process trace)",[20,1125,1126,1128],{},[23,1127,46],{},": 在操作系统中，我们用轨迹（trace）这个术语来宏观跟踪或刻画一个进程随着时间推移的指令执行序列。",[20,1130,1131,1133],{},[23,1132,68],{},": The behavior of a processor can be characterized by examining the interleaving of the process __________ for the processes currently running on the system.",[20,1135,1136,1138],{},[23,1137,31],{},": 处理器的行为可以通过检查系统上当前正在运行的进程的进程__________的交织情况来表征。",[20,1140,1141,38,1143],{},[23,1142,37],{},[23,1144,1145],{},"traces",[20,1147,1148,1150],{},[23,1149,46],{},": 同上，处理器的宏观行为是通过多个进程的指令轨迹（traces）是如何被调度和交替（interleaving）执行来刻画的。",[20,1152,1153,1155],{},[23,1154,101],{},": The portion of the operating system that selects the next process to run is called the __________.",[20,1157,1158,1160],{},[23,1159,31],{},": 操作系统中负责选择下一个要运行的进程的部分被称为__________。",[20,1162,1163,38,1165],{},[23,1164,37],{},[23,1166,1167],{},"dispatcher (或 scheduler)",[20,1169,1170,1172],{},[23,1171,46],{},": 调度器（scheduler）决定谁可以运行，而分派器（dispatcher）是实际执行状态切换并把CPU控制权交给该进程的内核组件。教科书通常将短期调度和实际上下文切换统称为 dispatcher 或 short-term scheduler。",[20,1174,1175,1177],{},[23,1176,134],{},": When the O\u002FS creates a process at the explicit request of an existing process, the action is referred to as __________.",[20,1179,1180,1182],{},[23,1181,31],{},": 当操作系统在现有进程的显式请求下创建一个进程时，该操作被称为__________。",[20,1184,1185,38,1187],{},[23,1186,37],{},[23,1188,1189],{},"process spawning",[20,1191,1192,1194,1195,1198],{},[23,1193,46],{},": 这是派生（spawning）的标准定义。当一个父进程调用 OS 服务（如 ",[715,1196,1197],{},"fork","）来生成子进程时，我们称之为 process spawning。",[20,1200,1201,1203],{},[23,1202,168],{},": A process that cannot execute until some event occurs is said to be in the __________ state.",[20,1205,1206,1208],{},[23,1207,31],{},": 一个直到某个事件发生后才能执行的进程，据说处于__________状态。",[20,1210,1211,38,1213],{},[23,1212,37],{},[23,1214,1215],{},"Blocked (或 Waiting)",[20,1217,1218,1220],{},[23,1219,46],{},": 当进程因为等待 I\u002FO 完成或等待某种资源而无法继续执行时，操作系统会将其移入阻塞（Blocked）队列中，不再给它分配 CPU。",[20,1222,1223,1225],{},[23,1224,201],{},": In a system that implements two suspend states, a process that has been swapped out of main memory and into secondary memory and that is also awaiting an event is in the __________ state.",[20,1227,1228,1230],{},[23,1229,31],{},": 在实现了两个挂起状态的系统中，一个被换出主存并进入辅助存储器，且同时在等待一个事件的进程处于__________状态。",[20,1232,1233,38,1235],{},[23,1234,37],{},[23,1236,1237],{},"Blocked\u002FSuspend",[20,1239,1240,1242],{},[23,1241,46],{},": 在七态模型中，一个原本在内存中且被阻塞（Blocked）的进程，如果为了腾出内存空间被操作系统转移到了磁盘外存中，该进程就进入了阻塞\u002F挂起（Blocked\u002FSuspend）状态。",[20,1244,1245,1247],{},[23,1246,234],{},": The scheduling strategy where each process in the queue is given a certain amount of time, in turn, to execute and then returned to the queue, unless blocked is referred to as __________.",[20,1249,1250,1252],{},[23,1251,31],{},": 队列中的每个进程依次获得一定的时间量来执行，除非被阻塞，否则随后返回队列，这种调度策略被称为__________。",[20,1254,1255,38,1257],{},[23,1256,37],{},[23,1258,1259],{},"Round-Robin",[20,1261,1262,1264],{},[23,1263,46],{},": 这是轮转算法的经典定义，每个进程获得的固定时间量称为时间片（Time Quantum）。",[20,1266,1267,1269],{},[23,1268,267],{},": The O\u002FS control structure that the O\u002FS uses to manage system processes is called the __________.",[20,1271,1272,1274],{},[23,1273,31],{},": 操作系统用来管理系统进程的控制结构被称为__________。",[20,1276,1277,38,1279],{},[23,1278,37],{},[23,1280,1281],{},"Process Table",[20,1283,1284,1286],{},[23,1285,46],{},": 操作系统使用进程表（Process Table）来维护系统中所有进程的目录。每个活跃进程在表中有一个条目，包含指向该进程映像（Process Image）的指针或其实际信息。",[20,1288,1289,1291],{},[23,1290,300],{},": The User Data, User Program, System Stack and Process Control Block elements collectively make up what is referred to as the __________.",[20,1293,1294,1296],{},[23,1295,31],{},": 用户数据、用户程序、系统栈和进程控制块元素共同构成了所谓的__________。",[20,1298,1299,38,1301],{},[23,1300,37],{},[23,1302,1303],{},"Process Image",[20,1305,1306,1308],{},[23,1307,46],{},": 这四部分要素组合在一起构成了进程在物理内存或虚拟内存中存在的一个完整实体，操作系统理论中称之为“进程映像（Process Image）”。",[20,1310,1311,1313],{},[23,1312,333],{},": The Process Identification, Processor State Information and the Process Control Information are the general categories that collectively make up what is referred to as the __________.",[20,1315,1316,1318],{},[23,1317,31],{},": 进程标识、处理器状态信息和进程控制信息这几个通用类别，共同构成了所谓的__________。",[20,1320,1321,38,1323],{},[23,1322,37],{},[23,1324,1325],{},"Process Control Block (PCB)",[20,1327,1328,1330],{},[23,1329,46],{},": 这是 PCB 的标准内部逻辑结构，PCB 是操作系统中最重要的控制数据结构。",[20,1332,1333,1335],{},[23,1334,370],{},": The processor typically maintains the current operating mode (i.e., user or kernel) in the __________.",[20,1337,1338,1340],{},[23,1339,31],{},": 处理器通常在__________中维护当前的运行模式（即用户模式或内核模式）。",[20,1342,1343,38,1345],{},[23,1344,37],{},[23,1346,1347],{},"Program Status Word (PSW)",[20,1349,1350,1352],{},[23,1351,46],{},": 程序状态字（PSW）是一个硬件寄存器，其中包含条件码、中断使能位以及指示当前 CPU 执行处于核心态还是用户态的特权级别位（Mode bit）。",[20,1354,1355,1357],{},[23,1356,403],{},": The first step in creating a new process is to assign a unique __________ to the new process.",[20,1359,1360,1362],{},[23,1361,31],{},": 创建新进程的第一步是为新进程分配一个唯一的__________。",[20,1364,1365,38,1367],{},[23,1366,37],{},[23,1368,1369],{},"process identifier (或 process ID)",[20,1371,1372,1374],{},[23,1373,46],{},": 为了能在进程表中添加新记录，操作系统必须首先生成一个当前未被使用的唯一的数字标识符（PID）。",[20,1376,1377,1379],{},[23,1378,440],{},": The execution of a user process may be interrupted by a __________, which might be generated by the process requesting an I\u002FO operation.",[20,1381,1382,1384],{},[23,1383,31],{},": 用户进程的执行可能会被一个__________打断，这可能是由该进程请求 I\u002FO 操作而生成的。",[20,1386,1387,38,1389],{},[23,1388,37],{},[23,1390,1391],{},"Supervisor call (或 system call)",[20,1393,1394,1396],{},[23,1395,46],{},": 当用户进程需要操作系统服务（如请求 I\u002FO 操作）时，它必须通过触发软中断来发起一个访管调用（Supervisor Call \u002F System Call），这将引起 CPU 特权级切换并陷入操作系统。",[20,1398,1399,1401],{},[23,1400,473],{},": In the __________ model for illustrating the relationship between the O\u002FS and User Processes, the O\u002FS has its own region of memory to use and its own system stack for controlling procedure calls and returns.",[20,1403,1404,1406],{},[23,1405,31],{},": 在阐明操作系统与用户进程之间关系的__________模型中，操作系统拥有自己使用的内存区域，并拥有自己的系统栈用于控制过程调用和返回。",[20,1408,1409,38,1411],{},[23,1410,37],{},[23,1412,1413],{},"Nonprocess Kernel",[20,1415,1416,1418],{},[23,1417,46],{},": “无进程内核（Nonprocess Kernel）”模型是一种传统的内核设计方式，其中内核在其专用的内存空间中作为一个实体执行，不运行在任何用户进程的上下文中。",[20,1420,1421,1423,1424],{},[23,1422,506],{},": In the __________ model for illustrating the relationship between the O\u002FS and User Processes, the O\u002FS has its own region of memory to use and its own system stack for controlling procedure calls and returns.\n",[899,1425,1426],{},"(注：第 15 题在源文档中与第 14 题完全相同，故答案与解析一致)",[20,1428,1429,1406],{},[23,1430,31],{},[20,1432,1433,38,1435],{},[23,1434,37],{},[23,1436,1413],{},[20,1438,1439,1441],{},[23,1440,46],{},": 题目与前一题重复。考查的依然是 Nonprocess Kernel 结构模型。",[20,1443,1444,1447],{},[23,1445,1446],{},"16. 题目",": Process creation in a typical UNIX system is made by means of a kernel system call named __________.",[20,1449,1450,1452],{},[23,1451,31],{},": 在典型的 UNIX 系统中，进程创建是通过名为__________的内核系统调用来实现的。",[20,1454,1455,38,1457],{},[23,1456,37],{},[23,1458,1197],{},[20,1460,1461,1463,1464,1467],{},[23,1462,46],{},": 在 UNIX 系操作系统中，",[715,1465,1466],{},"fork()"," 是唯一的创建新进程的方式。它会精确克隆调用者（父进程）的内存空间，生成一个近乎完全相同的子进程映像。",{"title":1469,"searchDepth":1470,"depth":1470,"links":1471},"",2,[1472,1473,1474],{"id":17,"depth":1470,"text":18},{"id":540,"depth":1470,"text":541},{"id":1105,"depth":1470,"text":1106},"md",{"order":1477},3,true,"\u002Fsource\u002Fcs\u002Fos\u002Ftestbank\u002Fchap3",{"title":5,"description":1469},"source\u002Fcs\u002Fos\u002Ftestbank\u002Fchap3","uQLUjQPY79zSLKRj38jFKY-3AeI5OnuiXEjnP6Z7qPQ",null,1784032892807]