Copy and Edit

OS Final Possible Questions

Description

Information Technology Quiz on OS Final Possible Questions, created by Matt Merritt on 01/05/2017.
Matt Merritt
Quiz by Matt Merritt, updated more than 1 year ago
Matt Merritt
Created by Matt Merritt almost 7 years ago
81
1
0

Resource summary

Question 1

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

Question 2

Question
Over the years memory access speed has consistently increased more rapidly than processor speed.
Answer
  • True
  • False

Question 3

Question
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.
Answer
  • memory controller
  • mapping function
  • write policy
  • replacement algorithm

Question 4

Question
When an external device becomes ready to be serviced by the processor, the device sends a(n) ___ signal to the processor.
Answer
  • access
  • halt
  • handler
  • interrupt

Question 5

Question
The ____ holds the address of the next instruction.
Answer
  • Accumulator (AC)
  • Instruction Register (IR)
  • Instruction Counter (IC)
  • Program Counter (PC)

Question 6

Question
Small, fast memory located between the processor and main memory is called ____.
Answer
  • Block memory
  • Cache memory
  • Direct memory
  • WORM memory

Question 7

Question
One mechanism Intel uses to make its caches more effective is _______.
Answer
  • mapping
  • handling
  • interconnecting
  • prefetching

Question 8

Question
In a uniprocessor system, multiprogramming increases processor efficiency by _____.
Answer
  • 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

Question 9

Question
The processor controls the operation of the computer and performs its data processing functions.
Answer
  • True
  • False

Question 10

Question
Instruction processing consists of two steps:
Answer
  • fetch and execute
  • instruction and execute
  • instruction and halt
  • fetch and instruction

Question 11

Question
The ____ is the external data by which the OS is able to supervise and control the process.
Answer
  • execution context
  • associated data
  • executable program
  • nucleus

Question 12

Question
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.
Answer
  • True
  • False

Question 13

Question
Multiprogramming operating systems are fairly sophisticated compared to single-program or _____ systems.
Answer
  • time-sharing
  • uniprogramming
  • multitasking
  • memory management

Question 14

Question
Hardware features desirable in a batch-processing OS include memory protection, timer, privileged instructions and ______.
Answer
  • clock cycles
  • associated data
  • interrupts
  • kernels

Question 15

Question
• A common strategy to give each process in the queue some time in turn is referred to as a _____ technique.
Answer
  • multi-threading
  • serial processing
  • time slicing
  • round-robin

Question 16

Question
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 _____.
Answer
  • clock cycle
  • time slicing
  • round-robin
  • multithreading

Question 17

Question
______ is where the OS must prevent independent processes from interfering with each other’s memory, both data and instructions.
Answer
  • Protection and access control
  • Support of modular programming
  • Process isolation
  • Automatic allocation and management

Question 18

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

Question 19

Question
The key to success of Linux has been its availability for free under the auspice of the _______.
Answer
  • World Wide Web Consortium
  • Free Software Foundation
  • Berkeley Software Distribution
  • GNU Public License

Question 20

Question
Both batch processing and time-sharing use multiprogramming.
Answer
  • True
  • False

Question 21

Question
If a system does not employ virtual memory each process to be executed must be fully loaded into main memory.
Answer
  • True
  • False

Question 22

Question
It is the principal responsibility of the ____ to control the execution of processes.
Answer
  • OS
  • process control block
  • memory
  • dispatcher

Question 23

Question
The ____ is the less-privileged mode.
Answer
  • user mode
  • kernel mode
  • system mode
  • control mode

Question 24

Question
The portion of the operating system that selects the next process to run is called the ____.
Answer
  • trace
  • process control block
  • dispatcher
  • PSW

Question 25

Question
The collection of program, data, stack, and attributes is referred to as the ____.
Answer
  • process structure
  • process control block
  • process location
  • process image

Question 26

Question
A process in the [blank_start]ready[blank_end] state is in main memory and available for execution.
Answer
  • ready

Question 27

Question
The process control block is the least important data structure in an OS.
Answer
  • True
  • False

Question 28

Question
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.
Answer
  • Blocked
  • Blocked/Suspend
  • Ready
  • Ready/Suspend

Question 29

Question
A total of ____ process states are recognized by the UNIX SVR4 operating system.
Answer
  • 3
  • 9
  • 21
  • 15

Question 30

Question
The principal function of the OS is to create, manage, and terminate processes.
Answer
  • True
  • False

Question 31

Question
In a multithreaded environment, a _____ is defined as the unit of resource allocation and a unit of protection.
Answer
  • strand
  • process
  • string
  • trace

Question 32

Question
_____ is a good example of an OS using a combined ULT/KLT approach.
Answer
  • TRIX
  • Windows
  • LINUX
  • Solaris

Question 33

Question
A ____ is a user-created unit of execution within a process.
Answer
  • Kernel
  • KLT
  • lightweight process
  • ULT

Question 34

Question
The _____ are the fundamental entities that can be scheduled and dispatched to run on one of the system processors.
Answer
  • Processes
  • Kernel threads
  • LWPs
  • ULTs

Question 35

Question
A ____ is a dispatchable unit of work that executes sequentially and is interruptible so that the processor can turn to another thread.
Answer
  • port
  • process
  • token
  • thread

Question 36

Question
A Windows process must contain at least ___ thread(s) to execute.
Answer
  • four
  • three
  • two
  • one

Question 37

Question
It takes less time to terminate a process than a thread.
Answer
  • True
  • False

Question 38

Question
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.
Answer
  • Times and timers
  • Uninterruptible
  • Stopped
  • Interruptible

Question 39

Question
The ____ state is when the thread has terminated.
Answer
  • ZOMBIE
  • FREE
  • STOP
  • SLEEP

Question 40

Question
Any alteration of a resource by one thread affects the environment of the other threads in the same process.
Answer
  • True
  • False

Question 41

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

Question 42

Question
A situation in which a runnable process is overlooked indefinitely by the scheduler, although it is able to proceed, is _____.
Answer
  • mutual exclusion
  • deadlock
  • starvation
  • livelock

Question 43

Question
A semaphore that does not specify the order in which processes are removed from the queue is a _____ semaphore.
Answer
  • weak
  • general
  • strong
  • binary

Question 44

Question
A ____ is a data type that is used to block a process or thread until a particular condition is true.
Answer
  • deadlock
  • general semaphore
  • condition variable
  • mutex

Question 45

Question
The _____ is a programming language construct that provides equivalent functionality to that of semaphores and is easier to control.
Answer
  • atomic operation
  • co-routine
  • critical section
  • monitor

Question 46

Question
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 ____.
Answer
  • critical section
  • linelock
  • mutual exclusion
  • atomic operation

Question 47

Question
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.
Answer
  • True
  • False

Question 48

Question
The case of cooperation by sharing covers processes that interact with other processes without being explicitly aware of them.
Answer
  • True
  • False

Question 49

Question
The management of multiple processes within a uniprocessor system is ___.
Answer
  • multiprogramming
  • structured applications
  • disturbed processing
  • multi-management processing

Question 50

Question
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.
Answer
  • spin waiting
  • general semaphore
  • critical resource
  • message passing

Question 51

Question
The most common technique used for protecting a critical section in Linux is the _____.
Answer
  • singal
  • atomic bitmap operation
  • atomic integer operation
  • spinlock

Question 52

Question
Interrupts, signals, messages, and information in I/O buffers are all example of reusable resources.
Answer
  • True
  • False

Question 53

Question
Requested resources are granted to processes whenever possible with _____.
Answer
  • deadlock detection
  • preemption
  • mutual exclusion
  • deadlock avoidance

Question 54

Question
The ____ allows multiple threads to have simultaneous read-only access to an object protected by the lock.
Answer
  • barrier
  • condition variable
  • readers/writer lock
  • mutex

Question 55

Question
Examples of ___ include processors, I/O channels, main and secondary memory, devices, and data structures such as files, databases, and semaphores.
Answer
  • regional resources
  • joint resources
  • reusable resources
  • consumable resources

Question 56

Question
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 ____.
Answer
  • no preemption
  • mutual exclusion
  • circular wait
  • hold and wait

Question 57

Question
The strategy of deadlock ____ is to design a system in such a way that the possibility of deadlock is excluded.
Answer
  • prevention
  • detection
  • diversion
  • avoidance

