Note: All answers of candidates must be answered on the answer sheet. Only one of the four options listed in each item meets the requirements of the topic. There are 10 sub-questions in this topic, with 2 points for each sub-question, totaling 20 points.

1. Computer system can be divided into four components:Hardware, ,Users Application programs

A. CPU

B. Operating system

C. Process

D. File

Ans:

2. Dual-mode of OSkernel mode and

A. User mode B. Process mode C. Scheduling mode D. Swap mode

Ans:

3. Operating System Structure:Simple structure, ,More complex and Layered

A. Frame B. Up and down structure C. Job D. Micro-kernel

Ans:

4. Maintains scheduling queues of processes: Job queue, and Device queue

A. Block queue B. Process queue C. Ready queue D. Memory queue

Ans:

5. Solution to Critical-Section Problem: Mutual Exclusion, ,Bounded Waiting

A. Preemptive B. Atomic C. Progress D. Non-interrupt

Ans:

6. CPU scheduling decisions may take place when a process:Switches from running to waiting state;Switches from running to ready state;Switches from waiting to ready;

A. Start B. Terminate C. Interrupt D. Running

Ans:

7. Deadlock can arise if four conditions hold simultaneously:Mutual exclusion,Hold and wait, No preemption,

A. One process at a time B. A resource can be released C. a process holding at least one resource D. Circular wait

Ans:

8. In dynamic Storage-Allocation problem, how to satisfy a request of size n froma list of free holes, there are three ways: First-fit,Best-fit,

A. FCFS B. SJF C. DDOS D. Worst-fit

Ans:

9. The information in the file can be accessed in several waysSequential Access,, Other Access Method

A. Segmented access B. Continuous access C. Paging access D. Direct Access

Ans:

10.Three major methods of allocating disk space are in wide use:Contiguous allocation,, Indexed allocation

A. Dynamic allocation B. Static allocation C. Layer allocation D. Linked allocation

Ans: