question type

question type	Question size × score
choose	10%
fill in the blank	2×5%=10%
	10%
answer question	2×10’
big question	2×15’

1. Choose

Chapter 1(10)

The management part of the operating system is responsible for scheduling processes.
A. memory
B. device
C. file
D.Processor
The following operating system_ must ensure that the system has a high throughput.
a.batch system
B. Time-sharing system
C. Network operating system
D. Distributed operating system
The basic types of operating systems are mainly.
A. Batch processing system, time-sharing system, and multitasking system
B. Single-user system, multi-user system, and batch processing system
C.Batch operating system, time-sharing operating system and real-time operating system
D. Real-time systems, time-sharing systems, and multi-user systems
An operating system ( ) that enables multiple users to use a computer interactively at the same time through a terminal connected to the computer.
A. Single-lane batch processing system
B. Multi-lane batch processing system
C.time sharing system
D. Real-time systems
Operating system is one.
A. Application software
B.system software
C. General software
D. Tool software
On a uniprocessor system, parallelism is possible.
I Processes and Processes
II Processors and Devices
III Processors and Channels
IV Devices and Devices
A. I, II, and III
B.II, III and IV
C. I, III and IV
D. I, II and IV
An operating system that enables multiple users to use a computer interactively at the same time through a terminal connected to the computer.
A. Single-lane batch processing system
B. Multi-lane batch processing system
C.time sharing system
D. Real-time systems
If the operating system is regarded as the manager of computer resources, the following do not belong to the resources managed by the operating system.
A. disk
B. memory
C. CPU
D.to interrupt
Instructions that can only be used by the operating system in the instruction set are called.
A. System commands
B. Device commands
C. Unprivileged commands
D.privileged instruction
A time-sharing operating system usually uses _ strategy to serve users.
A. Time slice weighted allocation
B. Short job priority
C.Time slice rotation
D. Reliability and flexibility

Chapter 2(19)

The _ in the following options will cause the user process to switch from user mode to kernel mode.
I. Integer division by zero
II. sin( ) function call
III. read system call
A. Only I, II
B.I, III
C. II, III
D. I, II and III
Among the following options, the event that can cause an external interrupt is _ .
A. Floating-point operation underflow
B. Divisor is 0
C.keyboard input
D. Fetching page faults
When the program is running, it monopolizes system resources, and only the program itself can change the state of system resources.
A. Reproducibility of program execution sequentially
B.Closure of sequential program execution
C. Concurrent programs lose closure
D. Concurrent programs lose reproducibility
A process needs to wait for data to be read from the disk during operation, and the status of the process at this time will be .
A. From ready to running
B. from running to ready
C.from running to waiting
D. From waiting to ready
The main purpose of introducing the concept of "process" in the operating system is.
A. Improve user programming environment
B.Describe the nature of a program's dynamic execution process
C. Make a one-to-one correspondence between the program and the calculation process
D. Improve the running speed of the program
Among the following options, events that cannot occur in user mode are.
A. System call
B. External interrupt
C.process switching
D. Page fault
Which of the following statements about processes and threads is correct.
a.Regardless of whether the system supports threads or not, a process is the basic unit of resource allocation
B. Thread is the basic unit of resource allocation, and process is the basic unit of scheduling
C. The switching between system-level threads and user-level threads requires the support of the kernel
D. Each thread in the same process has its own different address space
There are the following discussions about process switching, and the discussion is correct.
Ⅰ. Save the context of the above process according to the system stack.
Ⅱ. Save the scene of the above process according to the PCB.
Ⅲ. Restore the site of the following process according to the system stack.
Ⅳ. Restore the site of the following process according to the PCB.
A. I and III
B.I and IV
C. II and III
D. II and IV
The following statements about processes and threads are correct.
A. A thread is a subtask that can be executed independently in a process. A process can contain one or more threads, and a thread can belong to one or more processes.
b.Multi-threading technology has obvious advantages, such as fast speed, simple communication, and high parallelism of equipment.
C. Since threads are not used as resource allocation units, threads can be executed in parallel without constraints.
D. Threads are also called lightweight processes because threads are smaller than processes.
True about the threading narrative.
A. The switching between system-level threads and user-level threads requires the support of the kernel.
B. A thread is a resource allocation unit, and a process is a scheduling unit.
c.Regardless of whether there are threads in the system, a process is an independent unit that owns resources.
D. In the thread system, the process is still the basic unit of resource allocation and scheduling.
In the job scheduling algorithm, if all jobs arrive at the same time, the algorithm with the shortest average waiting time is
A. First come, first served
B. Priority number
C. Response ratio is the highest priority
D.Jobs that calculate time slots take precedence
____ is a special language provided by the operating system, which is interpreted and processed by the special mechanism of the operating system.
A. C language
B.JCL language
C. Ada language
D. Pascal language
The job scheduler picks the appropriate job to run from the job queue in the _ state.
A. Execute
B. Submit
C. Finish
D.reserve
Among the job scheduling algorithms, the scheduling algorithm is most conducive to improving resource utilization.
A. First come, first served
B. Priority number
C. Response ratio highest priority
D.balanced
The scheduling algorithm that considers both job waiting time and job execution time is.
A. First come first served
B. Priority number
C.Response takes precedence over highest
D. balance
One of the factors often considered in the job scheduling algorithm is to make the system have the highest throughput rate, so it should be.
A. Do not let the processor idle
B.Ability to handle as many jobs as possible
C. Satisfy all kinds of users
D. Don't overcomplicate the system
__ is the time interval from when a job is submitted to the system to when the job is completed.
a.Turnaround time
B. Response time
C. Waiting time
D. Execution time
There are four stages for end users to control the execution of jobs on the terminal. The initial stage is .
A. User registration
B.terminal connection
C. Job Control
D. User Logout