Question 58

Question
One of the most significant contributions of UNIX to the development of operating systems is the ____.
Answer
  • semaphore
  • pipe
  • message
  • shared memory

Question 59

Question
Deadlock is permanent because none of the events are ever triggered.
Answer
  • True
  • False

Question 60

Question
The fastest form of inter-process communication provided in UNIX is ____.
Answer
  • shared memory
  • message
  • pipe
  • semaphore

Question 61

Question
In a multiprogramming system the available main memory is not generally shared among a number of processes.
Answer
  • True
  • False

Question 62

Question
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.
Answer
  • logical address
  • relative address
  • absolute address
  • physical address

Question 63

Question
The page table for each process maintains ____.
Answer
  • 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

Question 64

Question
In a system employing a segmentation scheme for memory management a process is divided into ___
Answer
  • 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

Question 65

Question
Available chunks of memory are known as ____.
Answer
  • frames
  • segments
  • addresses
  • pages

Question 66

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

Question 67

Question
In a system employing a segmentation scheme for memory management wasted space is due to _____.
Answer
  • frames of different sizes
  • external fragmentation
  • internal fragmentation
  • segments of different sizes

Question 68

Question
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 _____>
Answer
  • next-fit
  • first-fit
  • last-fit
  • best-fit

Question 69

Question
In a system employing a paging scheme for memory management wasted space is due to _____.
Answer
  • internal fragmentation
  • pages of different specified sizes
  • external fragmentation
  • frames of different specified sizes

Question 70

Question
One technique for overcoming external fragmentation is ____.
Answer
  • loading
  • compaction
  • relocation
  • partitioning

Question 71

Question
Segments may be of unequal, indeed dynamic, size.
Answer
  • True
  • False

Question 72

Question
A ____ is issued if a desired page is not in main memory.
Answer
  • paging error
  • paging replacement policy
  • page fault
  • page placement policy

Question 73

Question
The ____ determines when a page should be brought into main memory.
Answer
  • page fault
  • fetch policy
  • working set
  • resident set management

Question 74

Question
The ____ policy results in the fewest number of page faults.
Answer
  • optimal
  • FIFO
  • clock
  • LRU

Question 75

Question
The ____ algorithm requires a use bit to be associated with each page in memory.
Answer
  • page placement
  • working set
  • VSWS
  • page fault frequency

Question 76

Question
The ____ structure indexes page table entries by frame number rather than by virtual page number.
Answer
  • hash table
  • inverted page table
  • page table
  • segment table

Question 77

Question
The principle of locality states that program and data references within a process do not tend to cluster.
Answer
  • True
  • False

Question 78

Question
______ is transparent to the programmer and eliminates external fragmentation providing efficient use of main memory.
Answer
  • Hashing
  • Paging
  • Segemention
  • Thrashing

Question 79

Question
____ is a range memory addresses available to a process.
Answer
  • Address space
  • Real address
  • Virtual address
  • Virtual address space

Question 80

Question
____ allows the programmer to view memory as consisting of multiple address spaces.
Answer
  • Paging
  • Locality
  • Segmentation
  • Resident set managment

Question 81

Question
Which of the following scheduling policies allow the OS to interrupt the currently running process and move it to the Ready state?
Answer
  • FIFO
  • FCFS
  • non-preemptive
  • preemptive

Question 82

Question
The strategy that schedules processes based on their group affiliation is generally referred to as ______.
Answer
  • shortest process next
  • fair share scheduling
  • queuing analysis
  • simulation modeling

Question 83

Question
The ____ specifies the instants in time at which the selection function is exercised.
Answer
  • decision mode
  • medium-term scheduling
  • ready state
  • TAT

Question 84

Question
This is a decision whether to add a process to those that are at least partially in main memory and therefore available for execution.
Answer
  • short-term scheduling
  • long-term scheduling
  • medium-term scheduling
  • I/O scheduling

Question 85

Question
Typically, the swapping-in function for processes is based on the need to manage ____.
Answer
  • the degree of multiprogramming
  • I/O requirements
  • process priorities
  • virtual memory

Question 86

Question
Response time in an interactive system is an example of:
Answer
  • 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

Question 87

