操作系统选择题

LESSON3
Question 1 B
分数: 0/7 The behavior of a processor can be characterized by examining:
a. A single process trace
b. The interleaving of the process traces
c. Multiple process traces
d. All of the above

Question 2 B
分数: 0/7 The Process Image element that contains the modifiable part of the user space is called the:
a. System Stack
b. None of the above
c. User Program
d. Process Control Block

Question 3 C
分数: 0/7 The processor execution mode that user programs typically execute in is referred to as:
a. System mode
b. None of the above
c. User mode
d. Kernel mode

Question 4 D
分数: 0/7 One step in the procedure for creating a new process involves:
a. Allocating space for the process
b. Assigning a unique identifier
c. Initializing the process control block
d. All of the above

Question 5 D
分数: 0/7 A process switch may occur when the system encounters an interrupt condition, such as that generated by a:
a. Supervisor call
b. Trap
c. Memory fault
d. All of the above

Question 6 B
分数: 0/7 In the Process Based O/S:
a. The User Process Image includes a kernel stack
b. Major kernel functions are organized as separate functions
c. None of the above
d. O/S code and data are contained in the shared address space

Question 7 A
分数: 0/7 In a typical UNIX system, the element of the process image that contains the processor status information is the:
a. Register context
b. User-level context
c. All of the above
d. System-level context

Question 8 D
分数: 0/7 The behavior of an individual process can be characterized by examining:
a. Multiple process traces
b. All of the above
c. The interleaving of the process traces
d. A single process trace

Question 9 A
分数: 0/7 The basic Two-State Process Model defines two possible states for a process in relationship to the processor:
a. Running and Not Running
b. Running and Executing
c. None of the above
d. Executing and Waiting

Question 10 C
分数: 0/7 There are a number of conditions that can lead to process termination, including:
a. Normal completion
b. Bounds violation
c. All of the above
d. Parent termination

Question 11 C
分数: 0/6 In the Five-State Process Model, the following represents a valid state transition:
a. New -> Running
b. All of the above
c. Running -> Blocked
d. New -> Blocked

Question 12 D
分数: 0/6 In a Process Model that implements two suspend states, a valid state transition is represented by:
a. Running -> Ready/Suspend
b. Ready -> Ready/Suspend
c. Ready/Suspend -> Ready
d. All of the above

Question 13 A
分数: 0/6 The scheduling strategy where each process in the queue i

s given a certain amount of time, in turn, to execute and then returned to the queue, unless blocked is referred to as:
a. Round-Robin
b. Prioritization
c. LIFO
d. All of the above

Question 14 B
分数: 0/6 A Memory Table is an O/S control structure that is used by the O/S to:
a. Provide information about system files
b. None of the above
c. Manage I/O devices
d. Manage processes

Question 15 B
分数: 0/6 The Process Image element that contains the collection of attributes needed by the O/S to control a particular process is called the:
a. None of the above
b. Process Control Block
c. User Data
d. System Stack




LESSON4
Question 1 C
分数: 0/7 The concept of a process in an operating system embodies two primary characteristics, one of which is:
a. Multithreading
b. Symmetric multiprocessing
c. Resource ownership
d. None of the above

Question 2 B
分数: 0/7 Early operating systems that were designed with little concern about structure are typically referred to as:
a. Kernel operating systems
b. Monolithic operating systems
c. Layered operating systems
d. All of the above

Question 3 B
分数: 0/7 A benefit of the microkernel organization is:
a. Flexibility
b. All of the above
c. Portability
d. Extensibility

Question 4 C
分数: 0/7 In low-level microkernel memory management, an example of an operation that can support external paging and virtual memory management is the:
a. Flush operation
b. Grant operation
c. All of the above
d. Map operation

Question 5 D
分数: 0/7 In a W2K system, the state that a thread enters when it has been unblocked and the resource for which it has been blocked is not yet available is called the:
a. None of the above
b. Standby state
c. Waiting state
d. Transition state

