Chapter 1-7 True/False
A Solaris interactive thread with priority 15 has a higher relative priority than an interactive thread with priority 20
False
A deadlock-free solution eliminates the possibility of starvation.
False
A dual-core system requires each core has its own cache memory.
False
A new browser process is create by the Chrome browser for every new website that is visited.
False
A system call is triggered by hardware.
False
A system in an unsafe state will ultimately deadlock.
False
A thread is composed of a thread ID, program counter, register set, and heap.
False
All access to POSIX shared memory requires a system call.
False
All computer systems have some sort of user interaction.
False
An initial bootstrap program is in the form of random-access memory (RAM).
False
Deadlock prevention and deadlock avoidance are essentially the same approaches for handling deadlock.
False
Grand Central Dispatch requires multiple threads.
False
If a resource-allocation graph has a cycle, the system must be in a deadlocked state.
False
In Java, data shared between threads is simply declared globally.
False
In Pthread real-time scheduling, the SCHED_FIFO class provides time slicing among threads of equal priority.
False
In RR scheduling, the time quantum should be small with respect to the context-switch time.
False
Linux distinguishes between processes and threads.
False
Linux mostly uses atomic integers to manage race conditions within the kernel.
False
Load balancing algorithms have no impact on the benefits of processor affinity.
False
Load balancing is typically only necessary on systems with a common run queue.
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
Ordering resources and requiring the resources to be acquired in order prevents the circular wait from occurring and therefore prevents deadlock from occurring.
False
Protocols to prevent hold-and-wait conditions typically also prevent starvation.
False
Providing a preemptive, priority-based scheduler guarantees hard real-time functionality.
False
Shared memory is a more appropriate IPC mechanism than message passing for distributed systems.
False
Sockets are considered a high-level communications scheme.
False
Solaris and Windows assign higher-priority threads/tasks longer time quantums and lower-priority tasks shorter time quantums.
False
Solid state disks are considered volatile storage.
False
System calls can be run in either user mode or kernel mode.
False
Systems using a one-to-one model (such as Windows, Solaris , and Linux) schedule threads using process-contention scope (PCS).
False
Task parallelism distributes threads and data across multiple computing cores.
False
The difference between a program and a process is that a program is an active entity while a process is a passive entity.
False
The exec() system call creates a new process.
False
The length of a time quantum assigned by the Linux CFS scheduler is dependent upon the relative priority of a task.
False
The operating system kernel consists of all system and application programs in a computer.
False
The single benefit of a thread pool is to control the number of threads.
False
The value of a counting semaphore can range only between 0 and 1.
False
UNIX does not allow users to escalate privileges to gain extra permissions for a restricted activity.
False
iOS is open source, Android is closed source.
False
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
A multicore system allows two (or more) threads that are in compute cycles to execute at the same time.
True
A nonpreemptive kernel is safe from race conditions on kernel data structures.
True
A socket is identified by an IP address concatenated with a port number.
True
A thread will immediately acquire a dispatcher lock that is the signaled state.
True
A traditional (or heavyweight) process has a single thread of control.
True
All processes in UNIX first translate to a zombie process upon termination.
True
Amdahl's Law describes performance gains for applications with both a serial and parallel component.
True
Application programmers typically use an API rather than directory invoking system calls.
True
Deferred cancellation is preferred over asynchronous cancellation.
True
Each thread has its own register set and stack.
True
Every object in Java has associated with it a single lock.
True
Flash memory is slower than DRAM but needs no power to retain its contents.
True
For a single-processor system there will never be more than one process in the Running state.
True
In general Windows system calls have longer, more descriptive names and UNIX system calls use shorter, less descriptive names.
True
In hard real-time systems, interrupt latency must be bounded.
True
In preemptive scheduling, the sections of code affected by interrupts must be guarded from simultaneous use.
True
In the Linux CFS scheduler, the task with smallest value of vruntime is considered to have the highest priority.
True
Interrupts may be triggered by either hardware of software
True
It is possible to create a thread library without any kernel-level support.
True
It is possible to have concurrency without parallelism.
True
KDE and GNOME desktops are available under open-source licenses.
True
Local Procedure Calls in Windows XP are similar to Remote Procedure Calls.
True
Mac OS X is a hybrid system consisting of both the Mach microkernel and BSD UNIX.
True
Many operating system merge I/O devices and files into a combined file because of the similarity of system calls for each.
True
Mutex locks and binary semaphores are essentially the same thing.
True
Named pipes continue to exist in the system after the creating process has terminated.
True
OpenMP only works for C, C++, and Fortran programs
True
Ordinary pipes in UNIX require a parent-child relationship between the communicating processes.
True
Ordinary pipes in Windows require a parent-child relationship between the communicating processes.
True
Processors for most mobile devices run at a slower speed than a processor in a desktop PC.
True
Race conditions are prevented by requiring that critical regions be protected by locks.
True
Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long.
True
SMP systems that use multicore processors typically run faster than SMP systems that place each processor on separate cores.
True
Solid state disks are generally faster than magnetic disks.
True
The Completely Fair Scheduler (CFS) is the default scheduler for Linux systems.
True
The Mach operating system treats system calls with message passing.
True
The banker's algorithm is useful in a system with multiple instances of each resource type.
True
The circular-wait condition for a deadlock implies the hold-and-wait condition.
True
The iOS mobile operating system only supports a limited form of multitasking.
True
The local variables of a monitor can be accessed by only the local procedures.
True
The most complex scheduling algorithm is the multilevel feedback-queue algorithm.
True
The trend in developing parallel applications is to use implicit threading.
True
The wait-for graph scheme is not applicable to a resource allocation system with multiple instances of each resource type.
True
There is no universally accepted definition of an operating system.
True
Using a section object to pass messages over a connection port avoids data copying.
True
Virtually all contemporary operating systems support kernel threads.
True
Virtually all modern operating systems provide support for SMP
True
Windows 7 User-mode scheduling (UMS) allows applications to create and manage thread independently of the kernel
True