Matt Merritt
Quiz by , created more than 1 year ago

Information Technology Quiz on OS Final Possible Questions, created by Matt Merritt on 01/05/2017.

81
1
0
Matt Merritt
Created by Matt Merritt about 7 years ago
Close

OS Final Possible Questions

Question 1 of 139

1

An SMP can be defined as a stand-alone computer system with two or more similar processors of comparable capability.

Select one of the following:

  • True
  • False

Explanation

Question 2 of 139

1

Over the years memory access speed has consistently increased more rapidly than processor speed.

Select one of the following:

  • True
  • False

Explanation

Question 3 of 139

1

The ___ chooses which block to replace when a new block is to be loaded into the cache and the cache already has all the slots filled with other blocks.

Select one of the following:

  • memory controller

  • mapping function

  • write policy

  • replacement algorithm

Explanation

Question 4 of 139

1

When an external device becomes ready to be serviced by the processor, the device sends a(n) ___ signal to the processor.

Select one of the following:

  • access

  • halt

  • handler

  • interrupt

Explanation

Question 5 of 139

1

The ____ holds the address of the next instruction.

Select one of the following:

  • Accumulator (AC)

  • Instruction Register (IR)

  • Instruction Counter (IC)

  • Program Counter (PC)

Explanation

Question 6 of 139

1

Small, fast memory located between the processor and main memory is called ____.

Select one of the following:

  • Block memory

  • Cache memory

  • Direct memory

  • WORM memory

Explanation

Question 7 of 139

1

One mechanism Intel uses to make its caches more effective is _______.

Select one of the following:

  • mapping

  • handling

  • interconnecting

  • prefetching

Explanation

Question 8 of 139

1

In a uniprocessor system, multiprogramming increases processor efficiency by _____.

Select one of the following:

  • taking advantage of time wasted by long wait interrupt handling

  • disabling all interrupts execpt those of highest priority

  • eliminating all idle processor cycles

  • increasing processor speed

Explanation

Question 9 of 139

1

The processor controls the operation of the computer and performs its data processing functions.

Select one of the following:

  • True
  • False

Explanation

Question 10 of 139

1

Instruction processing consists of two steps:

Select one of the following:

  • fetch and execute

  • instruction and execute

  • instruction and halt

  • fetch and instruction

Explanation

Question 11 of 139

1

The ____ is the external data by which the OS is able to supervise and control the process.

Select one of the following:

  • execution context

  • associated data

  • executable program

  • nucleus

Explanation

Question 12 of 139

1

The processor itself is not a resource so the OS is not involved in determining how much of the processor time is devoted to the execution of a user.

Select one of the following:

  • True
  • False

Explanation

Question 13 of 139

1

Multiprogramming operating systems are fairly sophisticated compared to single-program or _____ systems.

Select one of the following:

  • time-sharing

  • uniprogramming

  • multitasking

  • memory management

Explanation

Question 14 of 139

1

Hardware features desirable in a batch-processing OS include memory protection, timer, privileged instructions and ______.

Select one of the following:

  • clock cycles

  • associated data

  • interrupts

  • kernels

Explanation

Question 15 of 139

1

• A common strategy to give each process in the queue some time in turn is referred to as a _____ technique.

Select one of the following:

  • multi-threading

  • serial processing

  • time slicing

  • round-robin

Explanation

Question 16 of 139

1

The technique where a system clock generates interrupts, and at each clock interrupt the OS regains control and assigns the processor to another user is _____.

Select one of the following:

  • clock cycle

  • time slicing

  • round-robin

  • multithreading

Explanation

Question 17 of 139

1

______ is where the OS must prevent independent processes from interfering with each other’s memory, both data and instructions.

Select one of the following:

  • Protection and access control

  • Support of modular programming

  • Process isolation

  • Automatic allocation and management

Explanation

Question 18 of 139

1

The phrase "control is passed to a job" means that the processor is now fetching and executing instructions from the monitor program.

Select one of the following:

  • True
  • False

Explanation

