Dagong 1 1 operating system 1 went online in autumn.
multiple-choice
1. Among the following four operating systems, the time-sharing operating system is ().
Answer: d
2. Storage allocation solves the problem of address space division of multiple jobs. In order to realize static and dynamic memory allocation, address relocation is needed, that is, () is converted into an absolute address.
Answer: c
3. The goal pursued by real-time operating system is ().
Answer: c
4. In a computing process (transaction processing), the user requires the computer to complete a set of completed work or a relatively independent task that needs computer processing, which means ().
Answer: c
5. If the operating system is regarded as the manager of computer system resources, the following () does not belong to the resources managed by the operating system.
Answer: d
6. When the necessary resources are allocated and the processor is obtained, the process status is ().
Answer: b
7. The following description of the process, the error is ().
Answer: d
8. Among the following process state changes, () change is impossible.
Answer: c
9. () is not the main concern of the operating system.
Answer: d
10. () The operating system allows multiple terminals to connect to a host at the same time, and multiple users can use the computer interactively through their respective terminals at the same time.
Answer: c
Right or wrong
1. Batch processing system is a system to realize human-computer interaction.
A: A.
2. Even after the development of four generations of computers, at present, computers are still centered on arithmetic units.
A: A.
3. The user creates a PCB for each process and controls the execution of the process.
A: A.
4. Usually, the operating system runs in the pipeline state and can execute all machine instructions. The user program runs in the target state and can only execute unprivileged instructions.
Answer: b
5. The process can be written on paper or stored on storage media for a long time, and the program has a life cycle, which exists after creation and dies after revocation.
A: A.
6. In modern computers, the operating system is generally provided with some special instructions, which can only be executed in pipeline mode. These instructions are called privileged instructions.
Answer: b
7. Von Neumann structure computer takes memory as the center.
A: A.
8. This process can delete its own PCB table at any time.
A: A.
9. In most systems, user programs can sometimes execute privileged instructions in managed mode.
A: A.
10. All processes are processed through user application and approval.
A: A.
Dalian University of Technology
Dagong 1 1 autumn operating system online homework 2
multiple-choice
1.CPU scheduling can be divided into three types: long-term, medium-term and short-term, in which short-term scheduling refers to () scheduling.
A: A.
2. A job arrives at the system at 8: 00, and the estimated running time is 1 hour. If the job starts at 10: 00, its response rate is ().
Answer: c
3. For two concurrent processes, set the initial value of mutex as 1. If mutex =0, then ().
Answer: b
4. Critical segment refers to the segment () that accesses * * * shared variables in the concurrent process.
Answer: d
5. The cause of the system deadlock may be due to ().
Answer: c
6. In the operating system, when the job is in (), it has been sent to the memory and is under the management of the process.
Answer: c
7. If the initial value of the semaphore S of the Wait-Signal operation is 2 and the current value is-1, it means that there is a () waiting process.
Answer: b
8. The operation with the shortest running time is preferred. This job scheduling algorithm is ().
Answer: c
9. () is a special variable, which can only perform waiting operation and signal operation.
Answer: d
10. If there are five plotters in the system and multiple processes need to use two plotters, and it is stipulated that each process is only allowed to apply for one plotter at a time, then at most () processes are allowed to participate in the competition without deadlock.
Answer: d
Right or wrong
1. The key resources are mutually exclusive to realize * * * sharing.
Answer: b
2. Waiting for signal operation is a mechanism to associate semaphores with * * * shared resources. When s becomes -X, x represents the number of processes waiting to use resources.
Answer: b
3. There are multiple processes in the operating system at the same time, and these processes can enjoy the allowed system resources.
Answer: b
4. The multiprocessor system has the advantages of reliability and high parallelism.
Answer: b
5. The submitted job is occupied by the processor for execution.
A: A.
6. At least three of all the processes involved in the deadlock occupy resources.
A: A.
7. Waiting for the signal operation is a mechanism to correspond the semaphore with the shared resource. When S >: 0 means that no resources are available or the process is not allowed to enter the critical section again.
A: A.
8. Because the waiting signal operation cannot describe the basic problems such as synchronization and mutual exclusion, it is necessary to introduce other communication primitives or mechanisms, such as sending, receiving or monitoring.
A: A.
9. The busier the CPU in a computer system, the faster the system runs and the higher the efficiency.
A: A.
10. Multi-processor system can establish multi-processing and enhance the processing capacity of the system.
Answer: b
Dalian University of Technology
Dagong 1 1 autumn operating system online homework 3
multiple-choice
1. The scheduling algorithm that may make some I/O requests wait indefinitely is ().
Answer: b
2. Segmented page storage management absorbs the advantages of page management and segment management, and its implementation principle combines the basic ideas of page management and segment management, namely ().
Answer: b
3. The purpose of storage management is ().
Answer: c
4. In segmented page storage management, the kernel performs address translation for each process ().
A: A.
5. The advantages of () segment storage and page storage are complementary.
Answer: d
6. In the segmented page storage management system, the memory is divided into (), and the program is divided into several segments according to logical modules.
A: A.
7. Dynamic relocation technology depends on ().
Answer: b
8. The track on the disk is ().
A: A.
9. Segment management provides a () dimensional address structure.
Answer: b
10. In the storage allocation algorithm of variable partition, the free areas are sorted according to the block size, which is suitable for the algorithm () to make the unused fragments as small as possible.
Answer: c
Right or wrong
The 1. tree directory structure can solve the problem of file renaming.
Answer: b
2. When the first adaptive allocation algorithm is adopted in variable partition management, the free areas should be registered in the free area table in ascending order of addresses.
Answer: b
3. The relocation method of fixed partition storage management technology adopts static relocation method.
Answer: b
4. The expansion of virtual memory capacity is at the expense of CPU working time, I/O operation time and additional main memory overhead.
Answer: b
5. Relocatable partition management can allocate discontinuous memory units to jobs.
A: A.
6. In paged storage management, a process can occupy discontinuous memory space, while in segmented storage management, each segment of a process needs to occupy continuous memory space.
A: A.
7. The least recently used page replacement algorithm will not produce the abnormal phenomenon discovered by Belady and others.
Answer: b
8. Spooling technology can completely solve the process deadlock problem.
A: A.
9. There is a page table in the paged storage management system.
Answer: b
10. In virtual paged storage management, the definition of the least recently used page replacement algorithm is to eliminate the first page residing in memory.
A: A.
It's almost over. Answer the question quickly.