Chapter Three (23)

The purpose of introducing multiprogramming technology is to ( ).
a.Make full use of the CPU to increase the amount of calculations per unit time
B. Make full use of memory
C. It is beneficial to code sharing and reduce the amount of information exchange between primary and secondary storage
D. Improve the speed of each calculation problem
The correct one in the following statement is ( ).
A. An important concept of the operating system is the process, so the code executed by different processes must be different. B.
In order to avoid process deadlock, each process can only apply for resources one by one.
C. The operating system uses PCB to manage processes, and user processes can be accessed from Read out information related to its own operating status from the PCB
D.Process synchronization is a logical mutual restriction relationship between certain processes
An interrupt may cause several process state changes, so after the interrupt is processed, () determines which process can occupy the processor.
a.process scheduling
B. Paging
C. Disk scheduling
D. Job scheduling
In the following process change state, () change is impossible.
A. Running -> Ready
B. Running -> Waiting
C.wait -> run
D. Wait -> Ready
In the operating system, a process is a one-time () of a program with an independent running function on a certain data set.
A. Waiting for the process
B.working process
C. Separate process
D. Linked process
Two processes cooperate to complete a task. In concurrent execution, a process waits for a message from its partner, or establishes a certain condition before proceeding. This restrictive cooperative relationship is called process ().
a.Synchronize
B. execute
C. mutex
D. schedule
In a multiprogramming environment, the operating system allocates resources with () as the basic unit.
A. program
B. instruction
C. job
D.process
The following critical section concept discussion is correct ().
A. The critical section refers to the program code used to realize process mutual exclusion in the process.
B. The critical section refers to the program code used to realize process synchronization in the process.
C. The critical section refers to the program code used to realize process communication in the process. The program code of
D.A critical section is a section of program code used to access critical resources in a process
In order to carry out process coordination, there should be a certain connection between the processes. This connection is usually carried out by exchanging data in the process space, which is called ().
A. Process mutual exclusion
B. Process synchronization
C.process communication
D. Process constraints
There are three processes sharing the same program segment, and at most two processes are allowed to enter the program segment at a time. If the p and v operations are used as the synchronization mechanism, the value range of the semaphore s is ().
a.2，1，0，-1
B. 3，2，1，0
C. 2，1，-1，-2
D. 1，0，-1，-2
For a system with two concurrent processes, set the mutual exclusion semaphore as mutex, if mutex=0, then ().
A. Indicates that no process enters the critical section associated with the mutex
B.Indicates that a process has entered the critical section associated with the mutex
C. Indicates that one process enters the critical section related to mutex, and another process is waiting to enter
D. Indicates that two processes enter the critical section related to mutex
We call a resource that only allows one process to access within a period of time to be called a critical resource. Therefore, we can draw the following statement, and the correct statement is ().
A. Resource sharing cannot be realized for critical resources.
B. As long as the programs can be executed concurrently, these concurrently executed programs can simultaneously access and share critical resources.
C. After matching the corresponding device control block for critical resources, they can be shared.
d.For critical resources, mutually exclusive access should be adopted to achieve sharing.
Two processes cooperate to complete a task. In concurrent execution, a process waits for a message from its partner, or establishes a certain condition before proceeding. This restrictive cooperative relationship is called process ().
a.Synchronize
B. execute
C. mutex
D. schedule
There are 3 concurrent processes in a system, all of which need 4 resources of the same kind. How can the minimum number of resources in this system without deadlock be ().
A.9
B.10
C. 11
D. 12
In the case of (), the system is deadlocked.
A. There has been a major failure of the computer system
B. There are multiple blocked processes
C.Several processes endlessly wait for each other to release existing resources due to competition for resources
D. The number of resources is much smaller than the number of processes or the number of resources requested by processes at the same time is much greater than the total number of resources
In addition to processes competing for resources, deadlocks may occur due to insufficient resources, and improper () may also cause deadlocks.
A. Process priority
B. Linear allocation of resources
C.Progress sequence
D. Assign queue priority
The banker's algorithm is a ( ) algorithm.
A. to remove the deadlock
B.avoid deadlock
C. Prevent deadlock
D. Detect deadlock
() The priority is determined when the process is created, and will not change during the entire process after it is determined.
a.static
B. Short job
C. Dynamic
D. High response ratio
There are 8 printers in a computer system, and K processes compete to use them, and each process needs at most 3 printers. The minimum value of deadlock K in this system is ( ).
A. 3
B. 2
C.4
D. 5
In addition to using the resource deprivation method to remove the deadlock, you can also use the () method to remove the deadlock.
A. Modify the semaphore
B. Refuse to allocate new resources
C.undo process
D. Perform parallel operations
The sequential allocation strategy of resources can break the () condition.
A. Mutual exclusion
B. Request and hold
C. No deprivation
D.loop wait
In order to carry out process coordination, there should be a certain connection between the processes. This connection is usually carried out by exchanging data in the process space, which is called ().
A. Process mutual exclusion
B. Process synchronization
C.process communication
D. Process constraints
Among the following deadlock-solving methods, the one that belongs to the deadlock prevention strategy is ().
A. The banker's algorithm
B.ORDERAL ALLOCATION OF RESOURCES
C. Deadlock detection method
D. Resource allocation graph simplification method

