Question 1

Logical memory is broken into blocks of the same size called___________

Accepted Answer

A) frames 
B) pages 
C) backing store 
D) none of the mentioned 
A) frames 
B) pages 
C) backing store 
D) none of the mentioned B

Question 2

A solution to the problem of external fragmentation is___________

Accepted Answer

A) compaction 
B) larger memory space 
C) smaller memory space 
D) none of the mentioned 
A) compaction 
B) larger memory space 
C) smaller memory space 
D) none of the mentioned A

Question 3

Every address generated by the CPU is divided into two parts. They are

Accepted Answer

A) frame bit & page number 
B) page number & page offset 
C) page offset & frame bit 
D) frame offset & page offset 
A) frame bit & page number 
B) page number & page offset 
C) page offset & frame bit 
D) frame offset & page offset B

Question 4

The address of a page table in memory is pointed by___________

Accepted Answer

A) stack pointer 
B) page table base register 
C) page register 
D) program counter 
A) stack pointer 
B) page table base register 
C) page register 
D) program counter

Question 5

Another solution to the problem of external fragmentation problem is to___________

Accepted Answer

A) permit the logical address space of a process to be noncontiguous 
B) permit smaller processes to be allocated memory at last 
C) permit larger processes to be allocated memory at last 
D) all of the mentioned 
A) permit the logical address space of a process to be noncontiguous 
B) permit smaller processes to be allocated memory at last 
C) permit larger processes to be allocated memory at last 
D) all of the mentioned

Question 6

If relocation is static and is done at assembly or load time, compaction

Accepted Answer

A) cannot be done 
B) must be done 
C) must not be done 
D) can be done 
A) cannot be done 
B) must be done 
C) must not be done 
D) can be done

Question 7

Physical memory is broken into fixed-sized blocks called___________

Accepted Answer

A) frames 
B) pages 
C) backing store 
D) none of the mentioned 
A) frames 
B) pages 
C) backing store 
D) none of the mentioned

Question 8

Transient operating system code is code that___________

Accepted Answer

A) is not easily accessible 
B) comes and goes as needed 
C) stays in the memory always 
D) never enters the memory space 
A) is not easily accessible 
B) comes and goes as needed 
C) stays in the memory always 
D) never enters the memory space

Question 9

The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is___________

Accepted Answer

A) the cost incurred 
B) the memory used 
C) the cpu used 
D) all of the mentioned 
A) the cost incurred 
B) the memory used 
C) the cpu used 
D) all of the mentioned

Question 10

The page table contains___________

Accepted Answer

A) base address of each page in physical memory 
B) page offset 
C) page size 
D) none of the mentioned 
A) base address of each page in physical memory 
B) page offset 
C) page size 
D) none of the mentioned

Question 11

When the memory allocated to a process is slightly larger than the process, then

Accepted Answer

A) internal fragmentation occurs 
B) external fragmentation occurs 
C) both internal and external fragmentation occurs 
D) neither internal nor external fragmentation occurs 
A) internal fragmentation occurs 
B) external fragmentation occurs 
C) both internal and external fragmentation occurs 
D) neither internal nor external fragmentation occurs

Question 12

The operating system and the other processes are protected from being modified by an already running process because

Accepted Answer

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

Question 13

In internal fragmentation, memory is internal to a partition and___________

Accepted Answer

A) is being used 
B) is not being used 
C) is always used 
D) none of the mentioned 
A) is being used 
B) is not being used 
C) is always used 
D) none of the mentioned

Question 14

What is compaction?

Accepted Answer

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

Question 15

Sometimes the overhead of keeping track of a hole might be___________

Accepted Answer

A) larger than the memory 
B) larger than the hole itself 
C) very small 
D) all of the mentioned 
A) larger than the memory 
B) larger than the hole itself 
C) very small 
D) all of the mentioned

Question 16

Using transient code,___________the size of the operating system during program execution.

Accepted Answer

A) increases 
B) decreases 
C) changes 
D) maintains 
A) increases 
B) decreases 
C) changes 
D) maintains

Question 17

What is the operating system?

Accepted Answer

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

Question 18

The first fit, best fit and worst fit are strategies to select a___________

Accepted Answer

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

Question 19

The relocation register helps in

Accepted Answer

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

Question 20

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

Accepted Answer

A) the number of partitions 
B) the cpu utilization 
C) the memory size 
D) all of the mentioned 
A) the number of partitions 
B) the cpu utilization 
C) the memory size 
D) all of the mentioned

Exam 16: Memory Management in Operating Systems

Logical memory is broken into blocks of the same size called___________

A solution to the problem of external fragmentation is___________

Every address generated by the CPU is divided into two parts. They are

The address of a page table in memory is pointed by___________

Another solution to the problem of external fragmentation problem is to___________

If relocation is static and is done at assembly or load time, compaction

Physical memory is broken into fixed-sized blocks called___________

Transient operating system code is code that___________

The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is___________

The page table contains___________

When the memory allocated to a process is slightly larger than the process, then

The operating system and the other processes are protected from being modified by an already running process because

In internal fragmentation, memory is internal to a partition and___________

What is compaction?

Sometimes the overhead of keeping track of a hole might be___________

Using transient code,___________the size of the operating system during program execution.

What is the operating system?

The first fit, best fit and worst fit are strategies to select a___________

The relocation register helps in

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

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 and Swapping Techniques

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