Question 6 A
分数: 0/7 In a Solaris system, a User-Level Thread (ULT) that enters the active state is assigned to a:
a. Light-Weight Process (LWP)
b. Heavy-Weight Process (HWP)
c. Kernel thread
d. None of the above

Question 7 C
分数: 0/7 In a Linux system, when a new process is cloned, the two processes share the same:
a. All of the above
b. task_struct data structure
c. Virtual memory
d. Process identifier

Question 8 B
分数: 0/7 An example of a system that implements a single process with multiple threads is:
a. Solaris
b. Java
c. All of the above
d. WIN 2000

Question 9 B
分数: 0/7 Which of the following is true regarding the relationship between processes and threads:
a. It takes less time to switch between two different processes than to switch between two threads within the same process
b. It takes far less time to create a new thread in an existing process than to create

a new process
c. All of the above
d. It takes less time to terminate a process than a thread

Question 10 C
分数: 0/7 The basic thread operation related to the change in thread state that occurs when a thread needs to wait for an event is referred to as the:
a. Spawn operation
b. None of the above
c. Block operation
d. Unblock operation

Question 11 A
分数: 0/6 One of the disadvantages of User-Level Threads (ULTs) compared to Kernel-Level Threads (KLTs) is:
a. When a ULT executes a system call, all threads in the process are blocked
b. Thread switching does not require kernel mode privileges
c. All of the above
d. Scheduling is application specific

Question 12 C
分数: 0/6 In the Linux O/S, multiple threads may be created and executed within a single process. This is an example of the following Thread-to-Process relationship:
a. 1:M
b. 1:1
c. None of the above
d. M:N

Question 13 A
分数: 0/6 The computer system category where a single processor executes a single instruction stream to operate on data stored in a single memory is called:
a. Single Instruction Single Data (SISD) stream
b. Multiple Instruction Single Data (MISD) stream
c. Single Instruction Multiple Data (SIMD) stream
d. None of the above

Question 14 B
分数: 0/6 In a SMP system, each processor maintains a local cache and must alert all other processors that a change to cache update has taken place. This is referred to as the:
a. Interconnection mechanism problem
b. Cache coherency problem
c. Synchronization mechanism problem
d. None of the above

Question 15 C
分数: 0/6 Key issues involved in the design of multiprocessor operating systems include:
a. Scheduling
b. Reliability and fault tolerance
c. All of the above
d. Synchronization



LESSON5
Question 1 B
分数: 0/6 Concurrency plays a major part in which of the following specific contexts:
a. Structured applications
b. All of the above
c. Multiple applications
d. O/S structure

Question 2 C
分数: 0/6 In order to implement mutual exclusion on a critical resource for competing processes, only one program at a time should be allowed
a. To Exhibit cooperation
b. To perform message passing
c. In the critical section of the program
d. None of the above

Question 3 C
分数: 0/6 The following requirement must be met by any facility or capability that is to provide support for mutual exclusion:
a. Only one process at a time can be allowed into a critical code section
b. A process remains in its critical code section for a finite time only
c. All of the above
d. No assumptions can be made about relative process speeds

Question 4 D
分数: 0/6 Processes that are designed to be able to pass execution control back and fo

rth between themselves are referred to as
a. Threads
b. Busy waiting processes
c. None of the above
d. Coroutines

Question 5 C
分数: 0/6 Processes that are designed to be able to pass execution control back and forth between themselves are referred to as
a. Threads
b. Busy waiting processes
c. Coroutines
d. None of the above

Question 6 B
分数: 0/6 In a uniprocessor system, mutual exclusion can be guaranteed by
a. Overlapping processes
b. Disabling interrupts
c. All of the above
d. Interleaving processes

Question 7 C
分数: 0/6 A semaphore that does not specify the order in which processes are removed from the queue is called a
a. Binary semaphore
b. None of the above
c. Weak semaphore
d. Strong semaphore

Question 8 D
分数: 0/6 The finite circular buffer is used to implement which of the following basic queuing strategies
a. LIFO
b. FILO
c. None of the above
d. FIFO