Question 19 of 139

1

The key to success of Linux has been its availability for free under the auspice of the _______.

Select one of the following:

  • World Wide Web Consortium

  • Free Software Foundation

  • Berkeley Software Distribution

  • GNU Public License

Explanation

Question 20 of 139

1

Both batch processing and time-sharing use multiprogramming.

Select one of the following:

  • True
  • False

Explanation

Question 21 of 139

1

If a system does not employ virtual memory each process to be executed must be fully loaded into main memory.

Select one of the following:

  • True
  • False

Explanation

Question 22 of 139

1

It is the principal responsibility of the ____ to control the execution of processes.

Select one of the following:

  • OS

  • process control block

  • memory

  • dispatcher

Explanation

Question 23 of 139

1

The ____ is the less-privileged mode.

Select one of the following:

  • user mode

  • kernel mode

  • system mode

  • control mode

Explanation

Question 24 of 139

1

The portion of the operating system that selects the next process to run is called the ____.

Select one of the following:

  • trace

  • process control block

  • dispatcher

  • PSW

Explanation

Question 25 of 139

1

The collection of program, data, stack, and attributes is referred to as the ____.

Select one of the following:

  • process structure

  • process control block

  • process location

  • process image

Explanation

Question 26 of 139

1

Fill the blank space to complete the text.

A process in the state is in main memory and available for execution.

Explanation

Question 27 of 139

1

The process control block is the least important data structure in an OS.

Select one of the following:

  • True
  • False

Explanation

Question 28 of 139

1

When a process is in the ____ state it is in secondary memory but is available for execution as soon as it is loaded into main memory.

Select one of the following:

  • Blocked

  • Blocked/Suspend

  • Ready

  • Ready/Suspend

Explanation

Question 29 of 139

1

A total of ____ process states are recognized by the UNIX SVR4 operating system.

Select one of the following:

  • 3

  • 9

  • 21

  • 15

Explanation

Question 30 of 139

1

The principal function of the OS is to create, manage, and terminate processes.

Select one of the following:

  • True
  • False

Explanation

Question 31 of 139

1

In a multithreaded environment, a _____ is defined as the unit of resource allocation and a unit of protection.

Select one of the following:

  • strand

  • process

  • string

  • trace

Explanation

Question 32 of 139

1

_____ is a good example of an OS using a combined ULT/KLT approach.

Select one of the following:

  • TRIX

  • Windows

  • LINUX

  • Solaris

Explanation

Question 33 of 139

1

A ____ is a user-created unit of execution within a process.

Select one of the following:

  • Kernel

  • KLT

  • lightweight process

  • ULT

Explanation

Question 34 of 139

1

The _____ are the fundamental entities that can be scheduled and dispatched to run on one of the system processors.

Select one of the following:

  • Processes

  • Kernel threads

  • LWPs

  • ULTs

Explanation

Question 35 of 139

1

A ____ is a dispatchable unit of work that executes sequentially and is interruptible so that the processor can turn to another thread.

Select one of the following:

  • port

  • process

  • token

  • thread

Explanation

Question 36 of 139

1

A Windows process must contain at least ___ thread(s) to execute.

Select one of the following:

  • four

  • three

  • two

  • one

Explanation

Question 37 of 139

1

It takes less time to terminate a process than a thread.

Select one of the following:

  • True
  • False

Explanation

Question 38 of 139

1

The blocked state in which the process is waiting for an event, such as the end of an I/O operation, the availability of a resource, or a signal from another process is the ____ state.

Select one of the following:

  • Times and timers

  • Uninterruptible

  • Stopped

  • Interruptible

Explanation

Question 39 of 139

1

The ____ state is when the thread has terminated.

Select one of the following:

  • ZOMBIE

  • FREE

  • STOP

  • SLEEP

Explanation

Question 40 of 139

1

Any alteration of a resource by one thread affects the environment of the other threads in the same process.

Select one of the following:

  • True
  • False

Explanation

Question 41 of 139

1