Chapter 4(32)

The allocation of memory is shown in the figure. If you want to apply for a 40K-byte memory space, if you use the best fit algorithm, the first address of the partition obtained is ().
A. 100K
B. 190K
C.330K
D.410K
The main protection measure of partition allocation memory management method is ().
A. Program code protection
B.boundary address protection
C. Data protection
D. Stack protection
In the time-sharing system, the part that is not needed or temporarily not needed by the process can be moved to the external memory, and the memory space can be transferred to other required data, which is called ().
A. Overlay technology
B.switching technology
C. Virtual technology
D. Physical expansion
The free area of the first adaptation algorithm is ( ).
a.concatenated in ascending address order
B. The start pointer table points to the largest free area
C. Connect together in increasing order of size
D. Search starts from the largest free area
In variable partition storage management, after a job is completed, its main memory space must be reclaimed. This space may be merged with adjacent free areas. Modify the free area table so that the initial address of the free area changes but the number of free areas remains unchanged. () .
A. There are upper and lower adjacent free areas
B. There are upper adjacent free areas but no lower adjacent free areas
C.No upper adjacent free area but lower adjacent free area
D. No upper adjacent free area and no lower adjacent free area
There are 3 target modules A, B, and C whose starting addresses are all 1, and the lengths are L, M, and N in sequence. After these 3 modules are connected together by static connection in the order of A, B, and C, module C The starting address of becomes ().
A. L+M+N
B. L+M
C. L+M-1
D.L+M+1
The dynamic relocation technique relies on ().
A. Relocate the loader
B.relocation register
C. Address structure
D. Object program
The purpose of storage management is ( ).
A. Convenient for users
B. Improve memory utilization
C.User Convenience and Improved Memory Utilization
D. Increase the actual capacity of memory
The result of address relocation is get().
A. Source program
B. Compiler program
C. Object program
D.execute program
( ) means that the memory space required by the job is allocated once when the target module is loaded into the memory, and it is not allowed to allocate memory during the running process.
a.static allocation
B. Dynamic allocation
C. Direct allocation
D. Fragment splicing and then allocation
In fixed partition allocation, the size of each partition is ( ).
A. Varies with job length
B. Same
C.can be different but pre-fixed
D. Can be different but fixed according to job length
Partition management requires a main memory unit allocated() for each job.
a.consecutive addresses
B. Several addresses are discontinuous
C. Several addresses are continuous
D. Several addresses are discontinuous
() Storage management takes into account the logical clarity of the segment type and the convenience of the page type in storage management.
A. Segmentation
B. Paging
C. Variable partitioning
D. Paragraph style
In paging storage management, address translation is done by ( ).
A. Hardware
B. Address translator
C. User program
D. Loader
In order to achieve multi-program concurrency, the operating system can use various methods for memory management, among which the least expensive is ( ).
A. Partition management
B. Paging management
C. Segment management
D. Segment page management
The main features of paging storage management are ().
A. Request to handle page faults
B. Request to expand main memory capacity
C. Does not require jobs to be loaded into contiguous areas of main memory
D. It is not required that all jobs be loaded into main memory at the same time
In a segmented memory management system, the address length is 32 bits, and the segment number occupies 8 bits, so the maximum segment length is ( ).
A. 2 to the 8th power byte
B. 2 to the 32nd power byte
C. 2 to the 24th power byte
D. 2 to the 40th power byte
A system with a memory capacity of 12GB and a page size of 6KB uses an inverted page table, and a page table entry requires 4B. When there are 100 processes in the system, the memory capacity occupied by the inverted page table is ( ) A.
12MB
B. 8MB
C. 6MB
D. 18MB
Segment page storage management combines the strengths of page management and segment management, and its implementation principle combines the basic ideas of page and segment management, namely ( ).
A. Use segmentation to allocate and manage physical storage space, and use paging to manage user address space.
B. Use the segmentation method to allocate and manage the user address space, and use the paging method to manage the physical storage space.
C. Use the segmentation method to allocate and manage the main memory space, and use the paging method to manage the auxiliary memory space.
D. Use the segmentation method to allocate and manage the auxiliary memory space, and use the paging method to manage the main memory space.
The page replacement algorithm ( ) is not based on the locality theory of program execution.
A. FIFO
B. LRU
C. OPT
D. CLOCK
Given a virtual paging storage system, the memory address has 32 bits, 48-bit virtual address is used, the page size is 4KB, and the page table entry size is 8B, then the page offset is ( ) bits.
A.10
B.14
C. 12
D. 16
In the request paging system, if the page number in the logical address exceeds the page table length in the page table register, ( ) will be caused.
A. Input and output interrupt
B. Clock interrupt
C. Out-of-bounds interruption
D. Page fault interrupt
The virtual storage management policy can ( ).
A. Expand physical memory capacity
B. Expand physical external storage capacity
C. Expand logical memory capacity
D. Expand logical storage capacity
Among the following storage management technologies, the technology that supports virtual storage is ( ).
A. Dynamic partition method
B. Relocatable partition method
C. Request paging technology
D. Overlay technology
System jitter refers to ( ).
A. When using the machine, the screen flickers.
B. The phenomenon of frequent call-in and call-out formed by the frame that has just been called out and immediately called in again.
C. The system disk is not clean and the system is unstable.
D. Occasionally insufficient memory is caused due to improper memory allocation.
In virtual memory management, the address transformation mechanism transforms the logical address into a physical address, and the stage of forming the logical address is ( ).
A. compile
b. to connect
C. load
D. edit
The basis of the virtual storage management system is the ( ) theory of the program.
A. Locality
B. Global
C. Dynamic
D. Virtual
In request paging storage management, if the FIFO page elimination algorithm is used, when the number of allocated pages increases, the number of page fault interrupts ( ).
A. Decrease
B. Increase
C. No effect
D. May increase or decrease
During the page fault interrupt processing, the operating system may perform the following operations ( ). Ⅰ. Modify page table Ⅱ. Disk I/O Ⅲ. Allocate page frame
A. Only Ⅰ, Ⅱ
B. Only Ⅱ
C. Only Ⅲ
D. I, II and III
Among the following page replacement algorithms, the one that produces the so-called Belady anomaly is ( ).
A. Optimal Page Replacement Algorithm (OPT)
B. First-in-first-out page replacement algorithm (FIFO)
C. Most recently unused algorithm (LRU)
D. Clock page replacement algorithm (Clock)
The actual capacity of the virtual memory is limited by ( ).
A. Size of physical main memory
B. Disk capacity
C. Computer address structure
D. Absolute address of data storage
Among the following statements about request paging storage management, the incorrect one is ( ).
A. The size of a program space page is always the same as the size of a physical block of computer memory.
B. The address translation mechanism must be supported by corresponding hardware
C. The user's address space is divided into page number and page offset, which the user cannot feel
D. The user program must be fully loaded

