Question 1

________ scheduling is appropriate for online transaction-processing systems.

Accepted Answer

A)  FCFS 
B)  SSTF 
C)  C-LOOK 
D)  none of the above 
A)  FCFS 
B)  SSTF 
C)  C-LOOK 
D)  none of the above C

Question 2

Under C-SCAN scheduling, which the disk arm finishes sweeping from the outermost track to the innermost track, it ________.

Accepted Answer

A)  reverses direction 
B)  skips to the mid-range tracks 
C)  jumps back to the outermost track 
D)  services the next n requests using scan. 
A)  reverses direction 
B)  skips to the mid-range tracks 
C)  jumps back to the outermost track 
D)  services the next n requests using scan. C

Question 3

RAID level 1 ________ of all RAID levels.

Accepted Answer

A)  offers the best performance 
B)  is the most fault-tolerant 
C)  is the most popular 
D)  offers the highest total capacity 
A)  offers the best performance 
B)  is the most fault-tolerant 
C)  is the most popular 
D)  offers the highest total capacity B

Question 4

RAID level 3 performs ________ and incurs ________ storage overhead than RAID level 2

Accepted Answer

A)  better, more 
B)  worse, less 
C)  better, less 
D)  worse, more 
A)  better, more 
B)  worse, less 
C)  better, less 
D)  worse, more

Question 5

The C-LOOK algorithm reduces ________ compared to LOOK at the expense of ________.

Accepted Answer

A)  variance of response times, fairness 
B)  variance of response times, throughput 
C)  mean response time, throughput 
D)  throughput, variance of response times 
A)  variance of response times, fairness 
B)  variance of response times, throughput 
C)  mean response time, throughput 
D)  throughput, variance of response times

Question 6

The LOOK algorithm is based on the ________ strategy, but it eliminates unnecessary seeks when there are no more requests in the current direction.

Accepted Answer

A)  SCAN 
B)  SSTF 
C)  FCFS 
D)  F-SCAN 
A)  SCAN 
B)  SSTF 
C)  FCFS 
D)  F-SCAN

Question 7

Recently, disk capacities have ________, access times have ________ and cost per unit storage has ________.

Accepted Answer

A)  increased, decreased exponentially, decreased exponentially 
B)  increased asymptotically, decreased, stayed the same 
C)  decreased, decreased, decreased 
D)  none of the above 
A)  increased, decreased exponentially, decreased exponentially 
B)  increased asymptotically, decreased, stayed the same 
C)  decreased, decreased, decreased 
D)  none of the above

Question 8

The letter "I" in RAID originally stood for ________, but has been revised to stand for ________.

Accepted Answer

A)  inexpensive, independent 
B)  interleaved, independent 
C)  independent, inexpensive 
D)  independent, interleaved 
A)  inexpensive, independent 
B)  interleaved, independent 
C)  independent, inexpensive 
D)  independent, interleaved

Question 9

Complex disk scheduling strategies are most appropriate ________.

Accepted Answer

A)  under all circumstances 
B)  for complex file organization structures 
C)  when accessing localized sequential files 
D)  under heavy system load 
A)  under all circumstances 
B)  for complex file organization structures 
C)  when accessing localized sequential files 
D)  under heavy system load

Question 10

RAID level 5 provides performance that ________.

Accepted Answer

A)  increases fault tolerance at the expense of capacity 
B)  improve capacity at the expense of fault tolerance 
C)  balances capacity and fault tolerance 
D)  depends on the presence a hardware controller 
A)  increases fault tolerance at the expense of capacity 
B)  improve capacity at the expense of fault tolerance 
C)  balances capacity and fault tolerance 
D)  depends on the presence a hardware controller

Question 11

RAID level 0 can increase performance ________.

Accepted Answer

A)  at the expense of capacity 
B)  but does not implement striping 
C)  but does not provide fault-tolerance 
D)  all of the above 
A)  at the expense of capacity 
B)  but does not implement striping 
C)  but does not provide fault-tolerance 
D)  all of the above

Question 12

Today's hard disks exhibit seek times that are ________ rotational latency times.

Accepted Answer

A)  much greater than 
B)  greater than 
C)  the same order of magnitude as 
D)  much smaller than 
A)  much greater than 
B)  greater than 
C)  the same order of magnitude as 
D)  much smaller than

Question 13

Access time is defined as ________ plus ________.

Accepted Answer

A)  seek time, positioning time 
B)  positioning time, transmission time 
C)  rotational latency, seek time 
D)  seek time, transmission time 
A)  seek time, positioning time 
B)  positioning time, transmission time 
C)  rotational latency, seek time 
D)  seek time, transmission time

Question 14

RAID level 1 ________.

Accepted Answer

A)  uses mirroring 
B)  can yield higher throughput for reads compared to writes 
C)  is the lowest "true" RAID level 
D)  all of the above 
A)  uses mirroring 
B)  can yield higher throughput for reads compared to writes 
C)  is the lowest "true" RAID level 
D)  all of the above

Question 15

________ caching flushes data to disk immediately, ensuring it cannot be lost in the event of a system failure.