As an extension of the principles of modular design and structured programming, some applications can be effectively programmed as a set of concurrent processes.

Select one of the following:

  • True
  • False

Explanation

Question 42 of 139

1

A situation in which a runnable process is overlooked indefinitely by the scheduler, although it is able to proceed, is _____.

Select one of the following:

  • mutual exclusion

  • deadlock

  • starvation

  • livelock

Explanation

Question 43 of 139

1

A semaphore that does not specify the order in which processes are removed from the queue is a _____ semaphore.

Select one of the following:

  • weak

  • general

  • strong

  • binary

Explanation

Question 44 of 139

1

A ____ is a data type that is used to block a process or thread until a particular condition is true.

Select one of the following:

  • deadlock

  • general semaphore

  • condition variable

  • mutex

Explanation

Question 45 of 139

1

The _____ is a programming language construct that provides equivalent functionality to that of semaphores and is easier to control.

Select one of the following:

  • atomic operation

  • co-routine

  • critical section

  • monitor

Explanation

Question 46 of 139

1

The requirement that when one process is in a critical section that accesses shared resources, no other process may be in a critical section that accesses any of those shared resources is ____.

Select one of the following:

  • critical section

  • linelock

  • mutual exclusion

  • atomic operation

Explanation

Question 47 of 139

1

The sharing of main memory among processes is useful to permit efficient and close interaction among processes because such sharing does not lead to any problems.

Select one of the following:

  • True
  • False

Explanation

Question 48 of 139

1

The case of cooperation by sharing covers processes that interact with other processes without being explicitly aware of them.

Select one of the following:

  • True
  • False

Explanation

Question 49 of 139

1

The management of multiple processes within a uniprocessor system is ___.

Select one of the following:

  • multiprogramming

  • structured applications

  • disturbed processing

  • multi-management processing

Explanation

Question 50 of 139

1

The term ____ refers to a technique in which a process can do nothing until it gets permission to enter its critical section but continues to execute an instruction or set of instructions that tests the appropriate variable to gain entrance.

Select one of the following:

  • spin waiting

  • general semaphore

  • critical resource

  • message passing

Explanation

Question 51 of 139

1

The most common technique used for protecting a critical section in Linux is the _____.

Select one of the following:

  • singal

  • atomic bitmap operation

  • atomic integer operation

  • spinlock

Explanation

Question 52 of 139

1

Interrupts, signals, messages, and information in I/O buffers are all example of reusable resources.

Select one of the following:

  • True
  • False

Explanation

Question 53 of 139

1

Requested resources are granted to processes whenever possible with _____.

Select one of the following:

  • deadlock detection

  • preemption

  • mutual exclusion

  • deadlock avoidance

Explanation

Question 54 of 139

1

The ____ allows multiple threads to have simultaneous read-only access to an object protected by the lock.

Select one of the following:

  • barrier

  • condition variable

  • readers/writer lock

  • mutex

Explanation

Question 55 of 139

1

Examples of ___ include processors, I/O channels, main and secondary memory, devices, and data structures such as files, databases, and semaphores.

Select one of the following:

  • regional resources

  • joint resources

  • reusable resources

  • consumable resources

Explanation

Question 56 of 139

1

A closed chain of processes exists, such that each process holds at least one resource needed by the next process in the chain is the condition of ____.

Select one of the following:

  • no preemption

  • mutual exclusion

  • circular wait

  • hold and wait

Explanation

Question 57 of 139

1

The strategy of deadlock ____ is to design a system in such a way that the possibility of deadlock is excluded.

Select one of the following:

  • prevention

  • detection

  • diversion

  • avoidance

Explanation

Question 58 of 139

1

One of the most significant contributions of UNIX to the development of operating systems is the ____.

Select one of the following:

  • semaphore

  • pipe

  • message

  • shared memory

Explanation

Question 59 of 139

1

Deadlock is permanent because none of the events are ever triggered.

Select one of the following:

  • True
  • False

Explanation

Question 60 of 139

1

The fastest form of inter-process communication provided in UNIX is ____.

Select one of the following:

  • shared memory

  • message

  • pipe

  • semaphore

Explanation

Question 61 of 139

1

In a multiprogramming system the available main memory is not generally shared among a number of processes.

Select one of the following:

  • True
  • False

Explanation

Question 62 of 139

1

A ____ is a particular example of logical addresses in which the address is expressed as a location relative to some known point, usually a value in a processor register.

Select one of the following:

  • logical address

  • relative address

  • absolute address

  • physical address

Explanation

Question 63 of 139

1

The page table for each process maintains ____.

Select one of the following:

  • the physical memory location of the process

  • the frame location for each page of the process

  • the page location for each frame of the process

  • the logical memory location of the process

Explanation

Question 64 of 139

1

In a system employing a segmentation scheme for memory management a process is divided into ___

Select one of the following:

  • one segment per thread

  • a number of threads

  • a number of segments which need not be of equal size

  • a number of segments which must be of equal size

Explanation

Question 65 of 139

1

Available chunks of memory are known as ____.

Select one of the following:

  • frames

  • segments

  • addresses

  • pages

Explanation

Question 66 of 139

1

In a multiprogramming environment the programmer knows at the time of coding how much space will be available and where that space will be.

Select one of the following:

  • True
  • False

Explanation

Question 67 of 139

1

In a system employing a segmentation scheme for memory management wasted space is due to _____.

Select one of the following:

  • frames of different sizes

  • external fragmentation

  • internal fragmentation

  • segments of different sizes

Explanation

Question 68 of 139

1

In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and choose the next available block that is large enough to satisfy the request is called _____>

Select one of the following:

  • next-fit

  • first-fit

  • last-fit

  • best-fit

Explanation

Question 69 of 139

1

In a system employing a paging scheme for memory management wasted space is due to _____.

Select one of the following:

  • internal fragmentation

  • pages of different specified sizes

  • external fragmentation

  • frames of different specified sizes

Explanation

Question 70 of 139

1

One technique for overcoming external fragmentation is ____.

Select one of the following:

  • loading

  • compaction

  • relocation

  • partitioning

Explanation

Question 71 of 139

1

Segments may be of unequal, indeed dynamic, size.

Select one of the following:

  • True
  • False

Explanation

Question 72 of 139

1

A ____ is issued if a desired page is not in main memory.

Select one of the following:

  • paging error

  • paging replacement policy

  • page fault

  • page placement policy

Explanation

Question 73 of 139

1

The ____ determines when a page should be brought into main memory.

Select one of the following:

  • page fault

  • fetch policy

  • working set

  • resident set management

Explanation

Question 74 of 139

1

The ____ policy results in the fewest number of page faults.

Select one of the following:

  • optimal

  • FIFO

  • clock

  • LRU

Explanation

Question 75 of 139

1

The ____ algorithm requires a use bit to be associated with each page in memory.

Select one of the following:

  • page placement

  • working set

  • VSWS

  • page fault frequency

Explanation

Question 76 of 139

1

The ____ structure indexes page table entries by frame number rather than by virtual page number.

Select one of the following:

  • hash table

  • inverted page table

  • page table

  • segment table

Explanation

Question 77 of 139

1

The principle of locality states that program and data references within a process do not tend to cluster.

Select one of the following:

  • True
  • False

Explanation

Question 78 of 139

1

______ is transparent to the programmer and eliminates external fragmentation providing efficient use of main memory.

Select one of the following:

  • Hashing

  • Paging

  • Segemention

  • Thrashing

Explanation

Question 79 of 139

1

____ is a range memory addresses available to a process.

Select one of the following:

  • Address space

  • Real address

  • Virtual address

  • Virtual address space

Explanation

Question 80 of 139

1

____ allows the programmer to view memory as consisting of multiple address spaces.

Select one of the following:

  • Paging

  • Locality

  • Segmentation

  • Resident set managment

Explanation

Question 81 of 139

1

Which of the following scheduling policies allow the OS to interrupt the currently running process and move it to the Ready state?