Chapter 5(15)

The device management program manages the device with the help of some data structures, and the following _ does not belong to the data structure of device management.
A. DCT
B. JCB
C. COCT
D. CHCT
Which of the following equipment is not a system equipment is ().
A. Mouse
B. Keyboard
C. Scanner
D. Disk
The time it takes for the magnetic head to move from the cylinder to the designated track driven by the moving arm is __.
A. Lookup time
B. Latency time
C. Delivery time
D. Seek time
The speed at which the CPU outputs data is much higher than the printing speed of the printer. In order to solve this contradiction, __ can be used.
A. Parallel technology
B. Channel technology
C. Cushioning technology
D. Virtual storage technology
The time it takes for the magnetic head to move to the specified cylinder driven by the movable arm is __ .
A. Find time
B. Delay time
C. Delivery time
D. Optimization time
For disks, the information transfer unit for input and output operations is _ .
A. Bytes
B. Words
C. Files
D. block
Assume that the magnetic head is currently on the 105th track and is moving towards the direction of increasing track numbers. There is a track access request sequence of 35, 45, 12, 68, 110, 180, 170, 195, which is obtained by using the SCAN scheduling (elevator scheduling) algorithm The track access sequence is _.
A. 110，170，180，195，68，45，35，12
B. 110，68，45，35，12，170，180，195
C. 110，170，180，195，12，35，45，68
D. 12，35，45，68，110，170，180，195
In a general large-scale computer system, the control of the host computer to the peripheral equipment can be realized through three levels: the channel, the equipment controller, and the equipment. The correct one in the following description is _ .
A. The controller can control the channel, and the device works under the control of the channel
B. The channel controls the controller, and the equipment works under the control of the controller
C. The channel and the controller control the device respectively
D. The controller controls the channel and the device work
A file occupies 10 disk blocks, read the file into the main memory buffer and send it to the user area for analysis. The size of the buffer is the same as that of the disk block. It takes 100 μs for a disk block to be read into the buffer, 50 μs for the buffer data to be sent to the user area, and 50 μs for the CPU to analyze a piece of data. Under the single-buffer and double-buffer structures, the time to read and analyze the file is ____ respectively.
A. 1500μs, 1000μs
B. 1550μs、1100μs
C. 1550μs、1550μs
D. 2000μs、2000μs
If the data exchange between the I/O device and the storage device is not completed through the CPU, this data exchange method is ___.
A. Interrupt mode
B. Unconditional access mode
C. DMA mode
D. Program query method
In device management, the introduction of virtual devices is to make full use of devices and improve system efficiency, using _ to simulate the work of low-speed devices.
A. Spooling technology, using tape devices
B. Spooling technology, using disk devices
C. Offline batch processing system
D. Arm-moving scheduling and spinning scheduling technology, using disk devices
The buffer pool in the buffer technique is in _.
A. External storage
b. memory
C. ROM
D. Register
The time required for a given sector to rotate under the head is __ .
A. Find time
B. Latency
C. Delivery time
D. Optimization time
The time it takes for the head to read and write to complete the transfer of information is ____.
A. Lookup time
B. Latency time
C. Transmission time
D. Seek time
The system utilizes SPOOLING technology to realize __.
A. Swap means
B. Virtual Appliance
C. Tape concept
D. Virtual storage
The channel, also known as the I/O processor, is used to realize the information transmission between ___.
A. Main memory and peripherals
B. CPU and peripherals
C. Main memory and external memory
D. CPU and external memory

