Lec.

7
Operating System Multiple Choice Questions – Process
Synchronization

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on “Process
Synchronization”.

1. Which process can be affected by other processes executing in the system?

a) cooperating process
b) child process
c) parent process
d) init process
View Answer
Answer: a
Explanation: A cooperating process can be affected by other processes executing in the system.
Also it can affect other processes executing in the system. A process shares data with other
processes, such a process is known as a cooperating process.

2. When several processes access the same data concurrently and the outcome of the execution
depends on the particular order in which the access takes place is called ________
a) dynamic condition
b) race condition
c) essential condition
d) critical condition
View Answer
Answer: b
Explanation: When several processes access the same data concurrently and the outcome of
the execution depends on the particular order in which access takes place is called race
condition.

3. If a process is executing in its critical section, then no other processes can be executing in their
critical section. What is this condition called?
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
View Answer
Answer: a

4. Which one of the following is a synchronization tool?

a) thread
b) pipe
1
c) semaphore
d) socket
View Answer
Answer: c
Explanation: Semaphore is a synchronization tool. Semaphore is a mechanism which
synchronizes or controls access of threads on critical resources. There are two types of
semaphores i) Binary Semaphore ii) Counting Semaphore.

5. A semaphore is a shared integer variable __________

a) that can not drop below zero
b) that can not be more than zero
c) that can not drop below one
d) that can not be more than one
View Answer
Answer: a
Explanation: A semaphore is a shared integer variable that can not drop below zero. In binary
semaphore, if the value of the semaphore variable is zero that means there is a process that
uses a critical resource and no other process can access the same critical resource until it is
released. In Counting semaphore, if the value of the semaphore variable is zero that means
there is no resource available.

6. Mutual exclusion can be provided by the __________

a) mutex locks
b) binary semaphores
c) both mutex locks and binary semaphores
d) none of the mentioned
View Answer
Answer: c
Explanation: Mutual exclusion can be provided by both mutex locks and binary semaphore.
Mutex is a short form of Mutual Exclusion. Binary semaphore also provides a mechanism for
mutual exclusion. Binary semaphore behaves similar to mutex locks.

7. When high priority task is indirectly preempted by medium priority task effectively inverting the
relative priority of the two tasks, the scenario is called __________
a) priority inversion
b) priority removal
c) priority exchange
d) priority modification

8. Process synchronization can be done on __________

a) hardware level

2
b) software level
c) both hardware and software level
d) none of the mentioned
View Answer
Answer: c
Explanation: Process synchronization can be done on both hardware and software level. Critical
section problems can be resolved using hardware synchronisation. But this method is not
simple for implementation so software synchronization is mostly used.

9. A monitor is a module that encapsulates __________

a) shared data structures
b) procedures that operate on shared data structure
c) synchronization between concurrent procedure invocation
d) all of the mentioned
View Answer
Answer: d

10. To enable a process to wait within the monitor __________

a) a condition variable must be declared as condition
b) condition variables must be used as boolean objects
c) semaphore must be used
d) all of the mentioned
View Answer
Answer: a
Explanation: To enable a process to wait within the monitor a condition variable must be
declared as condition.

Operating System Multiple Choice Questions – Semaphores

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Semaphores”.

1. An un-interruptible unit is known as ____________

a) single
b) atomic
c) static
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

2. TestAndSet instruction is executed ____________

a) after a particular process
b) periodically
3
c) atomically
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

3. Semaphore is a/an _______ to solve the critical section problem.

a) hardware for a system
b) special program for a system
c) integer variable
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

4. What are the two atomic operations permissible on semaphores?

a) wait and signal
b) stop and wait
c) hold and signal
d) none of the mentioned
View Answer
Answer: a

Explanation: None.

5. What are Spinlocks?

a) CPU cycles wasting locks over critical sections of programs
b) Locks that avoid time wastage in context switches
c) Locks that work better on multiprocessor systems
d) All of the mentioned
View Answer
Answer: d
Explanation: None.

6. What is the main disadvantage of spinlocks?

a) they are not sufficient for many process
b) they require busy waiting
c) they are unreliable sometimes
d) they are too complex for programmers

7. The wait operation of the semaphore basically works on the basic _______ system call.
a) stop()
b) block()
c) hold()

4
d) wait()
View Answer
Answer: b
Explanation: None.

8. The signal operation of the semaphore basically works on the basic _______ system call.
a) continue()
b) wakeup()
c) getup()
d) start()
View Answer
Answer: b
Explanation: None.

9. If the semaphore value is negative ____________

a) its magnitude is the number of processes waiting on that semaphore
b) it is invalid
c) no operation can be further performed on it until the signal operation is performed on it
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

10. The code that changes the value of the semaphore is ____________
a) remainder section code
b) non – critical section code
c) critical section code
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

11. The following program consists of 3 concurrent processes and 3 binary semaphores. The
semaphores are initialized as S0 = 1, S1 = 0, S2 = 0.

Process P0
while(true)

5
{
wait(S0);
print '0';
release(S1);
release(S2);
}

Process P1
wait(S1);
release(S0);

Process P2
wait(S2);
release(S0);

How many times will P0 print ‘0’?

a) At least twice
b) Exactly twice
c) Exactly thrice
d) Exactly once
View Answer
Answer: a
Explanation: None.

12. Each process Pi, i = 0,1,2,3,……,9 is coded as follows.

repeat
P(mutex)
{Critical Section}
V(mutex)
forever

The code for P10 is identical except that it uses V(mutex) instead of P(mutex). What is the
largest number of processes that can be inside the critical section at any moment (the mutex
being initialized to 1)?
a) 1
b) 2
c) 3
d) None of the mentioned