Select one of the following:

  • FIFO

  • FCFS

  • non-preemptive

  • preemptive

Explanation

Question 82 of 139

1

The strategy that schedules processes based on their group affiliation is generally referred to as ______.

Select one of the following:

  • shortest process next

  • fair share scheduling

  • queuing analysis

  • simulation modeling

Explanation

Question 83 of 139

1

The ____ specifies the instants in time at which the selection function is exercised.

Select one of the following:

  • decision mode

  • medium-term scheduling

  • ready state

  • TAT

Explanation

Question 84 of 139

1

This is a decision whether to add a process to those that are at least partially in main memory and therefore available for execution.

Select one of the following:

  • short-term scheduling

  • long-term scheduling

  • medium-term scheduling

  • I/O scheduling

Explanation

Question 85 of 139

1

Typically, the swapping-in function for processes is based on the need to manage ____.

Select one of the following:

  • the degree of multiprogramming

  • I/O requirements

  • process priorities

  • virtual memory

Explanation

Question 86 of 139

1

Response time in an interactive system is an example of:

Select one of the following:

  • user-oriented criteria for long-term scheduling policies

  • system-oriented criteria for short-term scheduling policies

  • system-oriented criteria for long-term scheduling policies

  • user-oriented criteria for short-term scheduling policies

Explanation

Question 87 of 139

1

A risk with ____ is the possibility of starvation for longer processes, as long as there is a steady supply of shorter processes.

Select one of the following:

  • SRT

  • SPN

  • FIFO

  • FCFS

Explanation

Question 88 of 139

1

First-come-first-served (FCFS) is a simple scheduling policy that tends to favor I/O bound processes over processor bound processes.

Select one of the following:

  • True
  • False

Explanation

Question 89 of 139

1

The traditional UNIX scheduler divides processes into fixed bands of priority levels, with the highest priority band being the ____.

Select one of the following:

  • user process band

  • swapper band

  • file manipulation band

  • utilization band

Explanation

Question 90 of 139

1

One problem with a pure priority scheduling scheme is that lower-priority processes may suffer starvation.

Select one of the following:

  • True
  • False

Explanation

Question 91 of 139

1

The multiprocessor system which consists of a set or processors that share a common main memory and are under the integrated control of an operation system is a _____.

Select one of the following:

  • tightly coupled multiprocessor

  • cluster

  • functionally specialized processor

  • loosely coupled or distributed multiprocessor

Explanation

Question 92 of 139

1

_____ perform static analysis of feasible schedules of dispatching with the result of the analysis being a schedule that determines, at run time, when a task must begin execution.

Select one of the following:

  • Static priority-driven preemptive approaches

  • Static table-drive approaches

  • Dynamic planning-based approaches

  • Dynamic best effort approaches

Explanation

Question 93 of 139

1

The basic idea of _____ is that a lower-priority task inherits the priority of any higher-priority task pending on a resource they share.

Select one of the following:

  • priority ceiling

  • priority inversion

  • unbounded priority inversion

  • priority inheritance

Explanation

Question 94 of 139

1

User control is a generally much broader in an ordinary operating system than in a real-time operating system.

Select one of the following:

  • True
  • False

Explanation

Question 95 of 139

1

With coarse and ____ grained parallelism, there is a synchronization among processes, but at a very gross level.

Select one of the following:

  • medium

  • fine

  • independent

  • very course

Explanation

Question 96 of 139

1

The ____ approach is a set of related threads scheduled to run on a set of processors at the same time, on a one-to-one basis.

Select one of the following:

  • dynamic scheduling

  • load sharing

  • gang scheduling

  • dedicated processor assignment

Explanation

Question 97 of 139

1

The ____ class is intended for applications that will only consume processor time when no other threads are ready to execute.

Select one of the following:

  • idle user

  • time sharing

  • bottom-half kernel

  • real-time

Explanation

Question 98 of 139

1

______ is the time required to execute the task to completion.

