Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
COP4610 Midterm
Midterm review
| Question | Answer |
|---|---|
| A _____ provides a file-system interface which allows clients to create and modify files. | file-server system |
| The most common secondary storage device is ____. | magnetic disk |
| A ____ can be used to prevent a user program from never returning control to the operating system. Answer | timer |
| ____ operating systems are designed primarily to maximize resource utilization. | Mainframe |
| Which of the following statements concerning open source operating systems is true? | Source code is freely available. |
| A dual-core system requires each core has its own cache memory. | False |
| A system call is triggered by hardware. | False |
| Interrupts may be triggered by either hardware of software. | True |
| Virtually all modern operating systems provide support for SMP. | True |
| Embedded computers typically run on a ____ operating system. | real-time |
| Which of the following would lead you to believe that a given system is an SMP-type system? | Each processor performs all tasks within the operating system. |
| Flash memory is slower than DRAM but needs no power to retain its contents. | True |
| A ____ is a custom build of the Linux operating system | distribution |
| In what way is an operating system like a government? | It creates an environment within which other programs can do useful work. |
| Which of the following operating systems is not open source? | Windows XP |
| Which of the following is a property of peer-to-peer systems? | Clients and servers are not distinguished from one another. |
| Processors for most handheld devices run at a fraction of the speed of a processor in a PC. | True |
| The operating system kernel consists of all system and application programs in a computer. | False |
| A microkernel is a kernel ____. | that is stripped of all nonessential components |
| Policy ____. | determines what will be done |
| To the SYSGEN program of an operating system, the least useful piece of information is _____. | what applications to install |
| If a program terminates abnormally, a dump of memory may be examined by a ____ to determine the cause of the problem. | debugger |
| A message-passing model is ____. | easier to implement than a shared memory model for intercomputer communication |
| The close() system call in UNIX is used to close a file. What is the equivalent system call in Windows: | CloseHandle() |
| System calls can be run in either user mode or kernel mode. | False |
| An initial bootstrap program is in the form of random-access memory (RAM). | False |
| KDE and GNOME desktops are available under open-source licenses. | True |
| In general, Windows system calls have longer, more descriptive names and UNIX system calls use shorter, less descriptive names. | True |
| _____ is not an example of a benefit of virtual machines. | Uses less physical memory than an actual operating system |
| A _____ is an example of a systems program. | File management - Status Information - File modification - programming language support - Program loading and execution - communication |
| In a virtual machine, each program believes that it has ____. | its own memory |
| A program written for the .NET Framework need not worry about the specifics of the hardware or the operating system on which it will run. | True |
| Many operating systems merge I/O devices and files into a combined file because of the similarity of system call each | True |
| Bluetooth and 802.11 devices use wireless technology to communicate over several feet, in essence creating a ____. | small-area network |
| Two important design issues for cache memory are ____. | size and replacement policy |
| _____ allow operating system services to be loaded dynamically. | Modules |
| Microkernels use _____ for communication. | Message Passing |
| ___ is a popular commercial application that abstracts Intel 80XXx86 hardware into isolated virtual machines. | WMware |
| Which of the following statements is incorrect? | Operating systems provide both command line as well as graphical user interfaces. |
| Some level of hardware support is required to provide virtualization. | True |
| A process may transition to the Ready state by which of the following actions? | Completion of an I/O event Awaiting its turn on the CPU Newly-admitted process All of the above |
| Which of the following statements is true? | Reading and writing to ordinary pipes on both UNIX and Windows systems can be performed like ordinary file I/O. |
| 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? | The child process runs concurrently with the parent. The child process has a new program loaded into it. The child is a duplicate of the parent.All of the above |
| A(n) ______________ allows several unrelated processes to use the pipe for communication. | named pipe |
| A blocking send() and blocking receive() is known as a(n) _________________ | rendezvous |
| The ____ of a process contains temporary data such as function parameters, return addresses, and local variables. | stack |
| A socket is identified by an IP address concatenated with a port number. | True |
| Ordinary pipes in Windows require a parent-child relationship between the communicating processes. | True |
| For a single-processor system, there will never be more than one process in the Running state. | True |
| Using a section object to pass messages over a connection port avoids data copying. | True |
| A _____________ saves the state of the currently running process and restores the state of the next process to run. | context switch |
| Reading and writing to ordinary pipes on both UNIX and Windows systems can be performed like ordinary file I/O. | True |
| Child processes inherit UNIX ordinary pipes from their parent process because: | Pipes are a special type of file |
| Which of the following statements is true? | Shared memory is typically faster than message passing. |
| 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? | All of the above |
| Named pipes continue to exist in the system after the creating process has terminated. | True |
| Using a section object to pass messages over a connection port avoids data copying. | True |
| Sockets are considered a high-level communications scheme. | False |
| All access to POSIX shared memory requires a system call. | False |
| The list of processes waiting for a particular I/O device is called a(n) ____. | device queue |
| Imagine that a host with IP address 150.55.66.77 wishes to download a file from the web server at IP address 202.28.15.123. Select a valid socket pair for a connection between this pair of hosts. | 150.55.66.77:2000 and 202.28.15.123:80 |
| Which of the following is true in a Mach operating system? | All messages have the same priority. |
| When communicating with sockets, a client process initiates a request for a connection and is assigned a port by the host computer. Which of the following would be a valid port assignment for the host computer? | 1625 |
| The _____________ refers to the number of processes in memory. | degree of multiprogramming |
| Local Procedure Calls in Windows XP are similar to Remote Procedure Calls. | True |
| The difference between a program and a process is that a program is an active entity while a process is a passive entity. | False |
| What is the numeric priority of a Windows XP thread in the BELOW_NORMAL_PRIORITY_CLASS with NORMAL relative priority? | 6 |
| With _______ a thread executes on a processor until a long-latency event (i.e. a memory stall) occurs. | coarse-grained multithreading |
| A significant problem with priority scheduling algorithms is _____. | starvation |
| ____ is the number of processes that are completed per time unit. | Throughput |
| In Solaris, if an interactive thread with priority 15 uses its entire time quantum, what is its priority recalculated to? | 5 |
| The default scheduling class for a process in Solaris is ____. | time sharing |
| Load balancing is typically only necessary on systems with a common run queue. | False |
| SMP systems that use multicore processors typically run faster than SMP systems that place each processor on separate cores. | True |
| Solaris, Windows XP, and Linux assign higher-priority threads/tasks longer time quantums and lower-priority tasks shorter time quantums. | False |
| In preemptive scheduling, the sections of code affected by interrupts must be guarded from simultaneous use. | True |
| What is the numeric priority of a Windows XP thread in the HIGH_PRIORITY_CLASS with ABOVE_NORMAL relative priority? | 14 |
| What is the numeric priority of a Windows XP thread in the NORMAL_PRIORITY_CLASS with HIGHEST relative priority? | 10 |
| In Little's formula n = λ x W, what does W represent? | average waiting time in the queue |
| In Solaris, what is the time quantum (in milliseconds) of an interactive thread with priority 35? | 80 |
| A Solaris interactive thread with a time quantum of 80 has a higher priority than an interactive thread with a time quantum of 120. | True |
| Systems using a one-to-one model (such as Windows XP, Solaris 9, and Linux) schedule threads using process-contention scope (PCS). | False |
| A multicore system allows two (or more) threads that are in compute cycles to execute at the same time. | True |
| ____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts. | SJF |
| ______ allows a thread to run on only one processor. | Processor affinity |
| In Little's formula n = λ x W, what does λ represent ? | average arrival rate for new processes in the queue |
| What is the numeric priority of a Windows XP thread in the HIGH_PRIORITY_CLASS with ABOVE_NORMAL relative priority? | 14 |
| In Solaris, if an interactive thread with priority 25 is waiting for I/O, what is its priority recalculated to when it is eligible to run again? | 52 |
| In RR scheduling, the time quantum should be small with respect to the context-switch time. | False |
| Load balancing algorithms have no impact on the benefits of processor affinity. | False |
| Virtualization does not allow a single-CPU system to appear as a multiprocessor system. | False |
| In Linux, tasks that are not real-time have dynamic priorities that are based on their ____ values plus or minus the value 5. | nice |
| In Little's formula n = λ x W, what does n represent ? | average queue length |
| What is the numeric priority of a Windows XP thread in the HIGH_PRIORITY_CLASS with ABOVE_NORMAL relative priority? | 14 |
| n Solaris, if an interactive thread with priority 15 uses its entire time quantum, what is its priority recalculated to? | 5 |
| In Solaris, what is the time quantum (in milliseconds) of an interactive thread with priority 35? | 80 |
| The _____ model maps many user-level threads to one kernel thread. | many-to-one |
| A _____ uses an existing thread rather than creating a new one to complete a task. | thread pool |
| In multithreaded programs, the kernel informs an application about certain events using a procedure known as a(n) ____. | upcall |
| A ____ provides an API for creating and managing threads. | thread library |
| Which of the following statements regarding threads is false? | Sharing is automatically provided in Java threads. |
| Deferred cancellation is preferred over asynchronous cancellation. | True |
| Each thread has its own register set and stack. | True |
| Virtually all contemporary operating systems support kernel threads. | True |
| A thread is composed of a thread ID, program counter, register set, and heap. | False |
| The ____ multithreading model multiplexes many user-level threads to a smaller or equal number of kernel threads. | many-to-many model |
| In Pthreads, a parent uses the pthread_join() function to wait for its child thread to complete. What is the equivalent function in Win32? | WaitForSingleObject() |
| The most common technique for writing multithreaded Java programs is _____. | implementing the Runnable interface and defining its run() method |
| Signals can be emulated in windows through ____. | asynchronous procedure calls |
| Thread-specific data is data that ____. | is copied and not shared with the parent process |
| Virtually all contemporary operating systems support kernel threads. | True |
| Linux distinguishes between processes and threads. | False |
| Which of the following would be an acceptable signal handling scheme for a multithreaded program? | -Deliver the signal to the thread to which the signal applies -Deliver the signal to every thread in the process -Deliver the signal to certain threads in the process - Assign a specific thread to receive all signals for the process |
| Monitors are a theoretical concept and are not practiced in modern programming languages | False |
| A deadlock-free solution eliminates the possibility of starvation. | False |
| Mutex locks and binary semaphores are essentially the same thing. | True |
| A schedule in which each transaction is executed atomically is called a(n) ____. | serial schedule |
| A semaphore ____. | is essentially an integer variable |
| A race condition ____. | results when several threads try to access and modify the same data concurrently |
| _____ is not a technique for handling critical sections in operating systems on modern architctures | Peterson's solution |
| A transaction_____. | performs a single logical function |
| A(n)_______ refers to where a process is accessing/updating shared data | critical section |
| Race conditions are prevented by requiring that critical regions be protected by locks | true |
| A thread will immediately acquire a dispatcher lock that is the signal state | True |
| UNIX does not allow users to escalate privileges to gain extra permissions for a restricted activity. | False |
| A clustered system ____. | gathers together multiple CPUs to accomplish computational work |
| _____ provide(s) an interface to the services provided by an operating system. | System calls |
| The major difficulty in designing a layered operating system approach is ____. | appropriately defining the various layers |
| Application programmers typically use an API rather than directory invoking system calls. | True |
| Some level of hardware support is required to provide virtualization. | True |
| A blocking send() and blocking receive() is known as a(n) _________________ | rendezvous |
| Ordinary pipes in UNIX require a parent-child relationship between the communicating processes. | True |
| The Mach operating system treats system calls with message passing. | True |
| The list of processes waiting for a particular I/O device is called a(n) ____. | device queue |
| Ordinary pipes in Windows require a parent-child relationship between the communicating processes. | true |
| In a(n) ____ temporary queue, the sender must always block until the recipient receives the message. | zero capacity |
| Which of the following would be an acceptable signal handling scheme for a multithreaded program? | Deliver the signal to the thread to which the signal applies. Deliver the signal to every thread in the process. Deliver the signal to only certain threads in the process. |
| n multithreaded programs, the kernel informs an application about certain events using a procedure known as a(n) ____. | upcall |
| The _____ model allows a user-level thread to be bound to one kernel thread. | two level |
| Pthreads refers to ____. | WRONG: an implementation for thread behavior. POSIX standard defining an API for thread creation and synchronization?? |
| t is possible to create a thread library without any kernel-level support. | True |
| A traditional (or heavyweight) process has a single thread of control. | True |
| LWP is ____. | placed between user and keener threads |
| ____ is a thread library for Solaris that maps many user-level threads to one kernel thread. | Green Threads |
| In Little's formula n = λ x W, what does n represent ? | average queue length |
| Which of the following is true of multilevel queue scheduling? | Each queue has its own scheduling algorithm. |
| The most complex scheduling algorithm is the multilevel feedback-queue algorithm. | true |
| A schedule in which each transaction is executed atomically is called a(n) ____. | serial schedule |
| Assume an adaptive mutex is used for accessing shared data on a Solaris system with multiprocessing capabilities. Which of the following statements is not tru | Condition variables and semaphores are never used in place of an adaptive mutex. |
| How many philosophers may eat simultaneously in the Dining Philosophers problem with 5 philosophers? | 2 |
| A transaction ____. | performs a single logical function |
| A solution to the critical section problem does not have to satisfy which of the following requirements? | atomicity |
| What is the purpose of the mutex semaphore in the implementation of the bounded-buffer problem using semaphores? | It ensures mutual exclusion. |
| Race conditions are prevented by requiring that critical regions be protected by locks. | true |
| The value of a counting semaphore can range only between 0 and 1. | False |
| A thread will immediately acquire a dispatcher lock that is the signaled state. | True |
| A deadlock-free solution eliminates the possibility of starvation. | False |
| A transaction ____. | performs a single logical function |
| A ___ type presents a set of programmer-defined operations that are provided mutual exclusion within it. | monitor |
| _____ can be used to prevent busy waiting when implementing a semaphore. | block?? waiting queues |
| In Peterson's solution, the ____ variable indicates if a process is ready to enter its critical section. | flag[i] |
| A semaphore ____. | is essentially an integer variable |
| The first readers-writers problem ____. | requires that no reader will be kept waiting unless a writer has already obtained permission to use the shared database. |
| requires that no reader will be kept waiting unless a writer has already obtained permission to use the shared database. | False |
| Monitors are a theoretical concept and are not practiced in modern programming languages | False |
| Mutex locks and counting semaphores are essentially the same thing. | False |
| Every object in Java has associated with it a single lock. | True |
| Mutex locks and binary semaphores are essentially the same thing. | True |
| A race condition ____. | results when several threads try to access and modify the same data concurrently |
| _____is not a technique for handling critical sections in operating systems on modern architectures. | Peterson's solution |
| Windows XP, when accessing a global variable on a uniprocessor system, ____. | masks interrupts for all interrupt handlers that may also access the variable |
| Monitors are a theoretical concept and are not practiced in modern programming languages | False |
| A thread will immediately acquire a dispatcher lock that is the signaled state. | true |
| Every object in Java has associated with it a single lock. | True |
| The value of a counting semaphore can range only between 0 and 1. | False |
| Which of the following statements is NOT true? | WRONG A counting semaphore can never be used as a binary semaphore. WRONG A binary semaphore can never be used as a counting semaphore. |
| When using semaphores, a process invokes the wait() operation before accessing its critical section, followed by the signal() operation upon completion of its critical section. Consider reversing the order of these two operations first calling signal(), | Several processes could be active in their critical sections at the same time. |
| An instruction that executes atomically ____. | executes as a single, uninterruptible unit |
| The local variables of a monitor can be accessed by only the local procedures. | True |
| Race conditions are prevented by requiring that critical regions be protected by locks. | True |
| What is the purpose of the mutex semaphore in the implementation of the bounded-buffer problem using semaphores? | It ensures mutual exclusion. |
| The first readers-writers problem ____. | requires that no reader will be kept waiting unless a writer has already obtained permission to use the shared database. |
| A(n) _______ refers to where a process is accessing/updating shared data. | critical section |
| A race condition ____. | results when several threads try to access and modify the same data concurrently |
| Mutex locks and binary semaphores are essentially the same thing. | True |
| The value of a counting semaphore can range only between 0 and 1. | False |
| A deadlock-free solution eliminates the possibility of starvation. | False |
| A spinlock ____. | does not require a context switch when a process must wait on a lock |
| Every object in Java has associated with it a single lock. | True |
| Windows XP, when accessing a global variable on a uniprocessor system, ____. | masks interrupts for all interrupt handlers that may also access the variable |
| Monitors are a theoretical concept and are not practiced in modern programming languages | False |
| A(n) _______ refers to where a process is accessing/updating shared data. | critical section |
| The exec() system call creates a new process. | False |
| _____ is/are not a technique for passing parameters from an application to a system call. | Cache |
| _____ is not one of the major categories of system calls. | Security |
| Many operating system merge I/O devices and files into a combined file because of the similarity of system calls for each. | True |
| A boot block ____. | typically only knows the location and length of the rest of the bootstrap program |
| The virtual-machine [VM] concept is designed to insulate various system resources from processes running on the VM. | True |
| A process control block ____. | includes information on the process's state |
| Shared memory is a more appropriate IPC mechanism than message passing for distributed systems. | False |
| _____ is not considered a challenge when designing applications for multicore systems. | Ensuring there is a sufficient number of cores |
| Windows XP uses the ____. | one-to-one model many-to-one model one-to many-model many-to-many model |
| Cancellation points are associated with ____ cancellation. | deferred asynchronous deferred synchronous |
| The single benefit of a thread pool is to control the number of threads. | False |
| In Java, data shared between threads is simply declared globally. | False |
| The _____ model maps each user-level thread to one kernel thread. | one-to-one |
| __________ involves the decision of which kernel thread to schedule onto which CPU. | System-contention scope |
| A Solaris interactive thread with priority 15 has a higher relative priority than an interactive thread with priority 20 | False |
| The ______ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU. | Convoy effect |
| Which of the following is true of cooperative scheduling? | A process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state. |
| Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long. | True |
| The virtual-machine concept does not offer complete protection of the various system resources. | False |
| The JVM provides the ability to run architecture-neutral programs. | True |
| The Windows CreateProcess() system call creates a new process. What is the equivalent system call in UNIX | fork() |
Created by:
gumaturana