13. Two processes, P1 and P2, need to access a critical section of code. Consider the following
synchronization construct used by the processes.

Process P1 :
while(true)
6
{
w1 = true;
while(w2 == true);
Critical section
w1 = false;
}
Remainder Section

Process P2 :
while(true)
{
w2 = true;
while(w1 == true);
Critical section
w2 = false;
}
Remainder Section

Here, w1 and w2 have shared variables, which are initialized to false. Which one of the
following statements is TRUE about the above construct?
a) It does not ensure mutual exclusion
b) It does not ensure bounded waiting
c) It requires that processes enter the critical section in strict alternation
d) It does not prevent deadlocks but ensures mutual exclusion

Operating System Multiple Choice Questions – Deadlock

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Deadlock”.

1. What is a reusable resource?

a) that can be used by one process at a time and is not depleted by that use
b) that can be used by more than one process at a time
c) that can be shared between various threads
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

2. Which of the following condition is required for a deadlock to be possible?

a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources
c) no resource can be forcibly removed from a process holding it

7
d) all of the mentioned
View Answer
Answer: d
Explanation: None.

3. A system is in the safe state if ____________

a) the system can allocate resources to each process in some order and still avoid a deadlock
b) there exist a safe sequence
c) all of the mentioned
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

4. The circular wait condition can be prevented by ____________

a) defining a linear ordering of resource types
b) using thread
c) using pipes
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

5. Which one of the following is the deadlock avoidance algorithm?

a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm
View Answer
Answer: a
Explanation: None.

6. What is the drawback of banker’s algorithm?

a) in advance processes rarely know how much resource they will need
b) the number of processes changes as time progresses
c) resource once available can disappear
d) all of the mentioned

7. For an effective operating system, when to check for deadlock?

a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
8
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

8. A problem encountered in multitasking when a process is perpetually denied necessary

resources is called ____________
a) deadlock
b) starvation
c) inversion
d) aging
View Answer
Answer: b
Explanation: None.

9. Which one of the following is a visual ( mathematical ) way to determine the deadlock
occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

10. To avoid deadlock ____________

a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used
View Answer
Answer: a
Explanation: None.

9
 Operating System Questions and Answers – The Critical Section
(CS) Problem and Solutions

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on “The
Critical Section (CS) Problem and Solutions”.

1. Concurrent access to shared data may result in ____________

a) data consistency
b) data insecurity
c) data inconsistency
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

2. A situation where several processes access and manipulate the same data concurrently and
the outcome of the execution depends on the particular order in which access takes place is
called ____________
a) data consistency
b) race condition
c) aging
d) starvation
View Answer
Answer: b
Explanation: None.

3. The segment of code in which the process may change common variables, update tables,
write into files is known as ____________
a) program
b) critical section
c) non – critical section
d) synchronizing
View Answer
Answer: b
Explanation: None.

4. Which of the following conditions must be satisfied to solve the critical section problem?
a) Mutual Exclusion
b) Progress
c) Bounded Waiting
d) All of the mentioned

5. Mutual exclusion implies that ____________

a) if a process is executing in its critical section, then no other process must be executing in
10
their critical sections
b) if a process is executing in its critical section, then other processes must be executing in their
critical sections
c) if a process is executing in its critical section, then all the resources of the system must be
blocked until it finishes execution
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

6. Bounded waiting implies that there exists a bound on the number of times a process is
allowed to enter its critical section ____________
a) after a process has made a request to enter its critical section and before the request is
granted
b) when another process is in its critical section
c) before a process has made a request to enter its critical section
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

7. A minimum of _____ variable(s) is/are required to be shared between processes to solve

the critical section problem.
a) one
b) two
c) three
d) four

8. In the bakery algorithm to solve the critical section problem ____________

a) each process is put into a queue and picked up in an ordered manner
b) each process receives a number (may or may not be unique) and the one with the lowest
number is served next
c) each process gets a unique number and the one with the highest number is served next
d) each process gets a unique number and the one with the lowest number is served next
View Answer
Answer: b
Explanation: None.

11
 Operating System Questions and Answers – Semaphores – 2

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Semaphores – 2”.

1. What will happen if a non-recursive mutex is locked more than once?

a) Starvation
b) Deadlock
c) Aging
d) Signaling
View Answer
Answer: b
Explanation: If a thread which had already locked a mutex, tries to lock the mutex again,
it will enter into the waiting list of that mutex, which results in a deadlock. It is because
no other thread can unlock the mutex.

2. What is a semaphore?
a) is a binary mutex
b) must be accessed from only one process
c) can be accessed from multiple processes
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

3. What are the two kinds of semaphores?

a) mutex & counting
b) binary & counting
c) counting & decimal
d) decimal & binary
View Answer
Answer: b
Explanation: None.

4. What is a mutex?
a) is a binary mutex
b) must be accessed from only one process
c) can be accessed from multiple processes
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

12
5. At a particular time of computation the value of a counting semaphore is 7.Then 20 P
operations and 15 V operations were completed on this semaphore. The resulting value of
the semaphore is? (GATE 1987)
a) 42
b) 2
c) 7
d) 12
View Answer
Answer: b
Explanation: P represents Wait and V represents Signal. P operation will decrease the
value by 1 every time and V operation will increase the value by 1 every time.

6. A binary semaphore is a semaphore with integer values ____________

a) 1
b) -1
c) 0.8
d) 0.5
View Answer
Answer: a
Explanation: None.

7. The following pair of processes share a common variable X.

Process A
int Y;
A1: Y = X*2;
A2: X = Y;

Process B
int Z;
B1: Z = X+1;
B2: X = Z;

