Section 1
Preview this deck
A ____ can be used to prevent a user program from never returning control to the operating system. A) portal B) program counter C) firewall D) timer
Front
| 5 | 0 | ||
| 4 | 0 | ||
| 3 | 0 | ||
| 2 | 0 | ||
| 1 | 0 |
Active users
0
All-time users
1
Favorites
0
Last updated
4 years ago
Date created
Mar 1, 2020
Cards (214)
Section 1
(50 cards)
A ____ can be used to prevent a user program from never returning control to the operating system. A) portal B) program counter C) firewall D) timer
timer
A deadlock-free solution eliminates the possibility of starvation. A) True B) False
false
Pthreads refers to ____. A) the POSIX standard B) an implementation for thread behavior C) a specification for thread behavior D) an API for process creation and synchronization
a specification for thread behavior
A traditional (or heavyweight) process has a single thread of control. A) True B) False
True
The value of a counting semaphore can range only between 0 and 1. A) True B) False
false
A process control block ____. A) includes information on the process's state B) stores the address of the next instruction to be processed by a different process C) determines which process is to be executed next D) is an example of a process queue
includes information on the process's state
UNIX does not allow users to escalate privileges to gain extra permissions for a restricted activity. A) True B) False
false
The difference between a program and a process is that a program is an active entity while a process is a passive entity. A) True B) False
false
____ operating systems are designed primarily to maximize resource utilization. A) PC B) Handheld computer C) Mainframe D) Network
Mainframe
The _____________ refers to the number of processes in memory. A) process count B) long-term scheduler C) degree of multiprogramming D) CPU scheduler
degree of multiprogramming
A relocation register is used to check for invalid memory addresses generated by a CPU. A) True B) False
False
If a program terminates abnormally, a dump of memory may be examined by a ____ to determine the cause of the problem. A) module B) debugger C) shell D) control card
debugger
A message-passing model is ____. A) easier to implement than a shared memory model for inter-computer communication B) faster than the shared memory model C) a network protocol, and does not apply to operating systems D) only useful for small simple operating systems
easier to implement than a shared memory model for inter-computer communication
A system call is triggered by hardware. A) True B) False
false
The ____ of a process contains temporary data such as function parameters, return addresses, and local variables. A) text section B) data section C) program counter D) stack
Stack
A counting semaphore ____. A) is essentially an integer variable B) is accessed through only one standard operation C) can be modified simultaneously by multiple threads D) cannot be used to control access to a thread's critical sections
is essentially an integer variable
_____ is the method of binding instructions and data to memory performed by most general-purpose operating systems. A) Interrupt binding B) Compile time binding C) Execution time binding D) Load-time binding
Execution time binding
KDE and GNOME desktops are available under open-source licenses. A) True B) False
True
____ is a thread library for Solaris that maps many user-level threads to one kernel thread. A) Pthreads B) Green threads C) Sthreads D) Java threads
Green Threads
The most complex scheduling algorithm is the multilevel feedback-queue algorithm. A) True B) False
true
Race conditions are prevented by requiring that critical regions be protected by locks. A) True B) False
True
System calls can be run in either user mode or kernel mode. A) True B) False
False
There is a 1:1 correspondence between the number of entries in the TLB and the number of entries in the page table. A) True B) False
False
Processors for most mobile devices run at a slower speed than a processor in a desktop PC. A) True B) False
true
Which of the following would lead you to believe that a given system is an SMP-type system? A) Each processor is assigned a specific task B) There is a boss-worker relationship between the processors C) Each processor performs all tasks within the operating system D) None of the above
Each processor performs all tasks within the operating system
In what way is an operating system like a government? A) It seldom functions correctly B) It creates an environment within which other programs can do useful work C) It performs most useful functions by itself D) It is always concerned primarily with the individual's needs
It creates an environment within which other programs can do useful work
The ____ multithreading model multiplexes many user-level threads to a smaller or equal number of kernel threads. A) many-to-one model B) one-to-one model C) many-to-many model D) many-to-some model
many-to-many model
Absolute code can be generated for ____. A) compile-time binding B) load-time binding C) execution-time binding D) interrupt binding
compile-time binding
____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts. A) Multilevel queue B) RRC) FCFS D) SJF
SJF
An address generated by a CPU is referred to as a ____. A) physical address B) logical address C) post relocation register address D) Memory-Management Unit (MMU) generated address
logical address
The operating system kernel consists of all system and application programs in a computer. A) True B) False
False
The exec() system call creates a new process. A) True B) False
false
All processes in UNIX first translate to a zombie process upon termination. A) True B) False
True
The list of processes waiting for a particular I/O device is called a(n) ____. A) standby queue B) device queue C) ready queue D) interrupt queue
device queue
A _____ is an example of a systems program. A) command interpreter B) Web browser C) text formatter D) database system
command interpreter
Which of the following is true of cooperative scheduling? A) It requires a timer B) A process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state C) It incurs a cost associated with access to shared data D) A process switches from the running state to the ready state when an interrupt occurs
A process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state
A thread is composed of a thread ID, program counter, register set, and heap. A) True B) False
false
Windows uses the ____. A) one-to-one model B) many-to-one model C) one-to many-model D) many-to-many model
one-to-one model
Many operating system merge I/O devices and files into a combined file because of the similarity of system calls for each. A) True B) False
True
In preemptive scheduling, the sections of code affected by interrupts must be guarded from simultaneous use. A) True B) False
True
In RR scheduling, the time quantum should be small with respect to the context-switch time. A) True B) False
false
Suppose a program is operating with execution-time binding and the physical address generated is 300. The relocation register is set to 100. What is the corresponding logical address? A) 199 B) 201 C) 200 D) 300
200
An instruction that executes atomically ____. A) must consist of only one machine instruction B) executes as a single, uninterruptible unit C) cannot be used to solve the critical section problem D) All of the above
executes as a single, uninterruptible unit
Reentrant code cannot be shared. A) True B) False
false
____ is the number of processes that are completed per time unit. A) CPU utilization B) Response time C) Turnaround time D) Throughput
Throughput
Virtually all contemporary operating systems support kernel threads. A) True B) False
true
A mutex lock ____. A) is exactly like a counting semaphore B) is essentially a boolean variable C) is not guaranteed to be atomic D) can be used to eliminate busy waiting
is essentially a boolean variable
The ____ scheduling algorithm is designed especially for time-sharing systems. A) SJF B) FCFS C) RR D) Multilevel queue
RR
The major difficulty in designing a layered operating system approach is ____. A) appropriately defining the various layers B) making sure that each layer hides certain data structures, hardware, and operations from higher-level layers C) debugging a particular layer D) making sure each layer is easily converted to modules
appropriately defining the various layers
A race condition ____. A) results when several threads try to access the same data concurrently B) results when several threads try to access and modify the same data concurrently C) will result only if the outcome of execution does not depend on the order in which instructions are executed D) None of the above
results when several threads try to access and modify the same data concurrently
Section 2
(50 cards)
When a process is accessing its stack space, it exists in the _________ . A) Running state B) Waiting state C) Terminating state D) Ready state
Running state
Which of the following is considered a resource that may be allocated by an operating system? A) CPU B) bus C) file system D) Instruction register
CPU
When a process performs I/O, its PCB is moved to the ________ . A) Ready queue B) Wait queue C) Terminate queue D) Running queue
Wait queue
Which of the following statements is true? A) Shared memory is typically faster than message passing. B) Message passing is typically faster than shared memory. C) Message passing is most useful for exchanging large amounts of data. D) Shared memory is far more common in operating systems than message passing.
Shared memory is typically faster than message passing.
A __________ is a unit of work that executes sequentially and is interruptible so that the processor can turn to another thread. A) Port B) Process C) Token D) Thread
Thread
A nonpreemptive kernel is safe from race conditions on kernel data structures. A) True B) False
true
A program file is _________ . A) another name for a process B) an active entity C) a passive entity D) All of the above responses are correct.
a passive entity
For a single-processor system __________ . A) processes spend long times waiting to execute B) there will never be more than one running process C) input-output always causes CPU slowdown D) process scheduling is always optimal
there will never be more than one running process
The two modes of operation of an operating system are called ___________ . A) process and kernel B) ready and running C) interrupt and system D) kernel and user
kernel and user
Two important design issues for cache memory are ____. A) speed and volatility B) size and replacement policy C) power consumption and reusability D) size and access privileges
size and replacement policy
Medium-term scheduling is performed _________ . A) typically on submitted jobs B) when processes must not be moved from waiting to ready state C) on processes in the ready queue D) None of the above are correct.
None of the above are correct.
CPU registers are often used to ________ . A) save memory for storing programs B) store values for reuse by other user programs C) pass parameters to the operating system D) All of the above responses are correct.
pass parameters to the operating system
The ____ of a process contains temporary data such as function parameters, return addresses, and local variables. A) text section B) data section C) program counter D) stack
stack
A message passing model is ____. A) easier to implement than a shared memory model for intercomputer communication B) is faster than the shared memory model C) a network protocol and does not apply to operating systems D) is only useful for small simple operating systems
easier to implement than a shared memory model for intercomputer communication
An operating system may be viewed as a resource allocator of such things as CPU time, memory space, file-storage space, I/O devices, and so on, due to the requirement that _________ . A) such things need to allocated to be useful for operating systems to work B) conflicts of resource usage must not be permitted to happen C) computer users must be satisfied that resources are available on request D) resources be used efficiently by users
conflicts of resource usage must not be permitted to happen
Kernel threads need to be associated with a process whereas every user thread belongs to a process. A) True B) False
false
_____ allow operating system services to be loaded dynamically. A) Virtual machines B) Modules C) File systems D) Graphical user interfaces
Modules
The list of processes waiting for a particular I/O device is called a(n) ____. A) standby queue B) device queue C) wait queue D) interrupt queue
device queue
A ____ circuit can be used to prevent a user program from never returning control to the operating system. A) portal B) program counter C) firewall D) timer
timer
A shared memory model is ____. A) context switching B) a mechanism of storing process state information in process control bolck C) an interprocess communication model
an interprocess communication model
Context switching between kernel threads typically requires saving the value of the CPU registers from the thread being switched out and restoring the CPU registers of the new thread being scheduled .A) True B) False
true
Which of the following is an example of a systems program? A) command interpreter B) Web browser C) text formatter D) database system
command interpreter
A Windows process must contain at least _________ thread(s) to execute. A) four B) three C) two D) one
one
If a program terminates abnormally, a dump of memory may be examined by a ____ to determine the cause of the problem. A) module B) debugger C) shell D) control card
debugger
Thread-specific data is data that ____. A) is not associated with any process B) has been modified by the thread but not yet updated to the parent process C) is copied and not shared with the parent process D) is generated by the thread independent of the thread's process
is copied and not shared with the parent process
The Producer-Consumer problem is related to _________ . A) the allocation of resources to process states B) the scheduling of process states C) the handling of process control blocks D) All of these responses are correct.
the allocation of resources to process states
Long-term scheduling is performed _________ . A) typically on submitted jobs B) when processes must be moved from ready to waiting state C) on processes in the ready queue D) None of the above responses is correct.
typically on submitted jobs
The traditional approach of a single thread of execution per process, in which the concept of a thread is not recognized, is referred to as a __________ . A) task B) resource C) single-threaded approach D) lightweight process
single-threaded approach
It is the principal responsibility of the __________ to control the execution of processes. A) OS B) Process control block C) Memory D) Dispatcher
OS
In a(n) ____ temporary queue, the sender must always block until the recipient receives the message. A) zero capacity B) variable capacity C) bounded capacity D) unbounded capacity
zero capacity
The basic form of communication between processes or threads in a microkernel operating system is _________ . A) Dispatcher B) messages C) Socket D) port
messages
The _________ are the fundamental entities that can be scheduled to run on one of the system processors A) Processes B) Kernel threads C) Light weight processes D) PC registers
Kernel threads
A race condition ____. A) results when several threads try to access the same data concurrently B) results when several threads try to access and modify the same data concurrently C) will result only if the outcome of execution does not depend on the order in which instructions are executed D) None of the above
results when several threads try to access and modify the same data concurrently
Kernel threads are generally more expensive to maintain than user threads, as they must be represented with a kernel data structure. A) True B) False
true
Remove processes from main memory then its execution can be continued where it left off after reintroducing into memory is called ___________. A) dispatcher B) swapping C) context switching D) All of the above
swapping
When a process creates a new process using the fork() operation, which of the following states is shared between the parent process and the child process? A) Stack B) Shared memory segments C) Heap
Shared Memory Segments
An I/O-bound process _________. A) spends equal time seeking I/O operations and doing computational work B) spends more of its time doing computational work than seeking I/O operations C) spends more of its time seeking I/O operations than doing computational work D) spends less of its time seeking I/O operations than doing computational work
spends more of its time seeking I/O operations than doing computational work
When a child process is created, which of the following is a possibility in terms of the execution or address space of the child process? A) The child process runs concurrently with the parent. B) The child process has a new program loaded into it. C) The child is a duplicate of the parent. D) All of the above
All of the above
An operating system must provide a mechanism for ____ processes to create new ____ processes. A) Parent, child B) Thread, IPC C) Sockets, pipes
Parent, Child
Most often, application programs access system resources using ______ . A) system calls B) kernel threads C) application program interfaces D) user threads
application program interfaces
Which of the following is a POSIX based operating system? A) Linux B) Solaris C) Windows Vista D) All of these responses are correct.
Linux
A CPU-bound process _________ . A) frequently requests I/O operations and spends less of its time performing computational work B) frequently requests I/O operations and spends more of its time performing computational work C) infrequently requests I/O operations and spends less of its time performing computational work D) infrequently requests I/O operations and spends more of its time performing computational work
infrequently requests I/O operations and spends more of its time performing computational work
Thread-local storage is data that ____. A) is not associated with any process B) has been modified by the thread, but not yet updated to the parent process C) is generated by the thread independent of the thread's process D) is unique to each thread
is unique to each thread
The state transition from RUNNING to READY happens when a process _____ . A) is interrupted B) performs an I/O or event handling C) completes an I/O or event handling D) is dispatched by the scheduler
is interrupted
A process control block ____. A) includes information on the process's state B) stores the address of the next instruction to be processed by a different process C) determines which process is to be executed next D) is an example of a process queue
includes information on the process's state
The major difficulty in designing a layered operating system approach is ____. A) making sure each layer is easily converted to modules B) making sure that each layer hides certain data structures, hardware, and operations from higher-level layers C) debugging a particular layer D) appropriately defining the various layers
appropriately defining the various layers
The following are valid process states, including extensions to the 5-state basic model. A) Next, Running, Halting B) Terminating, Waiting, Threshing C) Running, Blocked, Waiting D) None of these responses is correct
Running, Blocked, Waiting
The resource pyramid, with CPU registers and cache memories at one point of the pyramid and tape drive storage at an opposite point, reflects which of the following problems of computer design and operating system management? A) Resource Allocation B) Speed to Cost tradeoff C) Versatile to Cost tradeoff D) Both B and C responses are correct.
Speed to Cost tradeoff
In the context of operating systems, the term Policy ____. A) determines how to do something B) determines what will be done C) is not likely to change across places D) is not likely to change over time
determines what will be done
In multiprocessor environments, two copies of the same data may reside in the local cache of each CPU. Whenever one CPU alters the data, the cache of the other CPU must receive an updated version of this data. This is called Cache _________ . A) redundancy B) integrity C) coherency D) normalization
coherency
Section 3
(50 cards)
In a dynamically linked library, ____. A) loading is postponed until execution time B) system language libraries are treated like any other object module C) more disk space is used than in a statically linked library D) a stub is included in the image for each library-routine reference
a stub is included in the image for each library-routine reference
Policy ____. A) determines how to do something B) determines what will be done C) is not likely to change across places D) is not likely to change over time
determines what will be done
_____ is not considered a challenge when designing applications for multicore systems. A) Deciding which activities can be run in parallel B) Ensuring there is a sufficient number of cores C) Determining if data can be separated so that it is accessed on separate cores D) Identifying data dependencies between tasks.
Ensuring there is a sufficient number of cores
The exec() system call creates a new process. A) True B) False
false
Race conditions are prevented by requiring that critical regions be protected by locks. A) True B) False
true
For a single-processor system, there will never be more than one process in the Running state. A) True B) False
true
Interrupts may be triggered by either hardware of software A) True B) False
true
A system call is triggered by hardware. A) True B) False
false
A traditional (or heavyweight) process has a single thread of control. A) True B) False
true
A message-passing model is ____. A) easier to implement than a shared memory model for intercomputer communication B) faster than the shared memory model C) a network protocol, and does not apply to operating systems D) only useful for small simple operating systems
easier to implement than a shared memory model for inter computer communication
A process control block ____. A) includes information on the process's state B) stores the address of the next instruction to be processed by a different process C) determines which process is to be executed next D) is an example of a process queue
includes information on the process's state
There is a 1:1 correspondence between the number of entries in the TLB and the number of entries in the page table. A) True B) False
false
The list of processes waiting for a particular I/O device is called a(n) ____. A) standby queue B) device queue C) ready queue D) interrupt queue
device queue
Absolute code can be generated for ____. A) compile-time binding B) load-time binding C) execution-time binding D) interrupt binding
compile-time binding
If a program terminates abnormally, a dump of memory may be examined by a ____ to determine the cause of the problem. A) module B) debugger C) shell D) control card
debugger
The most common secondary storage device is ____. A) random access memory B) solid state disks C) tape drives D) magnetic disk
magnetic disk
Which of the following is a benefit of allowing a program that is only partially in memory to execute? A) Programs can be written to use more memory than is available in physical memory. B) CPU utilization and throughput is increased. C) Less I/O is needed to load or swap each user program into memory. D) All of the above
all of the above
A relocation register is used to check for invalid memory addresses generated by a CPU. A) True B) False
false
Pthreads refers to ____. A) the POSIX standard. B) an implementation for thread behavior. C) a specification for thread behavior. D) an API for process creation and synchronization.
a specification for thread behavior
System calls can be run in either user mode or kernel mode. A) True B) False
false
In systems that support virtual memory, ____. A) virtual memory is separated from logical memory. B) virtual memory is separated from physical memory. C) physical memory is separated from secondary storage. D) physical memory is separated from logical memory.
physical memory is separated from logical memory.
The mapping of a logical address to a physical address is done in hardware by the ________. A) memory-management-unit (MMU) B) memory address register C) relocation register D) dynamic loading register
memory-management-unit (MMU)
____________ occurs when a higher-priority process needs to access a data structure that is currently being accessed by a lower-priority process. A) Priority inversion B) Deadlock C) A race condition D) A critical section
Priority inversion
The value of a counting semaphore can range only between 0 and 1. A) True B) False
false
The operating system kernel consists of all system and application programs in a computer. A) True B) False
false
A race condition ____. A) results when several threads try to access the same data concurrently B) results when several threads try to access and modify the same data concurrently C) will result only if the outcome of execution does not depend on the order in which instructions are executed D) None of the above
results when several threads try to access and modify the same data concurrently
A mutex lock ____. A) is exactly like a counting semaphore B) is essentially a boolean variable C) is not guaranteed to be atomic D) can be used to eliminate busy waiting
is essentially a Boolean variable
Application programmers typically use an API rather than directory invoking system calls. A) True B) False
true
The difference between a program and a process is that a program is an active entity while a process is a passive entity. A) True B) False
false
____ operating systems are designed primarily to maximize resource utilization. A) PC B) Handheld computer C) Mainframe D) Network
Mainframe
Mutex locks and counting semaphores are essentially the same thing. A) True B) False
false
When a child process is created, which of the following is a possibility in terms of the execution or address space of the child process? A) The child process runs concurrently with the parent. B) The child process has a new program loaded into it. C) The child is a duplicate of the parent. D) All of the above
All of the above
What is the correct order of operations for protecting a critical section using mutex locks? A) release() followed by acquire() B) acquire() followed by release() C) wait() followed by signal() D) signal() followed by wait().
acquire() followed by release()
A ____ provides an API for creating and managing threads. A) set of system calls B) multicore system C) thread library D) multithreading model
thread library
In general, virtual memory decreases the degree of multiprogramming in a system. A) True B) False
false
Two important design issues for cache memory are ____. A) speed and volatility B) size and replacement policy C) power consumption and reusability D) size and access privileges
size and replacement policy
Virtually all contemporary operating systems support kernel threads. A) True B) False
true
The major difficulty in designing a layered operating system approach is ____. A) appropriately defining the various layers B) making sure that each layer hides certain data structures, hardware, and operations from higher-level layers C) debugging a particular layer D) making sure each layer is easily converted to modules
appropriately defining the various layers
Thread-local storage is data that ____. A) is not associated with any processB) has been modified by the thread, but not yet updated to the parent process C) is generated by the thread independent of the thread's process D) is unique to each thread
is unique to each thread
The ____ of a process contains temporary data such as function parameters, return addresses, and local variables. A) text section B) data section C) program counter D) stack
stack
A _____ is an example of a systems program. A) command interpreter B) Web browser C) text formatter D) database system.
command interpreter
_____ is the method of binding instructions and data to memory performed by most general-purpose operating systems. A) Interrupt binding B) Compile time binding C) Execution time binding D) Load-time binding
Execution time binding
The ____ multithreading model multiplexes many user-level threads to a smaller or equal number of kernel threads. A) many-to-one model B) one-to-one model C) many-to-many model D) many-to-some model
many-to-many model
An instruction that executes atomically ____. A) must consist of only one machine instruction B) executes as a single, uninterruptible unit C) cannot be used to solve the critical section problem D) All of the above
executes as a single, uninterruptible unit
The _____________ refers to the number of processes in memory. A) process countB) long-term scheduler C) degree of multiprogramming D) CPU scheduler
degree of multi-programming
A counting semaphore ____. A) is essentially an integer variable B) is accessed through only one standard operation C) can be modified simultaneously by multiple threads D) cannot be used to control access to a thread's critical sections
is essentially an integer variable
An address generated by a CPU is referred to as a ____. A) physical address B) logical address C) post relocation register address D) Memory-Management Unit (MMU) generated address
logical address
A thread is composed of a thread ID, program counter, register set, and heap. A) True B) False
false
In what way is an operating system like a government? A) It seldom functions correctly. B) It creates an environment within which other programs can do useful work. C) It performs most useful functions by itself. D) It is always concerned primarily with the individual's needs.
It creates an environment within which other programs can do useful work.
Hierarchical page tables are appropriate for 64-bit architectures. A) True B) False
false
Section 4
(50 cards)
A process control block should contain __________ . A) the process ID B) locations to store register values C) a list of all open files D) All of these responses are correct
All of these responses are correct
Long-term scheduling is performed _________ . A) typically on submitted jobs B) when processes must be moved from ready to waiting state C) on processes in the ready queue D) None of the above responses is correct.
typically on submitted jobs
When a process is accessing its stack space, it exists in the _________ . A) Running state B) Waiting state C) Terminating state D) Ready state
Running State
A FIFO queue is the most appropriate data structure for ______ scheduling. A) RR B) FCFS C) SJF D) Multi-level
FCFS
An example of a scheduling algorithm based on the criterion of Shortest Time Remaining, Next Served is _________. A) SJF B) FCFS C) RR D) Multilevel queue
SJF
The lowest cost secondary storage medium is A) portable memory card (or stick) B) DVD ROM C) magnetic tape D) solid-state memory
magnetic tape
Medium-term scheduling is performed _________ . A) typically on submitted jobs B) when processes must be moved from waiting to ready state C) on processes in the ready queue D) None of the above are correct.
when processes must be moved from waiting to ready state
When a process performs I/O, its PCB is moved to the ________ . A) Ready queue B) Wait queue C) Terminate queue D) Running queue
wait queue
In a virtual machine, each program believes that it has ______. A) multiple processors B) its own memory C) another "virtual" computer to assist in its operations D) more memory than is physically available on the machine
its own memory
In scheduling, the term Aging involves ___________ . A) higher priority processes preventing low-priority processes from ever getting the CPU. B) gradually increasing the priority of a process so that a process will eventually execute. C) processes that are ready to run but stuck waiting indefinitely for the CPU. D) processes being stuck in ready queues so long that they die.
gradually increasing the priority of a process so that a process will eventually execute.
A microkernel is a kernel ____. A) that is stripped of all essential components B) that is compressed before loading in order to reduce its resident memory size C) that is compiled to produce the smallest size possible when stored to disk D) containing many components that are optimized to reduce resident memory size
that is compressed before loading in order to reduce its resident memory size
Context switching between processes is carried out by the _________ . A) dispatcher B) short term scheduler C) interrupt handler D) thread manager
dispatcher
Which of the following is true of multilevel queue scheduling? A) Processes can move between queues. B) Each queue has its own scheduling algorithm. C) A queue cannot have absolute priority over lower-priority queues. D) It is the most general CPU-scheduling algorithm.
Each queue has its own scheduling algorithm
A thread control block _______ . A) is managed by the parent process B) contains the same information as the process control block C) has the identical structure as the process control block D) does not include information about the parent process resource allocation
does not include information about the parent process resource allocation
Which of the following is a property of peer-to-peer systems? A) Separate machines act as either the client of the server but not both. B) Clients and servers are not distinguished from one another. C) They do not offer any advantages over traditional client-server systems. D) They suffer from the server acting as the bottleneck in performance.
Clients and servers are not distinguished from one another.
In RR scheduling, the time quantum should be _________ the context-switch time. A) small with respect to B) large with respect to C) the same size as D) irrelevant to
large with respect to
A ____ circuit can be used to prevent a user program from never returning control to the operating system. A) portal B) program counter C) firewall D) timer
timer
The two modes of operation of an operating system are called ___________ . A) process and kernel B) ready and running C) interrupt and system D) kernel and user
kernel and user
A provably optimal job scheduling scheme is _________ . A) RR B) FCFS C) SJF D) Priority
SJF
For a single-processor system __________ . A) processes spend long times waiting to execute B) there will never be more than one running process C) input-output always causes CPU slowdown D) process scheduling is always optimal
there will never be more than one running process
Which of the following pieces of information is least useful to the SYSGEN program of an operating system? A) the CPU being used B) amount of memory available C) what applications to install D) operating-system options such as buffer sizes or CPU scheduling algorithms
what applications to install
An archived program file is _________ . A) another name for a process B) an active entity C) a passive entity D) All of the above responses are correct.
a passive entity
The ____ of a process contains temporary data such as function parameters, return addresses, and local variables. A) text section B) data section C) program counter D) stack
stack
Pthreads refers to ____. A) the POSTFIX standard. B) an implementation for thread behavior. C) an API for thread creation and synchronization. D) an algorithm for thread behavior.
an API for thread creation and synchronization.
Turnaround time refers to the amount of time ______ . A) that CPU utilization is minimized B) needed to execute a particular process C) a process has been waiting in the ready queue D) it takes from when a request was submitted until the first action is produced
needed to execute a particular process
Which of the following is an example of a systems program? A) command interpreter B) Web browser C) text formatter D) database system
command interpreter
Processes are capable of _______ . A) executing concurrently B) performing data transfer operations C) performing logic D) All of the above responses are correct
All of the above responses are correct
In multiprocessor environments, two copies of the same data may reside in the local cache of each CPU. Whenever one CPU alters the data, the cache of the other CPU must receive an updated version of this data. This is called Cache _________ . A) Coherency B) Cooperation C) Redundancy D) Concurrency
Coherency
Most often, application programs access system resources using ______ . A) system calls B) kernel threads C) user threads D) application program interfaces
application program interfaces
Which of the following is an operating system? A) Linux B) Solaris C) Windows XP D) All of these responses are correct.
All of these responses are correct
____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts. A) Multilevel queue B) RR C) FCFS D) SJF
SJF
Thread-specific data is data that ____. A) is not associated with any process B) has been modified by the thread but not yet updated to the parent process C) is copied and not shared with the parent process D) is generated by the thread independent of the thread's process
is copied and not shared with the parent process
A CPU-bound process _________ . A) infrequently requests I/O operations and spends more of its time performing computational work B) frequently requests I/O operations and spends more of its time performing computational work C) infrequently requests I/O operations and spends less of its time performing computational work D) frequently requests I/O operations and spends less of its time performing computational work
infrequently requests I/O operations and spends more of its time performing computational work
When a child process is created, which of the following is a possibility in terms of the execution or address space of the child process? A) The child process runs concurrently with the parent. B) The child process may outlive the parent. C) The child may acquire more resources than the parent. D) None of the above responses is correct.
The Child process runs concurrently with the parent
If a program terminates abnormally, a dump of memory may be examined by a ____ to determine the cause of the problem. A) module B) debugger C) shell D) control card
debugger
In a(n) ____ temporary queue, the sender must always block until the recipient receives the message. A) zero capacity B) variable capacity C) bounded capacity D) unbounded capacity
zero capacity
The timer construct used to ensure protection of the CPU from infinite loops in user processes is an example of ___________ . A) policy B) mechanism C) hardware D) a design goal
mechanism
In what way is an operating system like a government? A) It seldom functions correctly. B) It creates an environment within which other programs can do useful work. C) It performs most useful functions by itself. D) It is always concerned primarily with the individual's needs.
It creates an environment within which other programs can do useful work.
____ is the amount of time it takes from when a request was submitted until terminated. A) CPU utilization B) Response time C) Turnaround time D) Throughput
Turnaround time
Which of the following is considered a resource that may be allocated by an operating system? A) CPU B) bus C) DMA processor D) Instruction register
CPU
Two important design issues for cache memory are ____. A) speed and volatility B) size and replacement policy C) power consumption and reusability D) size and access privileges
size and replacement policy
The ____ scheduling algorithm is designed especially for time-sharing systems. A) SJF B) FCFS C) RR D) Multilevel queue
RR
In the context of operating systems, the term Policy ____. A) determines how to do something B) determines what will be done C) is not likely to change across places D) is not likely to change over time
determines what will be done
____ is the amount of time a process has been waiting to enter the ready state for the first time. A) Wait time B) Response time C) Turnaround time D) None of these responses are correct.
response time
A process control block ____. A) includes information on the process's state B) stores the address of the last instruction processed C) determines which process is to be executed next D) is an example of a process queue
includes information on the process's state
The Producer-Consumer problem is related to _________ . A) the allocation of resources to process states B) the scheduling of process states C) the handling of process control blocks D) All of these responses are correct.
the allocation of resources to process states
34. The SJF scheduling scheme requires knowledge of each process's _________ . A) Total resource requirements B) Algorithm C) Total burst time D) Priority
Total burst time
Which of the following scheduling algorithms must be non-preemptive? A) SJF B) RR C) FCFS D) priority algorithms
FCFS
. The major challenge in designing a layered operating system approach is ____. A) making sure each layer is easily converted to modules B) making sure that each layer hides certain data structures, hardware, and operations from higher-level layers C) appropriately defining the various layers D) debugging a particular layer
appropriately defining the various layers
____ is the number of processes that are completed per time unit. A) CPU utilization B) Response time C) Turnaround time D) Throughput
Throughput
Section 5
(14 cards)