Select one of the following:

  • Processing time

  • Priority

  • Resource requirements

  • Ready time

Explanation

Question 99 of 139

1

Processes at ____ priority levels are guaranteed to be selected to run before any time-sharing process but must defer to real-time processes.

Select one of the following:

  • kernel

  • time-sharing

  • real-time

  • load-sharing

Explanation

Question 100 of 139

1

With independent parallelism there is an explicit synchronization among processes.

Select one of the following:

  • True
  • False

Explanation

Question 101 of 139

1

The advantage of ____ is that it provides extremely high data availability.

Select one of the following:

  • RAID 2

  • RAID 4

  • RAID 0

  • RAID 6

Explanation

Question 102 of 139

1

On a movable-head system, the time it takes to position the head at the track is known as

Select one of the following:

  • access time

  • seek time

  • transfer time

  • rotational delay

Explanation

Question 103 of 139

1

The disk scheduling algorithm that implements two sub-queues in a measure to avoid the problem of "arm stickiness" is the ______.

Select one of the following:

  • C-SCAN policy

  • FSCAN policy

  • DMA

  • N-step-SCAN policy

Explanation

Question 104 of 139

1

_____ external devices are suitable for communicating with modems.

Select one of the following:

  • Human-readable

  • Application

  • Machine-readable

  • Communication

Explanation

Question 105 of 139

1

The simplest type of support that the operating system can provide is _____.

Select one of the following:

  • overflow buffering

  • dual buffering

  • single buffering

  • circular buffering

Explanation

Question 106 of 139

1

Cache memory reduces average memory access time by exploiting the principle of locality.

Select one of the following:

  • True
  • False

Explanation

Question 107 of 139

1

RAID 0 provides real-time backups of all data so that in the event of a disk failure, all of the critical data is still immediately available.

Select one of the following:

  • True
  • False

Explanation

Question 108 of 139

1

_____ is a technique that smooths out peaks in I/O demand.

Select one of the following:

  • Buffering

  • Blocking

  • Smoothing

  • Tracking

Explanation

Question 109 of 139

1

The _____ unit is capable of mimicking the processor and of taking over control of the system bus, just like a processor.

Select one of the following:

  • interrupt-driven I/O

  • I/O channel

  • direct memory access

  • programmed I/O

Explanation

Question 110 of 139

1

RAID 5 is organized in a similar fashion to _____, but is different in the fact that RAID 5 distributes the parity strips across all disks.

Select one of the following:

  • RAID 3

  • RAID 2

  • RAID 1

  • RAID 4

Explanation

Question 111 of 139

1

Typically, the only way that a user or application may access files is through the file management system.

Select one of the following:

  • True
  • False

Explanation

Question 112 of 139

1

_____ represents an open file associated with a process.

Select one of the following:

  • Dentry object

  • Inode object

  • File object

  • Superblock object

Explanation

Question 113 of 139

1

An objective of the ____ is to provide a standardized set of I/O interface routines to user processes.

Select one of the following:

  • working directory

  • file management system

  • indexed file allocation

  • file directory

Explanation

Question 114 of 139

1

The ____ is concerned with scheduling disk and tape access to optimize performance.

Select one of the following:

  • device driver

  • basic I/O supervisor

  • access method

  • logical I/O

Explanation

Question 115 of 139

1

The ____ file exploits the capability found on disks to access directly any block of a known address.

Select one of the following:

  • direct

  • sequential

  • indexed sequential

  • indexed

Explanation

Question 116 of 139

1

All types of UNIX files are administered by the OS by means of inodes.

Select one of the following:

  • True
  • False

Explanation

Question 117 of 139

1

The least-complicated form of file organization is the indexed file.

Select one of the following:

  • True
  • False

Explanation

Question 118 of 139

1

The ____ contains the core parts of the operating system, including system binaries, system libraries, and configuration files.

Select one of the following:

  • data directory

  • system directory

  • cache directory

  • mnt/sdcard directory

Explanation

Question 119 of 139

1

A ____ is a contiguous set of allocated blocks.