X is set to 5 before either process begins execution. As usual, statements within a process
are executed sequentially, but statements in process A may execute in any order with
respect to statements in process B.
How many different values of X are possible after both processes finish executing?
a) two
b) three
c) four
d) eight
View Answer
Answer: c

13
8. The program follows to use a shared binary semaphore T.

Process A
int Y;
A1: Y = X*2;
A2: X = Y;
signal(T);

Process B
int Z;
B1: wait(T);
B2: Z = X+1;
X = Z;

T is set to 0 before either process begins execution and, as before, X is set to 5.

Now, how many different values of X are possible after both processes finish executing?
a) one
b) two
c) three
d) four
View Answer
Answer: a
Explanation: The semaphore T ensures that all the statements from A finish execution
before B begins. So now there is only one way in which statements from A and B can be
interleaved:
A1 A2 B1 B2: X = 11.

9. Semaphores are mostly used to implement ____________

a) System calls
b) IPC mechanisms
c) System protection
d) None of the mentioned
View Answer
Answer: b
Explanation: None.

10. Spinlocks are intended to provide __________ only.

a) Mutual Exclusion
b) Bounded Waiting
c) Aging
d) Progress
View Answer
Answer: b
Explanation: None.

14
 Operating System Questions and Answers – Monitors

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Monitors”.

1. A monitor is a type of ____________

a) semaphore
b) low level synchronization construct
c) high level synchronization construct
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

2. A monitor is characterized by ____________

a) a set of programmer defined operators
b) an identifier
c) the number of variables in it
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

3. A procedure defined within a ________ can access only those variables declared locally
within the _______ and its formal parameters.
a) process, semaphore
b) process, monitor
c) semaphore, semaphore
d) monitor, monitor
View Answer
Answer: d
Explanation: None.

4. The monitor construct ensures that ____________

a) only one process can be active at a time within the monitor
b) n number of processes can be active at a time within the monitor (n being greater
than 1)
c) the queue has only one process in it at a time
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

15
 5. What are the operations that can be invoked on a condition variable?
a) wait & signal
b) hold & wait
c) signal & hold
d) continue & signal
View Answer
Answer: a
Explanation: None.

6. Which is the process of invoking the wait operation?

a) suspended until another process invokes the signal operation
b) waiting for another process to complete before it can itself call the signal operation
c) stopped until the next process in the queue finishes execution
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

7. If no process is suspended, the signal operation ____________

a) puts the system into a deadlock state
b) suspends some default process execution
c) nothing happens
d) the output is unpredictable
View Answer
Answer: c
Explanation: None.

Operating System Questions and Answers – Atomic

Transactions

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Atomic Transactions”.

1. A collection of instructions that performs a single logical function is called ____________

a) transaction
b) operation
c) function
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

16
2. A terminated transaction that has completed its execution successfully is ____________
otherwise it is __________
a) committed, destroyed
b) aborted, destroyed
c) committed, aborted
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

3. The state of the data accessed by an aborted transaction must be restored to what it
was just before the transaction started executing. This restoration is known as ________ of
transaction.
a) safety
b) protection
c) roll – back
d) revert – back
View Answer
Answer: c
Explanation: None.

4. Write ahead logging is a way ____________

a) to ensure atomicity
b) to keep data consistent
c) that records data on stable storage
d) all of the mentioned
View Answer
Answer: d
Explanation: None.

5. In the write ahead logging a _____________ is maintained.

a) a memory
b) a system
c) a disk
d) a log record
View Answer
Answer: d
Explanation: None.

6. An actual update is not allowed to a data item ____________

a) before the corresponding log record is written out to stable storage

17
b) after the corresponding log record is written out to stable storage
c) until the whole log record has been checked for inconsistencies
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

7. The undo and redo operations must be _________ to guarantee correct behaviour, even if
a failure occurs during recovery process.
a) idempotent
b) easy
c) protected
d) all of the mentioned
View Answer
Answer: a
Explanation: Idempotent – Multiple executions of an operation have the same result as
does one execution.

8. The system periodically performs checkpoints that consists of the following operation(s)
____________
a) Putting all the log records currently in main memory onto stable storage
b) putting all modified data residing in main memory onto stable storage
c) putting a log record onto stable storage
d) all of the mentioned
View Answer
Answer: d
Explanation: None.

9. Consider a transaction T1 that committed prior to checkpoint. The <T1 commits> record
appears in the log before the <checkpoint> record. Any modifications made by T1 must
have been written to the stable storage either with the checkpoint or prior to it. Thus at
recovery time ____________
a) There is a need to perform an undo operation on T1
b) There is a need to perform a redo operation on T1
c) There is no need to perform an undo and redo operation on T1
d) All of the mentioned
View Answer
Answer: c
Explanation: None.

10. Serializable schedules are ones where ____________

a) concurrent execution of transactions is equivalent to the transactions executed serially
b) the transactions can be carried out one after the other
c) a valid result occurs after execution transactions

18
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

11. A locking protocol is one that ____________

a) governs how locks are acquired
b) governs how locks are released
c) governs how locks are acquired and released
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

12. The two phase locking protocol consists of ____________

a) growing & shrinking phase
b) shrinking & creation phase
c) creation & growing phase
d) destruction & creation phase
View Answer
Answer: a
Explanation: None.

13. The growing phase is a phase in which?

a) A transaction may obtain locks, but does not release any
b) A transaction may obtain locks, and releases a few or all of them
c) A transaction may release locks, but does not obtain any new locks
d) A transaction may release locks, and does obtain new locks
View Answer
Answer: a
Explanation: None.

14. The shrinking phase is a phase in which?

