操作系统全英文期末考试题

2021年1月25日发(作者：ssta)
一．选择题
(
20
分，每题

1
分
)
1.
Generally speaking, which one is not the major concern for a operating
system in the following four options( D ) the computer the system resources
and apply the interface between user's program and computer hardware
system
programming language complier
2.
The main disadvantage of batch system is ( C )
A. CPU utilization is low
B. Can not concurrent
C. Lack of interaction
D. Low degree of automation
3.
A process transforms from waiting state to ready state is caused by the ( B )
A. Interrupt event
B. Process scheduling
C. Create a process for a program
D. Waiting for some events
4.
The concurrent process is refers to ( C )
A. The process can be run in parallel
B. The process can be run in order
C. The process can be run in the same time
D. The process can not be interrupted
5.
In multi-process system, in order to ensure the integrity of
public variables, the processes should be mutually exclusive access to critical
areas. The so-called critical area is ( D )
A. A buffer
B. A date area
C. Synchronization mechanism
D. A program
6.
The orderly use of resources allocation strategy can destroy the condition
( D ) to avoid deadlock.
A. Mutual exclusive
B. Hold and wait
C. No preemption
D. Circular wait
7.
User's applications use the system resources to complete its
operation by the support and services of ( C )
A. clicking the mouse
B. Keyboard command
C. System call
D. Graphical user interface
8.
There are four jobs arrived at the same time and the execution time of each
job is 2h. Now they run on one processor at single channel,then the average
turnaround time is ( B )
9.
the job scheduling algorithms, ( B ) is related to the job's estimated running
time.
A. FCFS scheduling algorithm
B. Short-job-first scheduling algorithm
C. High response ratio algorithm
D. Balanced scheduling
memory management, the purpose of using the overlay and swapping is
( C )
A. Sharing main memory
B. Expanding main memory physically
C. Saving main memory space
D. Improving CPU utilization
the page-replacement algorithm,which one can cause the Belady
phenomenon ( A )
A. FIFO
B. LRU
C. CLOCKING
D. OPT
12.
The following description of the system in safe state,which one is
correct( B )
A. It must cause deadlock if the system is in insecure state
B. It may cause deadlock if the system is in insecure state
C. It may cause deadlock if the system is in secure state
D. All are wrong
13.
Generally, when we talk about
( C )
A. Prevent hardware memory from damaging
B. Prevent program from losing in memory
C. Prevent the cross-border call between programs
D. Prevent the program from being peeped
14.
The actual capacity of virtual memory is equal to ( B )
A. The capacity of external memory(disk)
B. The sum of the capacity of external memory and main memory
C. The space that the CPU logical address gives
D. The smaller one between the option B and C
15.
Physical file's organization is determined by ( D )
A. Applications
B. Main memory capacity
C. External memory capacity
D. Operating system
16.
A computer system is configured with two plotters and three printers,in
order to properly drive these devices,system should provide ( C ) device driver
program.
17.
When there are fewer number of channels in system ,it may cause

effective way( A )
A. improving the speed of CPU
B. Using the virtual device technology
C. Adding some hardware buffer on the devices
D. Increasing the path between devices and channels
18.
When I/O devices and main memory are exchanging data, it can be
achieved without CPU's frequently intervention,this way of exchanging data is
called ( C )
A. Polling
B. Interrupts
C. Direct memory access
D. None of them
19.
The following description of device management, which one is not
correct( B )
A. All external devices are managed by the system in uniform
B. Channel is a software of controlling input and output
C. The I/O interrupt events from the I/O channel are managedby device
management
D. One of the responsibility of the operating system is to use the hardware
effectively
20.
The operating system used ( A ), it realized a mechanismthat we can use
more space to save more time.
A. SPOOLING
B. Virtual storage
C.
Cha nnel
D.
Overlay
二
.< br>填空题
(
20
分，每空
1
分
)
〔
.Software maytrigger an interrupt
by executing a special operation
called a system call .(P7)
there is only one general-purpose CPU,then the system is a
sin gle-processor system.(p12)
3.
A process can be thought of as a program in executio n. (p79)
4.
As a process executes,it cha nges process may be in one of the following
states:new,running,waiting,ready or terminated .(p83)
5.
L on g-term(job) scheduli ng is the select ion of processes that will
beallowed to contend for the Short-term(CPU) scheduling is the
selectio n of one process from the ready queue. (p116)
6.
The process executing
in the operating
system may be either
in depe ndent
processes or cooperat ing processes.
Cooperati ng
processes require an in terprocess
com muni cati on mecha nism to
com muni cate with each ,com muni cati on is achieved through two schemes:
share memory and message passing. (p116)
moder n operat ing systems, resource allocati on unit is process, processor
scheduli ng unit is thread .(p127)
modern operating systems provide
kernel support for threads;among
these are Win dows,as well as Solaris and Linux .(p146)
scheduli ng is the basis of multiprogrammed
operati ng
systems.(p153)
FCFS algorithm is non preemptive;the RR algorithm is preemptive.
,a wait ing process is n ever aga in able to cha nge state,because the
resources it has requested are held by other waiting situation is called
deadlock . (p245)
main purpose of a computer system is to execute programs,together with the
data they access,must be in main memory(at least partially) during
execution.(P274)
13.
The various
memory-management algorithms
differ in may
comparing different
memory- management5trategies,we
use the follow
con siderati on s:Hardware
support,Performa nce,Fragme ntatio n,Relocati on,
Swapp in g,Shari ng and protecti on . (p310)
14.
A process is thrashing if it is spending more time paging than executi ng.
15. Virtual memory is a technique that enables us to map a large
logical address space onto a smaller physical memory.(p365)
16.
Whe n we solve the major problems of page replaceme nt and frame
allocati on ,the proper desig n of a pag ing system requires that we
con sider page size,l/O,locki ng,process
creati on ‘program

structure^ nd other issues.(p366)