Select one of the following:

  • key

  • pathname

  • pile

  • portion

Explanation

Question 120 of 139

1

A ___ is the basic element of data.

Select one of the following:

  • database

  • field

  • file

  • record

Explanation

Question 121 of 139

1

General-purpose computer systems far outnumber embedded systems.

Select one of the following:

  • True
  • False

Explanation

Question 122 of 139

1

The ____ module contains the code necessary for processor startup, interrupt delivery, context switching, and other functionality specific to the instruction set architecture of that processor family.

Select one of the following:

  • Variant

  • Platform

  • Memory Management

  • Architechture

Explanation

Question 123 of 139

1

The ____ module includes code for startup, chip selection configuration, interrupt controllers, and timer devices.

Select one of the following:

  • Architechture

  • Variant

  • MMU

  • Platform

Explanation

Question 124 of 139

1

Configurability, direct use of interrupts, and real-time operation are some of the unique characteristics and design requirements for ______/

Select one of the following:

  • Tiny OS

  • eCos

  • embedded operating systems

  • OS service routines

Explanation

Question 125 of 139

1

______ is one of the most widely used embedded operating systems.

Select one of the following:

  • Resource-specific interfaces

  • eCos

  • open sources

  • resource requests

Explanation

Question 126 of 139

1

A key differentiator between desktop/server and embedded Linux distributions is that desktop and server software are typically compiled on one platform but is intended to be executed on another.

Select one of the following:

  • True
  • False

Explanation

Question 127 of 139

1

The _____ interface allows the client to hold on to a resource until the client is notified that someone else needs the resource.

Select one of the following:

  • Resource configure

  • Resource requested

  • Resource

  • Resource-specific

Explanation

Question 128 of 139

1

A mutex is used to enforce mutually exclusive access to a resource, allowing only one thread at a time to gain access.

Select one of the following:

  • True
  • False

Explanation

Question 129 of 139

1

_____ has become a popular approach to implementing wireless sensor network software.

Select one of the following:

  • TinyOS

  • eCos

  • Embedded system

  • Arbiter

Explanation

Question 130 of 139

1

Virtual machines are made up of files.

Select one of the following:

  • True
  • False

Explanation

Question 131 of 139

1

The solution that enables virtualization is a ____.

Select one of the following:

  • round robin

  • virtual machine monitor

  • hyperfile

  • DalviB600

Explanation

Question 132 of 139

1

The ___ facilitates the translation and I/O from the virtual machine to the physical server devices.

Select one of the following:

  • hardware

  • memory

  • hypervisor

  • network interface card

Explanation

Question 133 of 139

1

_____ can power off and on physical hosts as they are needed.

Select one of the following:

  • DRS

  • Storage and Network I/O

  • DPM

  • Resource Scheduler

Explanation

Question 134 of 139

1

The number of guests that can exist on a single hosts is measured as a _____.

Select one of the following:

  • VMM ratio

  • hypervisor ration

  • broker ratio

  • consolidation ratio

Explanation

Question 135 of 139

1

The ____ approach is becoming a common way for businesses and individuals to deal with legacy applications and to optimize their hardware usage.

Select one of the following:

  • virtual machine

  • consolidation

  • ratio

  • round robin

Explanation

Question 136 of 139

1

Virtual machines are hosted via the infrastructure services in the VM kernel.

Select one of the following:

  • True
  • False

Explanation

Question 137 of 139

1

______ is a commercially available hypervisor from VMware that provides users a bare metal hypervisor to host virtal machines on their servers.

Select one of the following:

  • Zygote

  • Dalvi068

  • JVM

  • ESXi

Explanation

Question 138 of 139

1

A key aspect of server virtualization is that VMs cannot be viewed as network resources.

Select one of the following:

  • True
  • False

Explanation

Question 139 of 139

1

The concept of ____, as used in Linux, refers to a partitioning of the privileges available to a root user.

Select one of the following:

  • root isolation

  • hosting platform

  • capabilities

  • processing isolation

Explanation