a) A transaction may obtain locks, but does not release any
b) A transaction may obtain locks, and releases a few or all of them
c) A transaction may release locks, but does not obtain any new locks
d) A transaction may release locks, and does obtain new locks
View Answer

19
 Answer: c
Explanation: None.

15. Which of the following concurrency control protocols ensure both conflict serializability
and freedom from deadlock?
I) 2-phase locking
II) Timestamp ordering
a) I only
b) II only
c) Both I and II
d) Neither I nor II
View Answer
Answer: b
Explanation: None.

Lec.8
Operating System MCQ – Memory Management – Swapping
Processes

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Memory Management – Swapping Processes”.

1. What is Address Binding?

a) going to an address in memory
b) locating an address with the help of another address
c) binding two addresses together to form a new address in a different memory space

20
d) a mapping from one address space to another
View Answer
Answer: d
Explanation: None.

2. Binding of instructions and data to memory addresses can be done at ____________

a) Compile time
b) Load time
c) Execution time
d) All of the mentioned
View Answer
Answer: d
Explanation: None.

3. If the process can be moved during its execution from one memory segment to another,
then binding must be ____________
a) delayed until run time
b) preponed to compile time
c) preponed to load time
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

4. What is Dynamic loading?

a) loading multiple routines dynamically
b) loading a routine only when it is called
c) loading multiple routines randomly
d) none of the mentioned

5. What is the advantage of dynamic loading?

a) A used routine is used multiple times
b) An unused routine is never loaded
c) CPU utilization increases
d) All of the mentioned
View Answer
Answer: b
Explanation: None.

6. The idea of overlays is to ____________

a) data that are needed at any given time
b) enable a process to be larger than the amount of memory allocated to it
21
c) keep in memory only those instructions
d) all of the mentioned
View Answer
Answer: d
Explanation: None.

7. The ___________ must design and program the overlay structure.

a) programmer
b) system architect
c) system designer
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

8. The ___________ swaps processes in and out of the memory.

a) Memory manager
b) CPU
c) CPU manager
d) User
View Answer
Answer: a
Explanation: None.

9. If a higher priority process arrives and wants service, the memory manager can swap
out the lower priority process to execute the higher priority process. When the higher
priority process finishes, the lower priority process is swapped back in and continues
execution. This variant of swapping is sometimes called?
a) priority swapping
b) pull out, push in
c) roll out, roll in
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

10. If binding is done at assembly or load time, then the process _____ be moved to
different locations after being swapped out and in again.
22
a) can
b) must
c) can never
d) may

11. In a system that does not support swapping ____________

a) the compiler normally binds symbolic addresses (variables) to relocatable addresses
b) the compiler normally binds symbolic addresses to physical addresses
c) the loader binds relocatable addresses to physical addresses
d) binding of symbolic addresses to physical addresses normally takes place during
execution
View Answer
Answer: a
Explanation: None.

12. Which of the following is TRUE?

a) Overlays are used to increase the size of physical memory
b) Overlays are used to increase the logical address space
c) When overlays are used, the size of a process is not limited to the size of the physical
memory
d) Overlays are used whenever the physical address space is smaller than the logical
address space
View Answer
Answer: c
Explanation: None.

Operating System Questions and Answers – Memory

Management – Swapping Processes – 2

This set of Operating System Questions and Answers focuses on “Swapping Processes” and
will also be useful for interview preparations for experienced people.

1. The address generated by the CPU is referred to as ____________

a) Physical address
b) Logical address
c) Neither physical nor logical
d) None of the mentioned
View Answer
Answer: b
Explanation: None.

2. The address loaded into the memory address register of the memory is referred to as
____________
a) Physical address
23
b) Logical address
c) Neither physical nor logical
d) None of the mentioned
View Answer
Answer: a
Explanation: None.

3. The run time mapping from virtual to physical addresses is done by a hardware device
called the ____________
a) Virtual to physical mapper
b) Memory management unit
c) Memory mapping unit
d) None of the mentioned
View Answer
Answer: b
Explanation: None.

4. The base register is also known as the ____________

a) basic register
b) regular register
c) relocation register
d) delocation register

5. The size of a process is limited to the size of ____________

a) physical memory
b) external storage
c) secondary storage
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

6. If execution time binding is being used, then a process ______ be swapped to a different
memory space.
a) has to be
b) can never
c) must
d) may
View Answer
Answer: d
Explanation: None.

24
7. Swapping requires a _________
a) motherboard
b) keyboard
c) monitor
d) backing store
View Answer
Answer: d
Explanation: None.

8. The backing store is generally a ____________

a) fast disk
b) disk large enough to accommodate copies of all memory images for all users
c) disk to provide direct access to the memory images
d) all of the mentioned
View Answer
Answer: d

9. The ________ consists of all processes whose memory images are in the backing store or
in memory and are ready to run.
a) wait queue
b) ready queue
c) cpu
d) secondary storage

10. The _________ time in a swap out of a running process and swap in of a new process into
the memory is very high.
a) context – switch
b) waiting
c) execution
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

11. The major part of swap time is _______ time.

a) waiting
b) transfer
c) execution
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

25
12. Swapping _______ be done when a process has pending I/O, or has to execute I/O
operations only into operating system buffers.
a) must
b) can
c) must never
d) maybe
View Answer
Answer: c
Explanation: None.

13. Swap space is allocated ____________

a) as a chunk of disk
b) separate from a file system
c) into a file system
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

Operating System Questions & Answers – Memory

Management

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Memory Management”.

1. CPU fetches the instruction from memory according to the value of ____________
a) program counter
b) status register
c) instruction register
d) program status word
View Answer
Answer: a
Explanation: None.

2. A memory buffer used to accommodate a speed differential is called ____________