Accepted Answer

A)  Write-back 
B)  Buffer 
C)  Write-through 
D)  Coherent 
A)  Write-back 
B)  Buffer 
C)  Write-through 
D)  Coherent

Question 16

Disk scheduling algorithms are designed to minimize ________ and/or ________, depending on the system's requests.

Accepted Answer

A)  seek time, rotational latency 
B)  seek latency, rotational time 
C)  request rate, turnaround time 
D)  none of the above 
A)  seek time, rotational latency 
B)  seek latency, rotational time 
C)  request rate, turnaround time 
D)  none of the above

Question 17

Compression can improve disk performance at the expense of ________.

Accepted Answer

A)  processor time 
B)  capacity 
C)  fault tolerance 
D)  data integrity 
A)  processor time 
B)  capacity 
C)  fault tolerance 
D)  data integrity

Question 18

Maximizing ________and minimizing ________can lead to increased ________.

Accepted Answer

A)  predictability, mean response time, rotational latency 
B)  throughput, mean response time, variance of response times 
C)  throughput, variance of response times, transmission time 
D)  none of the above 
A)  predictability, mean response time, rotational latency 
B)  throughput, mean response time, variance of response times 
C)  throughput, variance of response times, transmission time 
D)  none of the above

Question 19

RAID relies on units of data called ________, which when combined into larger chunks are known as ________.

Accepted Answer

A)  stripes, strips 
B)  fields, blocks 
C)  sectors, tracks 
D)  strips, stripes 
A)  stripes, strips 
B)  fields, blocks 
C)  sectors, tracks 
D)  strips, stripes

Question 20

Partitioning a drive can potentially ________ fragmentation.

Accepted Answer

A)  increase 
B)  decrease 
C)  eliminate 
D)  None of the above. Partitioning has no effect on fragmentation 
A)  increase 
B)  decrease 
C)  eliminate 
D)  None of the above. Partitioning has no effect on fragmentation

Exam 12: Disk Storage and Raid Technology

________ scheduling is appropriate for online transaction-processing systems.

Under C-SCAN scheduling, which the disk arm finishes sweeping from the outermost track to the innermost track, it ________.

RAID level 1 ________ of all RAID levels.

RAID level 3 performs ________ and incurs ________ storage overhead than RAID level 2

The C-LOOK algorithm reduces ________ compared to LOOK at the expense of ________.

The LOOK algorithm is based on the ________ strategy, but it eliminates unnecessary seeks when there are no more requests in the current direction.

Recently, disk capacities have ________, access times have ________ and cost per unit storage has ________.

The letter "I" in RAID originally stood for ________, but has been revised to stand for ________.

Complex disk scheduling strategies are most appropriate ________.

RAID level 5 provides performance that ________.

RAID level 0 can increase performance ________.

Today's hard disks exhibit seek times that are ________ rotational latency times.

Access time is defined as ________ plus ________.

RAID level 1 ________.

________ caching flushes data to disk immediately, ensuring it cannot be lost in the event of a system failure.

Disk scheduling algorithms are designed to minimize ________ and/or ________, depending on the system's requests.

Compression can improve disk performance at the expense of ________.

Maximizing ________and minimizing ________can lead to increased ________.

RAID relies on units of data called ________, which when combined into larger chunks are known as ________.

Partitioning a drive can potentially ________ fragmentation.

Exploring Operating Systems and Distributed Computing: a Comprehensive Overview

Understanding Computer Systems and Programming Concepts

Understanding Processes and Threads in Operating Systems

Exploring Semaphores and Multithreading in Operating Systems

Exploring Thread Synchronization and Mutual Exclusion in Java

Concurrency and Deadlock in Database Systems: Exploring Monitor Implementation and Thread Synchronization in Java

Operating System Scheduling and Deadlock Prevention: a Comprehensive Guide

Understanding Processor Scheduling and Memory Management in Operating Systems

Memory Management in Operating Systems: Segmentation, Paging, and Strategies for Efficiency

Memory Management and Address Translation in Operating Systems

Memory Management and Page Replacement Strategies in Operating Systems

Understanding File Systems and Database Systems: a Comprehensive Overview

Exploring Performance Evaluation and Benchmarking in Computer Systems

Understanding Multiprocessor Organizations and System Performance

Understanding the Layers of the TCP/IP Protocol Stack

Understanding Distributed Systems and Operating Systems

Exploring Distributed File Systems and Grid Computing With NFS, AFS, Coda, and JXTA

Security Threats and Solutions in Cryptography and Access Control

Exploring the Linux Operating Systems Features and Functionality

In-Depth Analysis of Windows XP

Filters

RAID level 3 performs and incurs storage overhead than RAID level 2

The C-LOOK algorithm reduces compared to LOOK at the expense of .

Recently, disk capacities have , access times have and cost per unit storage has .

The letter "I" in RAID originally stood for , but has been revised to stand for .

Access time is defined as plus .

Disk scheduling algorithms are designed to minimize and/or , depending on the system's requests.

Maximizing and minimizing can lead to increased .

RAID relies on units of data called , which when combined into larger chunks are known as .