Question
A risk with ____ is the possibility of starvation for longer processes, as long as there is a steady supply of shorter processes.
Answer
  • SRT
  • SPN
  • FIFO
  • FCFS

Question 88

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

Question 89

Question
The traditional UNIX scheduler divides processes into fixed bands of priority levels, with the highest priority band being the ____.
Answer
  • user process band
  • swapper band
  • file manipulation band
  • utilization band

Question 90

Question
One problem with a pure priority scheduling scheme is that lower-priority processes may suffer starvation.
Answer
  • True
  • False

Question 91

Question
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 _____.
Answer
  • tightly coupled multiprocessor
  • cluster
  • functionally specialized processor
  • loosely coupled or distributed multiprocessor

Question 92

Question
_____ 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.
Answer
  • Static priority-driven preemptive approaches
  • Static table-drive approaches
  • Dynamic planning-based approaches
  • Dynamic best effort approaches

Question 93

Question
The basic idea of _____ is that a lower-priority task inherits the priority of any higher-priority task pending on a resource they share.
Answer
  • priority ceiling
  • priority inversion
  • unbounded priority inversion
  • priority inheritance

Question 94

Question
User control is a generally much broader in an ordinary operating system than in a real-time operating system.
Answer
  • True
  • False

Question 95

Question
With coarse and ____ grained parallelism, there is a synchronization among processes, but at a very gross level.
Answer
  • medium
  • fine
  • independent
  • very course

Question 96

Question
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.
Answer
  • dynamic scheduling
  • load sharing
  • gang scheduling
  • dedicated processor assignment

Question 97

Question
The ____ class is intended for applications that will only consume processor time when no other threads are ready to execute.
Answer
  • idle user
  • time sharing
  • bottom-half kernel
  • real-time

Question 98

Question
______ is the time required to execute the task to completion.
Answer
  • Processing time
  • Priority
  • Resource requirements
  • Ready time

Question 99

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

Question 100

Question
With independent parallelism there is an explicit synchronization among processes.
Answer
  • True
  • False

Question 101

Question
The advantage of ____ is that it provides extremely high data availability.
Answer
  • RAID 2
  • RAID 4
  • RAID 0
  • RAID 6

Question 102

Question
On a movable-head system, the time it takes to position the head at the track is known as
Answer
  • access time
  • seek time
  • transfer time
  • rotational delay

Question 103

Question
The disk scheduling algorithm that implements two sub-queues in a measure to avoid the problem of "arm stickiness" is the ______.
Answer
  • C-SCAN policy
  • FSCAN policy
  • DMA
  • N-step-SCAN policy

Question 104

Question
_____ external devices are suitable for communicating with modems.
Answer
  • Human-readable
  • Application
  • Machine-readable
  • Communication

Question 105

Question
The simplest type of support that the operating system can provide is _____.
Answer
  • overflow buffering
  • dual buffering
  • single buffering
  • circular buffering

Question 106

Question
Cache memory reduces average memory access time by exploiting the principle of locality.
Answer
  • True
  • False

Question 107

Question
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.
Answer
  • True
  • False

Question 108

Question
_____ is a technique that smooths out peaks in I/O demand.
Answer
  • Buffering
  • Blocking
  • Smoothing
  • Tracking

Question 109

Question
The _____ unit is capable of mimicking the processor and of taking over control of the system bus, just like a processor.
Answer
  • interrupt-driven I/O
  • I/O channel
  • direct memory access
  • programmed I/O

Question 110

Question
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.
Answer
  • RAID 3
  • RAID 2
  • RAID 1
  • RAID 4

Question 111

Question
Typically, the only way that a user or application may access files is through the file management system.
Answer
  • True
  • False

Question 112

Question
_____ represents an open file associated with a process.
Answer
  • Dentry object
  • Inode object
  • File object
  • Superblock object

Question 113

Question
An objective of the ____ is to provide a standardized set of I/O interface routines to user processes.
Answer
  • working directory
  • file management system
  • indexed file allocation
  • file directory

Question 114

Question
The ____ is concerned with scheduling disk and tape access to optimize performance.
Answer
  • device driver
  • basic I/O supervisor
  • access method
  • logical I/O

Question 115

Question
The ____ file exploits the capability found on disks to access directly any block of a known address.
Answer
  • direct
  • sequential
  • indexed sequential
  • indexed