a) stack pointer
b) cache
c) accumulator
d) disk buffer
View Answer
Answer: b
Explanation: None.

26
3. Which one of the following is the address generated by CPU?
a) physical address
b) absolute address
c) logical address
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

4. Run time mapping from virtual to physical address is done by ____________

a) Memory management unit
b) CPU
c) PCI
d) None of the mentioned
View Answer
Answer: a
Explanation: None.

5. Memory management technique in which system stores and retrieves data from
secondary storage for use in main memory is called?
a) fragmentation
b) paging
c) mapping
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

6. The address of a page table in memory is pointed by ____________

a) stack pointer
b) page table base register
c) page register
d) program counter
View Answer
Answer: b
Explanation: None.

7. Program always deals with ____________

a) logical address
b) absolute address
c) physical address
d) relative address
View Answer

27
 Answer: a
Explanation: None.

8. The page table contains ____________

a) base address of each page in physical memory
b) page offset
c) page size
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

9. What is compaction?
a) a technique for overcoming internal fragmentation
b) a paging technique
c) a technique for overcoming external fragmentation
d) a technique for overcoming fatal error

10. Operating System maintains the page table for ____________

a) each process
b) each thread
c) each instruction
d) each address
View Answer
Answer: a
Explanation: None.

Operating System MCQ – Memory Management – Memory

Allocation

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Memory Management – Memory Allocation”.

1. The main memory accommodates ____________

a) operating system
b) cpu
c) user processes
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

28
2. What is the operating system?
a) in the low memory
b) in the high memory
c) either low or high memory (depending on the location of interrupt vector)
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

3. In contiguous memory allocation ____________

a) each process is contained in a single contiguous section of memory
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

4. The relocation register helps in ____________

a) providing more address space to processes
b) a different address space to processes
c) to protect the address spaces of processes
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

5. With relocation and limit registers, each logical address must be _______ the limit register.
a) less than
b) equal to
c) greater than
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

6. The operating system and the other processes are protected from being modified by an
already running process because ____________
a) they are in different memory spaces
b) they are in different logical addresses
c) they have a protection algorithm
d) every address generated by the CPU is being checked against the relocation and limit
registers
View Answer

29
 Answer: d
Explanation: None.

7. Transient operating system code is code that ____________

a) is not easily accessible
b) comes and goes as needed
c) stays in the memory always
d) never enters the memory space
View Answer
Answer: b
Explanation: None.

8. Using transient code, _______ the size of the operating system during program execution.
a) increases
b) decreases
c) changes
d) maintains
View Answer
Answer: c
Explanation: None.

9. When memory is divided into several fixed sized partitions, each partition may contain
________
a) exactly one process
b) at least one process
c) multiple processes at once
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

10. In fixed size partition, the degree of multiprogramming is bounded by ___________

a) the number of partitions
b) the CPU utilization
c) the memory size
d) all of the mentioned
View Answer
Answer: a
Explanation: None

30
11. The first fit, best fit and worst fit are strategies to select a ______
a) process from a queue to put in memory
b) processor to run the next process
c) free hole from a set of available holes
d) all of the mentioned
View Answer
Answer: c
Explanation: None.

Operating System MCQ – Memory Management – Paging

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Memory Management – Paging”.

1. Physical memory is broken into fixed-sized blocks called ________

a) frames
b) pages
c) backing store
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

2. Logical memory is broken into blocks of the same size called _________
a) frames
b) pages
c) backing store
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

3. Every address generated by the CPU is divided into two parts. They are ____________
a) frame bit & page number
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset
View Answer
Answer: b
Explanation: None.

4. The __________ is used as an index into the page table.

a) frame bit
31
b) page number
c) page offset
d) frame offset
View Answer
Answer: b
Explanation: None.

5. The _____ table contains the base address of each page in physical memory.
a) process
b) memory
c) page
d) frame
View Answer
Answer: c
Explanation: None.

6. The size of a page is typically ____________

a) varied
b) power of 2
c) power of 4
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

7. If the size of logical address space is 2 to the power of m, and a page size is 2 to the
power of n addressing units, then the high order _____ bits of a logical address designate
the page number, and the ____ low order bits designate the page offset.
a) m, n
b) n, m
c) m – n, m
d) m – n, n
View Answer
Answer: d
Explanation: None.

8. With paging there is no ________ fragmentation.

a) internal
b) external
c) either type of
d) none of the mentioned
View Answer
Answer: b

32
9. The operating system maintains a ______ table that keeps track of how many frames
have been allocated, how many are there, and how many are available.
a) page
b) mapping
c) frame
d) memory

10. Paging increases the ______ time.

a) waiting
b) execution
c) context – switch
d) all of the mentioned
View Answer
Answer: c
Explanation: None.

11. Smaller page tables are implemented as a set of _______

a) queues
b) stacks
c) counters
d) registers
View Answer
Answer: d
Explanation: None.

12. The page table registers should be built with _______

a) very low speed logic
b) very high speed logic
c) a large memory space
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

13. For larger page tables, they are kept in main memory and a __________ points to the
page table.
a) page table base register
b) page table base pointer
c) page table register pointer
d) page table base
View Answer

33
 Answer: a
Explanation: None.

14. For every process there is a __________

a) page table
b) copy of page table
c) pointer to page table
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

15. Time taken in memory access through PTBR is ____________

a) extended by a factor of 3
b) extended by a factor of 2
c) slowed by a factor of 3
d) slowed by a factor of 2
View Answer
Answer: d
Explanation: None.

Operating System Questions and Answers – Memory

Management – Paging – 2

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Paging – 2”.

1. Each entry in a translation lookaside buffer (TLB) consists of ____________