Chapter Six (15)

Files on tape are generally only _.
A. Sequential access
B. Random access
C. Key access
D. Byte access
In the paging storage management system, a bit diagram is used to represent the status of storing free blocks, assuming that the word length is 32 bits, each bit (numbered 0-31) corresponds to a storage block, and the value can be 0 or 1. When the value is 1, it means that the corresponding block is occupied, and when the value is 0, it means that the corresponding block is free. It is known that the font size of a certain bit is 5, and the bit number is 14, assuming that the font size also starts from 0. The corresponding memory block number is __. (Assume memory blocks are numbered from 0)
A. 70
B. 105
C. 174
D. 224
The following documents are all physical documents are ____.
A. Streaming file, concatenation file
B. Index file, recording file
C. Streaming file, recording file
D. Sequential files, index files
In the UNIX operating system, ___ is used when managing the free blocks of disk storage.
A. Bitmap
B. Free block group chaining method
C. FAT table
D. Free block multi-level directory method
In the file system, a reasonable place to store file access control information is __.
A. File Control Block
B. File allocation table
C. User password table
D. System registry
In a multi-level directory structure, when accessing a file, the _ of the file must be pointed out
A. Parent directory
B. Current directory
C. Path name
D. Root directory
The logical organization of files divides files into record files and ___ files.
A. Index file
B. Streaming files
C. Character files
D. Read and write files
In the disk file storage management system, a bit map is used to represent the storage status of free blocks, assuming that the word length is 32 bits, each bit (numbered 0-31) corresponds to a storage block, and the value can be 0 or 1. When the value is 1, it means that the corresponding block is occupied, and when the value is 0, it means that the corresponding block is free. If the allocatable memory area is divided into 1024 blocks, the bitmap requires ___ words to represent.
A.15
B.16
C.31
D. 32
The current directory is /usr/meng, and the absolute path name of its subordinate file prog/file.c is __.
A. /usr/meng/file.c
B. /usr/file.c
C. /prog/file.c
D. /usr/meng/prog/file.c
To prevent damage caused by system failure, the file system can use _.
A. Create replicas and scheduled dumps
B. Define usage permissions for each file
C. Set passwords for files
D. Translate file information into ciphertext
The file system refers to ____.
A. A collection of files
B. A directory of files
C. A set of software for file management
D. The totality of documents, software to manage them, and data structures.
Files for random access can only be organized into ( ) on disk.
A. Sequential files
B. Index file
C. Consecutive files
D. Linked files
Among the following file physical structures, the one suitable for random access and easy for file expansion is __.
A. Continuous structure
B. Chain structure and disk block lengthening
C. Chain structure and disk block length
D. Index structure
Files on disk are read and written in units of _.
A. block
B. record
C. cylinder
D. track
From the user's point of view, the main purpose of introducing the file system is _ .
A. Implement virtual storage
B. Save system files
C. Save user and system files
D. Realize access to files by name

2. Fill in the blanks

The five states of the process:create, ready, run, block, end
Two ways of process communication:shared memory, message passing
Three correspondences between user threads and kernel threads:One-to-one, many-to-one, many-to-many
Four conditions for a deadlock to occur:
① Mutual exclusion
② Circular wait
③ Inalienable
④ Request and hold

【OS】【Final Multiple Choice Questions】【2023 Spring】【For reference only】

Article directory

question type

1. Choose

Chapter 1(10)

Chapter 2(19)

Chapter Three (23)

Chapter 4(32)

Chapter 5(15)

Chapter Six (15)

2. Fill in the blanks

3. Short answer questions

1. Signal amount

2. Scheduling algorithm

3. Page replacement

4. Mapping from virtual address to physical address

Reference

Guess you like