Question 116

Question
All types of UNIX files are administered by the OS by means of inodes.
Answer
  • True
  • False

Question 117

Question
The least-complicated form of file organization is the indexed file.
Answer
  • True
  • False

Question 118

Question
The ____ contains the core parts of the operating system, including system binaries, system libraries, and configuration files.
Answer
  • data directory
  • system directory
  • cache directory
  • mnt/sdcard directory

Question 119

Question
A ____ is a contiguous set of allocated blocks.
Answer
  • key
  • pathname
  • pile
  • portion

Question 120

Question
A ___ is the basic element of data.
Answer
  • database
  • field
  • file
  • record

Question 121

Question
General-purpose computer systems far outnumber embedded systems.
Answer
  • True
  • False

Question 122

Question
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.
Answer
  • Variant
  • Platform
  • Memory Management
  • Architechture

Question 123

Question
The ____ module includes code for startup, chip selection configuration, interrupt controllers, and timer devices.
Answer
  • Architechture
  • Variant
  • MMU
  • Platform

Question 124

Question
Configurability, direct use of interrupts, and real-time operation are some of the unique characteristics and design requirements for ______/
Answer
  • Tiny OS
  • eCos
  • embedded operating systems
  • OS service routines

Question 125

Question
______ is one of the most widely used embedded operating systems.
Answer
  • Resource-specific interfaces
  • eCos
  • open sources
  • resource requests

Question 126

Question
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.
Answer
  • True
  • False

Question 127

Question
The _____ interface allows the client to hold on to a resource until the client is notified that someone else needs the resource.
Answer
  • Resource configure
  • Resource requested
  • Resource
  • Resource-specific

Question 128

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

Question 129

Question
_____ has become a popular approach to implementing wireless sensor network software.
Answer
  • TinyOS
  • eCos
  • Embedded system
  • Arbiter

Question 130

Question
Virtual machines are made up of files.
Answer
  • True
  • False

Question 131

Question
The solution that enables virtualization is a ____.
Answer
  • round robin
  • virtual machine monitor
  • hyperfile
  • DalviB600

Question 132

Question
The ___ facilitates the translation and I/O from the virtual machine to the physical server devices.
Answer
  • hardware
  • memory
  • hypervisor
  • network interface card

Question 133

Question
_____ can power off and on physical hosts as they are needed.
Answer
  • DRS
  • Storage and Network I/O
  • DPM
  • Resource Scheduler

Question 134

Question
The number of guests that can exist on a single hosts is measured as a _____.
Answer
  • VMM ratio
  • hypervisor ration
  • broker ratio
  • consolidation ratio

Question 135

Question
The ____ approach is becoming a common way for businesses and individuals to deal with legacy applications and to optimize their hardware usage.
Answer
  • virtual machine
  • consolidation
  • ratio
  • round robin

Question 136

Question
Virtual machines are hosted via the infrastructure services in the VM kernel.
Answer
  • True
  • False

Question 137

Question
______ is a commercially available hypervisor from VMware that provides users a bare metal hypervisor to host virtal machines on their servers.
Answer
  • Zygote
  • Dalvi068
  • JVM
  • ESXi

Question 138

Question
A key aspect of server virtualization is that VMs cannot be viewed as network resources.
Answer
  • True
  • False

Question 139

Question
The concept of ____, as used in Linux, refers to a partitioning of the privileges available to a root user.
Answer
  • root isolation
  • hosting platform
  • capabilities
  • processing isolation
Show full summary Hide full summary

Want to create your own Quizzes for free with GoConqr? Learn more.

Similar

CCNA Security 210-260 IINS - Exam 3
Mike M
Application of technology in learning
Jeff Wall
Innovative Uses of Technology
John Marttila
Ch1 - The nature of IT Projects
mauricio5509
The Internet
Gee_0599
SQL Quiz
R M
CCNA Answers – CCNA Exam
Abdul Demir
Professional, Legal, and Ethical Issues in Information Security
mfundo.falteni
System Analysis
R A
Flash Cards Networks
JJ Pro Wrestler
EDUC260- Multimodal Literacies for a Digital Age
angelwoo2002
Browse Library