a) key
b) value
c) bit value
d) constant
View Answer
Answer: a
Explanation: None.

2. If a page number is not found in the TLB, then it is known as a ____________

a) TLB miss
b) Buffer miss
c) TLB hit
34
d) All of the mentioned
View Answer
Answer: a
Explanation: None.

3. An ______ uniquely identifies processes and is used to provide address space

protection for that process.
a) address space locator
b) address space identifier
c) address process identifier
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

4. The percentage of times a page number is found in the TLB is known as ____________
a) miss ratio
b) hit ratio
c) miss percent
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

5. Memory protection in a paged environment is accomplished by ____________

a) protection algorithm with each page
b) restricted access rights to users
c) restriction on page visibility
d) protection bit with each page
View Answer
Answer: d
Explanation: None.

6. When the valid – invalid bit is set to valid, it means that the associated page
____________
a) is in the TLB
b) has data in it
c) is in the process’s logical address space
d) is the system’s physical address space
View Answer
Answer: c
Explanation: None.

35
7. Illegal addresses are trapped using the _____ bit.
a) error
b) protection
c) valid – invalid
d) access
View Answer

Answer: c
Explanation: None.

8. When there is a large logical address space, the best way of paging would be
____________
a) not to page
b) a two level paging algorithm
c) the page table itself
d) all of the mentioned
View Answer
Answer: b
Explanation: None.

9. In a paged memory, the page hit ratio is 0.35. The required to access a page in
secondary memory is equal to 100 ns. The time required to access a page in primary
memory is 10 ns. The average time required to access a page is?
a) 3.0 ns
b) 68.0 ns
c) 68.5 ns
d) 78.5 ns
View Answer
Answer: c
Explanation: None.

10. To obtain better memory utilization, dynamic loading is used. With dynamic loading,
a routine is not loaded until it is called. For implementing dynamic loading ____________
a) special support from hardware is required
b) special support from operating system is essential
c) special support from both hardware and operating system is essential
d) user programs can implement dynamic loading without any special support from
hardware or operating system
View Answer

36
 Answer: d
Explanation: None.

11. In paged memory systems, if the page size is increased, then the internal
fragmentation generally ____________
a) becomes less
b) becomes more
c) remains constant
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

Lec. 9
Operating System Multiple Choice Questions – Disk
Scheduling

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Disk Scheduling”.

1. In _______ information is recorded magnetically on platters.

a) magnetic disks
b) electrical disks
c) assemblies
d) cylinders
View Answer
Answer: a
Explanation: None.

2. The heads of the magnetic disk are attached to a _____ that moves all the heads as a
unit.
a) spindle
b) disk arm
c) track
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

37
3. The set of tracks that are at one arm position make up a ___________
a) magnetic disks
b) electrical disks
c) assemblies
d) cylinders
View Answer
Answer: d
Explanation: None.

4. The time taken to move the disk arm to the desired cylinder is called the ____________
a) positioning time
b) random access time
c) seek time
d) rotational latency
View Answer
Answer: c
Explanation: None.

5. The time taken for the desired sector to rotate to the disk head is called ____________
a) positioning time
b) random access time
c) seek time
d) rotational latency
View Answer
Answer: d
Explanation: None.

6. When the head damages the magnetic surface, it is known as _________

a) disk crash
b) head crash
c) magnetic damage
d) all of the mentioned
View Answer
Answer: b
Explanation: None.

7. A floppy disk is designed to rotate ___________ as compared to a hard disk drive.

a) faster
b) slower
c) at the same speed

38
d) none of the mentioned

8. What is the host controller?

a) controller built at the end of each disk
b) controller at the computer end of the bus
c) all of the mentioned
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

9. ______ controller sends the command placed into it, via messages to the _____
controller.
a) host, host
b) disk, disk
c) host, disk
d) disk, host
View Answer
Answer: c
Explanation: None.

10. What is the disk bandwidth?

a) the total number of bytes transferred
b) total time between the first request for service and the completion on the last transfer
c) the total number of bytes transferred divided by the total time between the first
request for service and the completion on the last transfer
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

Operating System Questions & Answers – Disk Scheduling – 2

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Disk Scheduling – 2”.

1. Whenever a process needs I/O to or from a disk it issues a ______________

a) system call to the CPU
b) system call to the operating system
c) a special procedure

39
d) all of the mentioned

2. If a process needs I/O to or from a disk, and if the drive or controller is busy then
____________
a) the request will be placed in the queue of pending requests for that drive
b) the request will not be processed and will be ignored completely
c) the request will be not be placed
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

3. Consider a disk queue with requests for I/O to blocks on cylinders.

98 183 37 122 14 124 65 67
Considering FCFS (first cum first served) scheduling, the total number of head
movements is, if the disk head is initially at 53 is?
a) 600
b) 620
c) 630
d) 640
View Answer
Answer: d
Explanation: None.

4. Consider a disk queue with requests for I/O to blocks on cylinders.

98 183 37 122 14 124 65 67
Considering SSTF (shortest seek time first) scheduling, the total number of head
movements is, if the disk head is initially at 53 is?
a) 224
b) 236
c) 245
d) 240
View Answer
Answer: b
Explanation: None.

5. Random access in magnetic tapes is _________ compared to magnetic disks.

a) fast
b) very fast
c) slow
d) very slow
View Answer

40
 Answer: d
Explanation: None.

6. Magnetic tape drives can write data at a speed ________ disk drives.
a) much lesser than
b) comparable to
c) much faster than
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

7. On media that use constant linear velocity (CLV), the _____________ is uniform.
a) density of bits on the disk
b) density of bits per sector
c) the density of bits per track
d) none of the mentioned