Question 9 A
分数: 0/6 A chief characteristic of a monitor is:
a. A process enters the monitor by invoking one of its procedures
b. Local data variables of the monitor are accessible by any procedure requesting use of the monitor
c. All of the above
d. A maximum of two processes may be executing in a monitor at a time


Question 10 B
分数: 0/6 In synchronization involving message passing, the sender of a message can be
a. Only blocking
b. Either blocking or non-blocking
c. All of the above
d. Only non-blocking

Question 11 C
分数: 0/6 In a system employing message passing, when a message is sent to a shared temporary data structure, this general approach is known as
a. None of the above
b. Direct addressing
c. Indirect addressing
d. Blocking

Question 12 B
分数: 0/6 In a system employing message passing, the typical message is divided into two primary sections
a. Destination ID and Source ID
b. None of the above
c. Body and mailbox
d. Header and mailbox

Question 13 C
分数: 0/7 The Reader/Writer problem requires that certain conditions be satisfied, such as:
a. None of the above
b. Readers may read from the file while writers are writing to it
c. Any number of readers may simultaneously read from the file
d. Multiple writers may write to the file simultaneouslyAny number of readers may simultaneously read from the file

Question 14 D
分数: 0/7 A reason why the Producer/Consumer problem cannot be considered a special case of the Reader/Writer problem with a single writer (the producer) and a single reader (the consumer) is:
a. The Producer/Consumer problem doesn’t deal with concurrency issues
b. None of the above
c. The consumer must perform writes while the reader performs reads
d. The producer and consumer must be both reader and

writer

Question 15 C
分数: 0/7 Examples of solutions to the concurrency problem that do not involve busy waiting are the following:
a. Semaphores and monitors
b. Message passing and caching
c. None of the above
d. Producers and consumers

Question 16 B
分数: 0/7 A basic echo procedure (that echoes a typed character to the screen) running on a multiprocessor system can produce erroneous output if
a. Access to the echo procedure is synchronized
b. Access to the echo procedure is unsynchronized
c. Two processes deadlock while in the echo code
d. None of the above



LESSON6
Question 1 C
分数: 0/7 The permanent blocking of a set of processes that either compete for system resources or communicate with each other is called:
a. Starvation
b. Prioritization
c. Deadlock
d. All of the above

Question 2 C
分数: 0/7 In deadlocked process recovery, selection criteria for choosing a particular process to abort or rollback includes designating the process with the:
a. Most estimated time remaining
b. Lowest priority
c. All of the above
d. Least total resources allocated so far

Question 3 B
分数: 0/7 One approach to an integrated strategy for dealing with deadlocks involves the implementation of:
a. Process rollbacks
b. Resource classes
c. None of the above
d. Virtual memory

Question 4 B
分数: 0/7 The Dining Philosopher’s Problem is a standard test case for evaluating approaches to implementing:
a. Starvation
b. Synchronization
c. Deadlock
d. All of the above

Question 5 A
分数: 0/7 A software mechanism that informs a process of the occurrences of asynchronous events in UNIX are called:
a. Signals
b. Pipes
c. All of the above
d. Messages

Question 6 B
分数: 0/7 Thread synchronization primitives supported by Solaris include:
a. Condition variables
b. All of the above
c. Semaphores
d. Mutual exclusion (mutex) locks

Question 7 A
分数: 0/7 The family of synchronization objects implemented by W2K include:
a. All of the above
b. Event objects
c. Mutex objects
d. Semaphore objects

Question 8 B
分数: 0/7 All deadlocks involve conflicting needs for resources by:
a. None of the above
b. Two or more processes
c. Three or more processes
d. One or more processes

Question 9 B
分数: 0/7 A resource that can be created and destroyed is called a:
a. Producible resource
b. Consumable resource
c. All of the above
d. Reusable resource

Question 10 B
分数: 0/7 An example of a consumable resource is the following:
a. Printers
b. Messages
c. Main Memory
d. All of the above

