Question 1

What is Dynamic loading?

Accepted Answer

A) loading multiple routines dynamically 
B) loading a routine only when it is called 
C) loading multiple routines randomly 
D) none of the mentioned 
A) loading multiple routines dynamically 
B) loading a routine only when it is called 
C) loading multiple routines randomly 
D) none of the mentioned B

Question 2

The run time mapping from virtual to physical addresses is done by a hardware device called the___________

Accepted Answer

A) virtual to physical mapper 
B) memory management unit 
C) memory mapping unit 
D) none of the mentioned 
A) virtual to physical mapper 
B) memory management unit 
C) memory mapping unit 
D) none of the mentioned B

Question 3

The backing store is generally a

Accepted Answer

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 
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 D

Question 4

Binding of instructions and data to memory addresses can be done at___________

Accepted Answer

A) compile time 
B) load time 
C) execution time 
D) all of the mentioned 
A) compile time 
B) load time 
C) execution time 
D) all of the mentioned

Question 5

CPU fetches the instruction from memory according to the value of___________

Accepted Answer

A) program counter 
B) status register 
C) instruction register 
D) program status word 
A) program counter 
B) status register 
C) instruction register 
D) program status word

Question 6

Which one of the following is the address generated by CPU?

Accepted Answer

A) physical address 
B) absolute address 
C) logical address 
D) none of the mentioned 
A) physical address 
B) absolute address 
C) logical address 
D) none of the mentioned

Question 7

The size of a process is limited to the size of___________

Accepted Answer

A) physical memory 
B) external storage 
C) secondary storage 
D) none of the mentioned 
A) physical memory 
B) external storage 
C) secondary storage 
D) none of the mentioned

Question 8

The___________    time in a swap out of a running process and swap in of a new process into the memory is very high.

Accepted Answer

A) context - switch 
B) waiting 
C) execution 
D) all of the mentioned 
A) context - switch 
B) waiting 
C) execution 
D) all of the mentioned

Question 9

Swapping___________be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers.

Accepted Answer

A) must 
B) can 
C) must never 
D) maybe 
A) must 
B) can 
C) must never 
D) maybe

Question 10

The___________        swaps processes in and out of the memory.

Accepted Answer

A) memory manager 
B) cpu 
C) cpu manager 
D) user 
A) memory manager 
B) cpu 
C) cpu manager 
D) user

Question 11

The address loaded into the memory address register of the memory is referred to as___________

Accepted Answer

A) physical address 
B) logical address 
C) neither physical nor logical 
D) none of the mentioned 
A) physical address 
B) logical address 
C) neither physical nor logical 
D) none of the mentioned

Question 12

If binding is done at assembly or load time, then the process___________be moved to different locations after being swapped out and in again.

Accepted Answer

A) can 
B) must 
C) can never 
D) may 
A) can 
B) must 
C) can never 
D) may

Question 13

What is the advantage of dynamic loading?

Accepted Answer

A) a used routine is used multiple times 
B) an unused routine is never loaded 
C) cpu utilization increases 
D) all of the mentioned 
A) a used routine is used multiple times 
B) an unused routine is never loaded 
C) cpu utilization increases 
D) all of the mentioned

Question 14

In a system that does not support swapping___________

Accepted Answer

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 
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

Question 15

Run time mapping from virtual to physical address is done by___________

Accepted Answer

A) memory management unit 
B) cpu 
C) pci 
D) none of the mentioned 
A) memory management unit 
B) cpu 
C) pci 
D) none of the mentioned

Question 16

Swapping requires a___________

Accepted Answer

A) motherboard 
B) keyboard 
C) monitor 
D) backing store 
A) motherboard 
B) keyboard 
C) monitor 
D) backing store

Question 17

The___________  consists of all processes whose memory images are in the backing store or in memory and are ready to run.

Accepted Answer

A) wait queue 
B) ready queue 
C) cpu 
D) secondary storage 
A) wait queue 
B) ready queue 
C) cpu 
D) secondary storage

Question 18

The idea of overlays is to___________

Accepted Answer

A) data that are needed at any given time 
B) enable a process to be larger than the amount of memory allocated to it 
C) keep in memory only those instructions 
D) all of the mentioned 
A) data that are needed at any given time 
B) enable a process to be larger than the amount of memory allocated to it 
C) keep in memory only those instructions 
D) all of the mentioned

Question 19

If execution time binding is being used, then a process___________  be swapped to a different memory space.

Accepted Answer

A) has to be 
B) can never 
C) must 
D) may 
A) has to be 
B) can never 
C) must 
D) may

Question 20

A memory buffer used to accommodate a speed differential is called___________

Accepted Answer

A) stack pointer 
B) cache 
C) accumulator 
D) disk buffer 
A) stack pointer 
B) cache 
C) accumulator 
D) disk buffer

Exam 15: Memory Management and Swapping Techniques

What is Dynamic loading?

The run time mapping from virtual to physical addresses is done by a hardware device called the___________

The backing store is generally a

Binding of instructions and data to memory addresses can be done at___________

CPU fetches the instruction from memory according to the value of___________

Which one of the following is the address generated by CPU?

The size of a process is limited to the size of___________

The___________ time in a swap out of a running process and swap in of a new process into the memory is very high.

Swapping___________be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers.

The___________ swaps processes in and out of the memory.

The address loaded into the memory address register of the memory is referred to as___________

If binding is done at assembly or load time, then the process___________be moved to different locations after being swapped out and in again.

What is the advantage of dynamic loading?

In a system that does not support swapping___________

Run time mapping from virtual to physical address is done by___________

Swapping requires a___________

The___________ consists of all processes whose memory images are in the backing store or in memory and are ready to run.

The idea of overlays is to___________

If execution time binding is being used, then a process___________ be swapped to a different memory space.

A memory buffer used to accommodate a speed differential is called___________

Operating System

Operating System and Software

Operating System and Computer Basics: Formatting, Clipboard, Radio Buttons, Bankers Algorithm, and More

Computer Software and Operating System

Processor and Memory Fundamentals

Computer Architecture and Memory

Computer Science and Information Technology on Raid, Middleware, and CPU Scheduling

Understanding Process Scheduling in Operating Systems

Operating System and Process Management

Process Scheduling and Synchronization in Multi-Programming Environment

Process Management and Interprocess Communication in Unix

Semaphores, Spinlocks, and Monitors: Understanding Synchronization in Operating Systems

Concurrency Control and Deadlock Prevention in Operating Systems

Deadlock and Resource Allocation in Computer Systems

Memory Management in Operating Systems

Understanding Paging and Memory Management in Operating Systems

Understanding Virtual Memory and Page Replacement Algorithms

Virtual Memory, Segmentation, and Disk Management

Disk Management and I/O Subsystem

Linux Kernel and System Structures

Thread Management and Synchronization in Operating Systems

Operating System Concepts: System Calls, Threads, and Signals

Operating System and Thread Pool

Operating System and Memory Management

Process Control and Memory Management

Linux Kernel, File Systems, Bootloaders and Distributions

Filters