8. SSTF algorithm, like SJF __________ of some requests.

a) may cause starvation
b) will cause starvation
c) does not cause starvation
d) causes aging
View Answer
Answer: a
Explanation: None.

9. In the ______ algorithm, the disk arm starts at one end of the disk and moves toward
the other end, servicing requests till the other end of the disk. At the other end, the
direction is reversed and servicing continues.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
View Answer
Answer: b
Explanation: None.

10. In the _______ algorithm, the disk head moves from one end to the other, servicing
requests along the way. When the head reaches the other end, it immediately returns to
the beginning of the disk without servicing any requests on the return trip.
a) LOOK
b) SCAN
c) C-SCAN

41
d) C-LOOK

11. In the ______ algorithm, the disk arm goes as far as the final request in each
direction, then reverses direction immediately without going to the end of the disk.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
View Answer

Answer: a
Explanation: None.

Operating System Questions & Answers – Disk Management

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Disk Management”.

1. The process of dividing a disk into sectors that the disk controller can read and write,
before a disk can store data is known as ____________
a) partitioning
b) swap space creation
c) low-level formatting
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

2. The data structure for a sector typically contains ____________

a) header
b) data area
c) trailer
d) all of the mentioned
View Answer
Answer: d
Explanation: None.

42
3. The header and trailer of a sector contain information used by the disk controller such
as _________ and _________
a) main section & disk identifier
b) error correcting codes (ECC) & sector number
c) sector number & main section
d) disk identifier & sector number
View Answer
Answer: b

4. The two steps the operating system takes to use a disk to hold its files are _______ and
________
a) partitioning & logical formatting
b) swap space creation & caching
c) caching & logical formatting
d) logical formatting & swap space creation
View Answer
Answer: a

5. The _______ program initializes all aspects of the system, from CPU registers to device
controllers and the contents of main memory, and then starts the operating system.
a) main
b) bootloader
c) bootstrap
d) rom
View Answer
Answer: c

6. For most computers, the bootstrap is stored in ________

a) RAM
b) ROM
c) Cache
d) Tertiary storage
View Answer
Answer: b

7. A disk that has a boot partition is called a _________

a) start disk
b) end disk
c) boot disk
d) all of the mentioned
View Answer

43
 Answer: c

8. Defective sectors on disks are often known as __________

a) good blocks
b) destroyed blocks
c) bad blocks
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

9. In SCSI disks used in high end PCs, the controller maintains a list of _________ on the
disk. The disk is initialized during ________ which sets aside spare sectors not visible to
the operating system.
a) destroyed blocks, high level formatting
b) bad blocks, partitioning
c) bad blocks, low level formatting
d) destroyed blocks, partitioning
View Answer
Answer: c
Explanation: None.

10. In SCSI disks used in high end PCs, the controller maintains a list of bad blocks on the
disk. The disk is initialized during low-level formatting which sets aside spare sectors not
visible to the operating system. The scheme used is known as _______ or ________
a) sector sparing & forwarding
b) forwarding & sector utilization
c) backwarding & forwarding
d) sector utilization & backwarding

11. An unrecoverable error is known as _________

a) hard error
b) tough error
c) soft error
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

44
 Operating System Questions & Answers – Swap Space
Management

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Swap Space Management”.

1. Virtual memory uses disk space as an extension of _________

a) secondary storage
b) main memory
c) tertiary storage
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

2. Using swap space significantly _________ system performance.

a) increases
b) decreases
c) maintains
d) does not affect
View Answer
Answer: b
Explanation: Disk access is much slower than memory access.

3. Linux __________ the use of multiple swap spaces.

a) allows
b) does not allow
c) may allow
d) none of the mentioned
View Answer
Answer: a
Explanation: Putting these swap spaces on separate disks reduces the load places on
the I/O system.

4. A single swap space ______ reside in two places.

a) can
b) cannot
c) must not
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

45
5. If the swap space is simply a large file, within the file system, ____________ used to
create it, name it and allocate its space.
a) special routines must be
b) normal file system routines can be
c) normal file system routines cannot be
d) swap space storage manager is
View Answer
Answer: b
Explanation: None.

6. For swap space created in a separate disk partition where no file system or directory
structure is placed, _____________ used to allocate and deallocate the blocks.
a) special routines must be
b) normal file system routines can be
c) normal file system routines cannot be
d) swap space storage manager is
View Answer
Answer: d
Explanation: None.

7. When a fixed amount of swap space is created during disk partitioning, more swap
space can be added only by?
I) repartitioning of the disk
II) adding another swap space elsewhere
a) only I
b) only II
c) both I and II
d) neither I nor II
View Answer
Answer: c
Explanation: None.

8. In UNIX, two per process ________ are used by the kernel to track swap space use.
a) process tables
b) swap maps
c) memory maps
d) partition maps
View Answer
Answer: b
Explanation: None.

46
9. It is __________ to reread a page from the file system than to write it to swap space
and then to reread it from there.
a) useless
b) less efficient
c) more efficient
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

Operating System Multiple Choice Questions – RAID

Structure

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses
on “RAID Structure”.

1. RAID level 3 supports a lower number of I/Os per second, because _______________
a) Every disk has to participate in every I/O request
b) Only one disk participates per I/O request
c) I/O cycle consumes a lot of CPU time
d) All of the mentioned
View Answer
Answer: a
Explanation: None.

2. RAID level _____ is also known as block interleaved parity organisation and uses
block level striping and keeps a parity block on a separate disk.
a) 1
b) 2
c) 3
d) 4
View Answer
Answer: d

3. A performance problem with _________ is the expense of computing and writing

parity.
a) non-parity based RAID levels
b) parity based RAID levels
c) all RAID levels
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