Question 11 C
分数: 0/7 A condition of policy that must be present for a deadlock to be possible is:
a.

No preemption
b. Mutual exclusion
c. All of the above
d. Hold and wait

Question 12 A
分数: 0/7 A direct method of deadlock prevention is to prevent the occurrence of:
a. Circular wait
b. Hold and wait
c. Mutual exclusion
d. All of the above

Question 13 A
分数: 0/8 In the Resource Allocation Denial approach to Deadlock Avoidance, a safe state is defined as one in which:
a. At least one potential process sequence does not result in a deadlock
b. All potential process sequences do not result in a deadlock:
c. None of the above
d. Several potential process sequences do not result in a deadlock:

Question 14 D
分数: 0/8 A conservative strategy for dealing with deadlocks that involves limiting access to resources and imposing restrictions on processes is called:
a. Deadlock Detection
b. None of the above
c. Deadlock Avoidance
d. Deadlock Prevention



LESSON7
Question 1 A
分数: 0/6 The task of subdividing memory between the O/S and processes is performed automatically by the O/S and is called:
a. Memory Management
b. Relocation
c. Protection
d. All of the above

Question 2 A
分数: 0/6 A reference to a memory location independent of the current assignment of data to memory is called a:
a. Logical address
b. Relative address
c. None of the above
d. Absolute address

Question 3 B
分数: 0/6 An actual location in main memory is called a:
a. Logical address
b. Absolute address
c. None of the above
d. Relative address

Question 4 B
分数: 0/6 The page table for each process maintains:
a. The page location for each frame of the process
b. The frame location for each page of the process
c. None of the above
d. The physical memory location of the process

Question 5 A
分数: 0/6 In a system employing a paging scheme for memory management, wasted space is due to:
a. Internal fragmentation
b. None of the above
c. External fragmentation
d. Pages and frames of different specified sizes

Question 6 A
分数: 0/7 In a system employing a segmentation scheme for memory management, wasted space is due to:
a. External fragmentation
b. Segments of different sizes
c. None of the above
d. Internal fragmentation

Question 7 A
分数: 0/7 In a system employing a segmentation scheme for memory management, a process is divided into:
a. A number of segments which need not be of equal size
b. A number of segments which must be of equal size
c. None of the above
d. One segment per thread

Question 8 D
分数: 0/7 The concept of Memory Management satisfies certain system requirements, including:
a. Relocation
b. Physical organization
c. Protection
d. All of the above

Question 9 D
分数: 0/7 The prac

tice in which a program and data are organized in such a way that various modules can be assigned the same region of memory is called:
a. Sharing
b. Relocation
c. None of the above
d. Overlaying

Question 10 C
分数: 0/7 The concept of virtual memory is based on one or both of two basic techniques:
a. None of the above
b. Segmentation and partitioning
c. Segmentation and paging
d. Overlaying and relocation

Question 11 C
分数: 0/7 A problem with the largely obsolete Fixed Partitioning memory management technique is that of:
a. Inefficient use of memory
b. Allowing only a fixed number of Processes
c. All of the above
d. Internal fragmentation

Question 12 B
分数: 0/7 The problem of internal fragmentation can be lessened in systems employing a fixed-partition memory management scheme by using:
a. None of the above
b. Unequal size partitions
c. Random size partitions
d. Equal size partitions

Question 13 A
分数: 0/7 In the Dynamic Partitioning technique of memory management, the phenomenon that results in unused blocks of memory outside of existing partitions is called:
a. External fragmentation
b. Internal fragmentation
c. None of the above
d. Compaction

Question 14 D
分数: 0/7 In the Dynamic Partitioning technique of memory management, the placement algorithm that chooses the block that is closest in size to the request is called:
a. All of the above
b. Next-fit
c. First-fit
d. Best-fit

Question 15 A
分数: 0/7 In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and chooses the next available block that large enough to satisfy the request is called:
a. Next-fit
b. Best-fit
c. First-fit
d. All of the above