47
4. In RAID level 4, one block read, accesses __________
a) only one disk
b) all disks simultaneously
c) all disks sequentially
d) none of the mentioned
View Answer
Answer: a
Explanation: Other requests are allowed to be processed by other disks.

5. The overall I/O rate in RAID level 4 is ____________

a) low
b) very low
c) high
d) none of the mentioned
View Answer
Answer: c
Explanation: All disks can be read in parallel.

6. A write of a block has to access ____________

a) the disk on which the block is stored
b) parity disk
c) a parity block
d) all of the mentioned
View Answer
Answer: d

7. RAID level 5 is also known as ____________

a) bit-interleaved parity organization
b) block-interleaved parity organization
c) block-interleaved distributed parity
d) memory-style ECC organization
View Answer
Answer: c
Explanation: None.

8. RAID level ____ spreads parity and data among all N+1 disks rather than storing
data in N disks and parity in 1.
a) 3
b) 4
c) 5
d) 6
View Answer
Answer: c

48
9. The potential overuse of a single parity disk is avoided in RAID level _______
a) 3
b) 4
c) 5
d) all of the mentioned
View Answer
Answer: c
Explanation: None.

10. RAID level 0+1 is used because, RAID level 0 provides ______ whereas RAID level 1
provides ________
a) performance, redundancy
b) performance, reliability
c) redundancy, performance
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

11. If a disk fails in RAID level ___________ rebuilding lost data is easiest.
a) 1
b) 2
c) 3
d) 4

12. Where performance and reliability are both important, RAID level ____ is used.
a) 0
b) 1
c) 2
d) 0+1
View Answer
Answer: d
Explanation: None.

Operating System Questions & Answers – RAID Structure –

2

This set of Advanced Operating System Questions and Answers focuses on “RAID
Structure – 2”.

49
1. A large number of disks in a system improves the rate at which data can be read
or written if ____________
a) the disks are operated on sequentially
b) the disks are operated on selectively
c) the disks are operated in parallel
d) all of the mentioned
View Answer
Answer: c
Explanation: None.

2. RAID stands for ____________

a) Redundant Allocation of Inexpensive Disks
b) Redundant Array of Important Disks
c) Redundant Allocation of Independent Disks
d) Redundant Array of Independent Disks
View Answer
Answer: d
Explanation: None.

3. If the mean time to failure of a single disk is 100,000 hours, then the mean time to
failure of some disk in an array of 100 disks will be ____________
a) 100 hours
b) 10 days
c) 10 hours
d) 1000 hours
View Answer
Answer: d
Explanation: None.

4. The solution to the problem of reliability is the introduction of __________

a) aging
b) scheduling
c) redundancy
d) disks
View Answer
Answer: c
Explanation: None.

5. The technique of duplicating every disk is known as ____________

a) mirroring
b) shadowing
c) redundancy
d) all of the mentioned
View Answer

50
 Answer: a
Explanation: None.

6. The mean time to failure of a mirrored disk depends on ____________

I) the mean time to failure of individual disks
II) the mean time to repair
a) Only I
b) Only II
c) Both I and II
d) Neither I nor II

7. RAID level ________ refers to disk arrays with striping at the level of blocks, but
without any redundancy.
a) 0
b) 1
c) 2
d) 3
View Answer
Answer: a
Explanation: None.

8. RAID level _______ refers to disk mirroring.

a) 0
b) 1
c) 2
d) 3
View Answer
Answer: b

9. RAID level ______ is also known as bit interleaved parity organisation.

a) 0
b) 1
c) 2
d) 3
View Answer
Answer: d
Explanation: None.

10. A single parity bit can be used for ____________

a) detection
b) multiple error corrections
c) few error corrections

51
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

11. RAID level ______ is also known as memory style error correcting code(ECC)
organization.
a) 1
b) 2
c) 3
d) 4
View Answer
Answer: b
Explanation: None.

12. RAID level 3 does not have _________ as in RAID level 1.

a) efficiency
b) enough storage space for data
c) storage overhead
d) time consumption overhead
View Answer
Answer: c
Explanation: There is one mirror disk for every disk in level 1.

Operating System Questions & Answers – Tertiary Storage

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses
on “Tertiary Storage”.

1. Tertiary storage is built with ____________

a) a lot of money
b) unremovable media
c) removable media
d) secondary storage
View Answer
Answer: c
Explanation: None.

52
2. Floppy disks are examples of ____________
a) primary storage
b) secondary storage
c) tertiary storage
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

3. What is a magneto-optic disk?

a) primary storage
b) secondary storage
c) removable disk
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

4. The magneto-optic head flies ___________ the disk surface than a magnetic disk
head does.
a) much farther from
b) much closer to
c) at the same distance as
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

5. Optical disks ______ magnetism.

a) use
b) do not use
c) may use
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

6. The phase change disk is coated with a material that can freeze into either _______
or ________ state.
a) crystalline, solid
b) ice, amorphous

53
c) crystalline, liquid
d) crystalline, amorphous
View Answer
Answer: d
Explanation: None.

7. WORM stands for ____________

a) write only, read mandatory
b) write once, read many times
c) write only once, read multiple
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

8. A tape holds _______ data than optical or magnetic disk cartridge.

a) lesser
b) more
c) much lesser
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

9. Random access to tape is _______ a disk seek.

a) much slower than
b) much faster than
c) comparable to
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

10. A typical tape drive is ________ a typical disk drive.

a) more expensive than
b) cheaper than
c) of the same cost as
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
54
11. The surface area of tape is ________ the surface area of a disk.
a) much lesser than
b) much larger than
c) equal to
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

55