wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Understanding Memory Management Concepts

Total questions: 100

Worksheet time: 1hrs 22mins

Name
Class
Date
1.

What is memory management in computer systems?

a)

Memory management is the process of coordinating and handling computer memory allocation, use, and release.

b)

Memory management refers to the physical size of the hard drive.

c)

Memory management is the method of organizing software applications.

d)

Memory management is the process of increasing CPU speed.

2.

Explain the difference between paging and segmentation.

a)

Paging uses fixed-size pages; segmentation uses variable-sized segments.

b)

Paging allows for variable-sized pages; segmentation allows for fixed-size segments.

c)

Paging is used for virtual memory; segmentation is used for physical memory.

d)

Paging divides memory into segments; segmentation divides memory into pages.

3.

What is contiguous memory allocation?

a)

Contiguous memory allocation is a method of allocating a single contiguous block of memory to a process.

b)

It is a method of allocating memory in a non-linear fashion.

c)

Contiguous memory allocation involves dividing memory into multiple segments.

d)

Contiguous memory allocation allows processes to share memory blocks.

4.

Define non-contiguous memory allocation.

a)

Non-contiguous memory allocation is a method of allocating memory in a single, continuous block.

b)

Non-contiguous memory allocation is a technique that only allows for fixed-size memory blocks.

c)

Non-contiguous memory allocation requires all memory blocks to be adjacent to each other.

d)

Non-contiguous memory allocation is a method of allocating memory in separate, non-adjacent blocks.

5.

What is the first fit memory allocation strategy?

a)

The first fit memory allocation strategy allocates the first suitable memory block found.

b)

The first fit strategy requires all memory blocks to be contiguous.

c)

The first fit strategy allocates memory blocks in a random order.

d)

The first fit strategy allocates the largest available memory block.

6.

Describe the best fit memory allocation strategy.

a)

Best fit memory allocation strategy requires all memory blocks to be of equal size.

b)

Best fit memory allocation strategy randomly allocates memory without considering size.

c)

Best fit memory allocation strategy uses the largest available memory block.

d)

Best fit memory allocation strategy minimizes wasted space by allocating the smallest suitable memory block.

7.

What are the advantages of worst fit memory allocation?

a)

Higher fragmentation compared to best fit

b)

Slower allocation times for small processes

c)

Advantages of worst fit memory allocation include reduced fragmentation and better accommodation for larger processes.

d)

Increased memory usage due to larger allocations

8.

How does paging help in memory management?

a)

Paging eliminates the need for virtual memory entirely.

b)

Paging increases memory fragmentation by using variable-size pages.

c)

Paging allows efficient memory management by using fixed-size pages, reducing fragmentation, and enabling easier swapping.

d)

Paging requires all processes to be loaded into physical memory simultaneously.

9.

What are the disadvantages of contiguous memory allocation?

a)

Disadvantages include fragmentation, difficulty in resizing, limited allocation of large blocks, and potential security issues.

b)

No security vulnerabilities

c)

Easy to resize allocations

d)

Efficient use of memory

10.

Explain how segmentation can improve memory utilization.

a)

Segmentation only benefits CPU performance, not memory utilization.

b)

Segmentation improves memory utilization by allowing dynamic allocation of memory segments, reducing fragmentation and enabling better fitting of segments into available memory.

c)

Segmentation has no impact on memory fragmentation.

d)

Segmentation increases memory usage by allocating fixed-size blocks.

11.

What is the purpose of a page table in a paging system?

a)

To keep track of the size of each memory segment.

b)

To manage the allocation of contiguous memory blocks.

c)

To map virtual addresses to physical addresses for efficient memory access.

d)

To store the physical addresses of all processes in memory.

12.

How does fragmentation affect memory allocation?

a)

Fragmentation can lead to inefficient use of memory and allocation failures.

b)

Fragmentation only occurs in non-contiguous memory allocation.

c)

Fragmentation has no impact on memory allocation.

d)

Fragmentation improves memory allocation by allowing more processes to fit in memory.

13.

What is the role of the operating system in memory management?

a)

The operating system only manages virtual memory.

b)

The operating system does not interact with memory management.

c)

The operating system allocates, tracks, and frees memory for processes, ensuring efficient use of resources.

d)

The operating system is responsible for managing hardware components only.

14.

What is the purpose of segmentation in memory management?

a)

Segmentation allows for the division of memory into variable-sized segments based on logical divisions.

b)

Segmentation is used to allocate fixed-size memory blocks only.

c)

Segmentation is primarily concerned with CPU scheduling.

d)

Segmentation does not impact memory allocation strategies.

15.

What are the characteristics of the best fit memory allocation strategy?

a)

Best fit allocates the largest available block to ensure maximum usage.

b)

Best fit minimizes wasted space by allocating the smallest available block that fits the request.

c)

Best fit requires all memory blocks to be of equal size.

d)

Best fit randomly allocates memory without considering the size of the request.

16.

How does the operating system handle memory fragmentation?

a)

The operating system only addresses fragmentation in virtual memory.

b)

The operating system ignores fragmentation as it does not affect performance.

c)

The operating system increases fragmentation by allocating memory randomly.

d)

The operating system can use techniques like compaction to reduce fragmentation.

17.

What is the primary advantage of using virtual memory?

a)

Virtual memory allows for the execution of processes that do not fit entirely in physical memory.

b)

Virtual memory requires all processes to be loaded into physical memory simultaneously.

c)

Virtual memory eliminates the need for any physical memory.

d)

Virtual memory increases the speed of the CPU.

18.

What is the role of a memory manager in an operating system?

a)

The memory manager is not involved in memory allocation.

b)

The memory manager only tracks the physical memory size.

c)

The memory manager is responsible for allocating and deallocating memory space as needed by processes.

d)

The memory manager only manages virtual memory.

19.

How does the concept of thrashing affect system performance?

a)

Thrashing has no impact on system performance.

b)

Thrashing occurs when the system spends more time swapping pages in and out of memory than executing processes, leading to decreased performance.

c)

Thrashing only affects the CPU speed, not memory management.

d)

Thrashing improves system performance by optimizing memory usage.

20.

What is the impact of memory leaks on system performance?

a)

Memory leaks only affect CPU speed, not memory management.

b)

Memory leaks improve system performance by optimizing memory usage.

c)

Memory leaks can lead to reduced available memory over time, causing performance degradation and potential system crashes.

d)

Memory leaks have no effect on system performance.

21.

How does the operating system utilize page replacement algorithms?

a)

Page replacement algorithms are not used in modern operating systems.

b)

Page replacement algorithms help determine which pages to swap out of physical memory when new pages need to be loaded.

c)

Page replacement algorithms only apply to virtual memory management.

d)

Page replacement algorithms are used to increase fragmentation.

22.

What is the significance of the working set model in memory management?

a)

The working set model is irrelevant to memory management strategies.

b)

The working set model helps in determining the optimal amount of memory to allocate to processes based on their recent usage patterns.

c)

The working set model only applies to CPU scheduling.

d)

The working set model is used to track the total memory size of all processes.

23.

What is the function of a page frame in a paging system?

a)

To store the physical addresses of all processes in memory.

b)

To serve as a fixed-size block of physical memory that can hold a page of data.

c)

To manage the allocation of contiguous memory blocks.

d)

To keep track of the size of each memory segment.

24.

How does the operating system implement demand paging?

a)

By loading pages into memory only when they are needed, reducing memory usage.

b)

By allocating memory in a contiguous manner.

c)

By using a fixed-size memory allocation strategy.

d)

By loading all pages of a process into memory at once.

25.

What is the purpose of a swap space in memory management?

a)

To manage the allocation of contiguous memory blocks.

b)

To provide additional physical memory for processes.

c)

To temporarily hold pages that are not currently in use, allowing for more efficient memory management.

d)

To store the physical addresses of all processes in memory.

26.

What is the difference between logical and physical memory addresses?

a)

Logical addresses are generated by the CPU; physical addresses are generated by the memory unit.

b)

Logical addresses are fixed; physical addresses are variable.

c)

Logical addresses refer to the actual location in memory; physical addresses are abstract representations.

d)

Logical addresses are used for disk storage; physical addresses are used for RAM.

27.

What is the purpose of a memory allocation algorithm?

a)

To track the physical size of the hard drive.

b)

To determine how memory is allocated to processes and manage memory efficiently.

c)

To manage the execution of processes in the CPU.

d)

To increase the speed of the CPU.

28.

How does the concept of page fault affect system performance?

a)

Page faults have no impact on performance.

b)

Page faults occur when a process tries to access a page not currently in memory, leading to delays as the page is loaded from disk.

c)

Page faults improve performance by optimizing memory usage.

d)

Page faults only affect the CPU speed, not memory management.

29.

What is the impact of a high page replacement rate on system performance?

a)

A high page replacement rate has no effect on performance.

b)

A high page replacement rate improves performance by optimizing memory usage.

c)

A high page replacement rate only affects the CPU speed, not memory management.

d)

A high page replacement rate can lead to increased latency and reduced throughput as more time is spent swapping pages.

30.

How does the operating system determine which pages to swap out in a demand paging system?

a)

The operating system randomly selects pages to swap out.

b)

The operating system uses algorithms like LRU (Least Recently Used) to determine which pages to swap out based on usage patterns.

c)

The operating system swaps out pages based on their physical memory addresses.

d)

The operating system does not manage which pages to swap out in demand paging.

31.

What is the role of a frame in a paging system?

a)

A frame is a fixed-size block of physical memory that holds a page of data.

b)

A frame is used to store the logical addresses of processes.

c)

A frame is a variable-sized memory block used for dynamic memory allocation.

d)

A frame is a method for managing CPU scheduling.

32.

What is the purpose of a segmentation table in a segmentation system?

a)

To map logical addresses to physical addresses for segments.

b)

To keep track of the size of each page in a paging system.

c)

To manage the allocation of contiguous memory blocks.

d)

To store the physical addresses of all processes in memory.

33.

What are the characteristics of the worst fit memory allocation strategy?

a)

Worst fit allocates the smallest available block to minimize wasted space.

b)

Worst fit minimizes fragmentation by allocating the largest available block.

c)

Worst fit requires all memory blocks to be of equal size.

d)

Worst fit randomly allocates memory without considering the size of the request.

34.

How does the operating system handle page faults in a virtual memory system?

a)

The operating system loads the required page from disk into memory and updates the page table.

b)

The operating system randomly selects a page to swap out.

c)

The operating system only handles page faults in contiguous memory allocation.

d)

The operating system ignores page faults and continues execution.

35.

What is the role of the page replacement policy in a virtual memory system?

a)

The page replacement policy is irrelevant to memory management.

b)

The page replacement policy is used to allocate contiguous memory blocks.

c)

The page replacement policy determines which pages to keep in memory and which to swap out when new pages are needed.

d)

The page replacement policy only affects CPU scheduling.

36.

How does the concept of thrashing impact system performance?

a)

Thrashing only affects the CPU speed, not memory management.

b)

Thrashing has no impact on system performance.

c)

Thrashing improves performance by optimizing memory usage.

d)

Thrashing occurs when a system spends more time swapping pages in and out of memory than executing processes, leading to severe performance degradation.

37.

What is the significance of the page size in a paging system?

a)

The page size determines the total amount of physical memory available.

b)

The page size is only relevant for CPU scheduling.

c)

The page size has no impact on memory management.

d)

The page size affects the efficiency of memory usage and the frequency of page faults.

38.

What is the role of a frame in a paging system?

a)

A frame is used to store the logical addresses of processes.

b)

A frame is a method for managing disk storage.

c)

A frame is a variable-sized block of memory used for dynamic allocation.

d)

A frame is a fixed-size block of physical memory that holds a page of data.

39.

What is the purpose of demand paging in memory management?

a)

Demand paging allows processes to be loaded into memory only when needed, reducing memory usage.

b)

Demand paging increases the speed of the CPU.

c)

Demand paging requires all pages to be loaded into memory at startup.

d)

Demand paging eliminates the need for virtual memory.

40.

How does the Least Recently Used (LRU) algorithm function in page replacement?

a)

LRU requires all pages to be loaded into memory simultaneously.

b)

LRU replaces the page that has not been used for the longest period of time.

c)

LRU randomly selects a page to replace.

d)

LRU replaces the most recently used page.

41.

What is the primary function of a memory allocator in an operating system?

a)

To track the physical size of the hard drive.

b)

To allocate and deallocate memory blocks as required by processes.

c)

To optimize CPU scheduling.

d)

To manage the execution of processes in the CPU.

42.

What is the purpose of a page table in a virtual memory system?

a)

To manage the allocation of contiguous memory blocks.

b)

To keep track of the size of each memory segment.

c)

To map logical addresses to physical addresses.

d)

To store the physical addresses of all processes in memory.

43.

How does the operating system utilize segmentation in memory management?

a)

Segmentation is used to allocate memory based on logical divisions of a process.

b)

Segmentation allows for the division of memory into fixed-size blocks.

c)

Segmentation is primarily concerned with CPU scheduling.

d)

Segmentation has no impact on memory allocation strategies.

44.

What is the role of a page fault in a virtual memory system?

a)

A page fault occurs when all pages are loaded into memory.

b)

A page fault is a normal operation that does not require any action from the operating system.

c)

A page fault indicates that the system has run out of physical memory.

d)

A page fault occurs when a program accesses a page that is not currently mapped to physical memory, triggering the operating system to load the page from disk.

45.

How does the FIFO (First In, First Out) page replacement algorithm work?

a)

FIFO requires all pages to be loaded into memory at once.

b)

FIFO randomly selects a page to replace.

c)

FIFO replaces the most recently used page.

d)

FIFO replaces the page that has been in memory the longest, regardless of how often it has been used.

46.

What is the impact of using a larger page size in a paging system?

a)

A larger page size can reduce the number of page faults but may increase internal fragmentation.

b)

A larger page size has no effect on memory management.

c)

A larger page size increases the frequency of page faults.

d)

A larger page size decreases the amount of physical memory required.

47.

What is the role of a swap space in a virtual memory system?

a)

Swap space is only used for temporary files.

b)

Swap space eliminates the need for physical memory.

c)

Swap space is a method for managing CPU scheduling.

d)

Swap space is used to store pages that are not currently in physical memory.

48.

How does the operating system implement memory compaction?

a)

By rearranging memory contents to eliminate fragmentation and create larger contiguous blocks.

b)

By randomly selecting memory blocks to compact.

c)

By increasing the size of the physical memory.

d)

By allocating memory in a fixed-size manner.

49.

What is the significance of the page replacement algorithm in a paging system?

a)

It tracks the size of each memory segment.

b)

It manages the allocation of contiguous memory blocks.

c)

It eliminates the need for virtual memory.

d)

It determines which pages to remove from memory when new pages need to be loaded.

50.

What is the purpose of a segmentation fault in memory management?

a)

A segmentation fault occurs when all memory segments are loaded into memory.

b)

A segmentation fault is a normal operation that does not require any action from the operating system.

c)

A segmentation fault is used to track the total memory size of all processes.

d)

A segmentation fault indicates that a program has accessed a memory segment that it is not allowed to access.

51.

What are the advantages of using a buddy memory allocation system?

a)

Buddy memory allocation is only applicable to virtual memory management.

b)

Buddy memory allocation increases fragmentation by using variable-size blocks.

c)

Buddy memory allocation simplifies memory management by dividing memory into fixed-size blocks.

d)

Buddy memory allocation requires all memory blocks to be of equal size.

52.

How does the operating system manage shared memory between processes?

a)

The operating system only allows one process to access shared memory at a time.

b)

The operating system uses shared memory to increase fragmentation.

c)

The operating system allocates shared memory segments and ensures synchronization between processes accessing them.

d)

The operating system does not manage shared memory; it is handled entirely by the processes.

53.

What is the primary advantage of using virtual memory in an operating system?

a)

It increases the speed of the CPU.

b)

It eliminates the need for physical memory.

c)

It simplifies the memory allocation process.

d)

It allows for the execution of processes that require more memory than is physically available.

54.

How does the operating system ensure memory protection between processes?

a)

By implementing access control mechanisms and using separate address spaces for each process.

b)

By using a single memory space for all processes.

c)

By allowing processes to directly access each other's memory.

d)

By disabling memory management features.

55.

What is the purpose of a memory leak detection tool?

a)

To identify and help recover memory that is no longer in use but has not been released.

b)

To increase the speed of the CPU.

c)

To manage the physical memory size of the system.

d)

To allocate more memory to processes.

56.

How does the operating system ensure data consistency in memory management?

a)

By using a single process to manage all memory operations.

b)

By allowing multiple processes to write to the same memory location simultaneously.

c)

By ignoring data consistency as it does not affect performance.

d)

By implementing locking mechanisms and ensuring proper synchronization between processes.

57.

What is the role of the swap space in virtual memory management?

a)

Swap space increases the physical memory size of the system.

b)

Swap space is irrelevant to virtual memory management.

c)

Swap space is a reserved area on the disk used to hold pages that are not currently in physical memory.

d)

Swap space is used to store data that is currently being processed by the CPU.

58.

Which of the following is a method of memory management that involves dividing memory into fixed-size units?

a)

Segmentation

b)

Paging

c)

Virtual Memory

d)

Defragmentation

59.

What is the primary function of memory management in a computer system?

a)

To increase the speed of the CPU

b)

To manage the allocation and deallocation of memory

c)

To enhance the graphics performance

d)

To control the input and output devices

60.

In the context of memory management, what does segmentation refer to?

a)

Dividing memory into equal-sized pages

b)

Dividing memory into variable-sized segments

c)

Combining multiple programs into a single block

d)

Allocating memory based on user priority

61.

What is virtual memory primarily used for in a computer system?

a)

To increase the physical size of RAM

b)

To allow a computer to compensate for shortages of physical memory

c)

To enhance the speed of the hard drive

d)

To store permanent data

62.

What is the main challenge with moving programs in memory to create contiguous free space?

a)

It is time-consuming and complex

b)

It requires additional hardware

c)

It decreases the speed of the CPU

d)

It increases the risk of data loss

63.

What happens to the operating system when a computer first starts up?

a)

It is loaded into the hard drive

b)

It is loaded into random access memory (RAM)

c)

It is deleted from memory

d)

It is compressed to save space

64.

What is the primary disadvantage of moving programs in memory to create contiguous free space?

a)

It requires additional software

b)

It can lead to fragmentation

c)

It is not possible with modern operating systems

d)

It is a complex and resource-intensive process

65.

Which of the following best describes the concept of paging in memory management?

a)

Dividing memory into variable-sized segments

b)

Dividing memory into fixed-size pages

c)

Allocating memory based on user priority

d)

Combining multiple programs into a single block

66.

Which type of operating system allows multiple users to access a single system simultaneously?

a)

Batch Operating System

b)

Time-Sharing Operating System

c)

Distributed Operating System

d)

Handheld Operating System

67.

Which scheduler is responsible for moving processes between ready and run queues?

a)

Long-term scheduler

b)

Short-term scheduler

c)

Medium-term scheduler

d)

Job scheduler

68.

What is the primary function of the file system manager in an operating system?

a)

Allocation and deallocation of memory

b)

Control of peripheral devices

c)

Manipulation of files and directories

d)

Scheduling tasks for processing

69.

What is the main purpose of the medium-term scheduler?

a)

To determine which programs should be admitted to the system

b)

To improve system performance

c)

To manage the swapping of processes in and out of memory

d)

To switch between user and kernel mode

70.

Which type of real-time operating system is designed for applications with strict time constraints?

a)

Hard Real-Time Systems

b)

Soft Real-Time Systems

c)

Handheld Operating Systems

d)

Batch Operating Systems

71.

What is the formula for Turn Around Time (TaT)?

a)

TaT = Completion Time - Arrival Time

b)

TaT = Arrival Time - Completion Time

c)

TaT = Burst Time - Waiting Time

d)

TaT = Waiting Time - Burst Time

72.

Which scheduling algorithm uses time slices?

a)

First Come First Serve

b)

Shortest Job First

c)

Round Robin

d)

Priority Scheduling

73.

What was the first operating system introduced during the Second Generation of computers?

a)

DOS

b)

Unix

c)

Fortran Monitor System

d)

Windows

74.

What is the purpose of disk scheduling algorithms?

a)

To increase disk seek time

b)

To maximize rotational latency

c)

To reduce the total seek time

d)

To increase disk access time

75.

What is context switching?

a)

Switching between user and kernel mode

b)

Saving the context of one process and loading the context of another process

c)

Switching between different I/O devices

d)

Allocating memory to a new process

76.

Which type of scheduling algorithm schedules processes according to their arrival times?

a)

Round Robin

b)

Shortest Job First

c)

First Come First Serve

d)

Priority Scheduling

77.

22. Which operating system type is characterized by several interconnected computers communicating via a shared network?

a)

Batch Operating System

b)

Time-Sharing Operating System

c)

Distributed Operating System

d)

Network Operating System

78.

Which section of a process contains the current activity represented by the value of the program counter?

a)

Text Section

b)

Stack

c)

Data Section

d)

Heap Section

79.

Dynamically allocated memory to process during it's run time

a)

text section

b)

data section

c)

stack

d)

heap section

80.

When managing memory, the OS can use a technique called PAGING. How is memory organised in paging?

a)

Fixed size blocks

b)

Variable size blocks

81.

When the OS is managing memory, PAGING uses:

a)

Logical addressing

b)

Physical addressing

82.

When the OS is managing memory, SEGMENTATION uses:

a)

Logical addressing

b)

Physical addressing

83.

What is the name used to describe what happens when idle processes are moved from RAM to the swap file?

a)

Interrupt

b)

Thrashing

c)

Page In

d)

Page Out

84.

There are two types of optimisation techniques used by a OS, they are ...

a)

Paging

b)

Planning

c)

Segmentation

d)

Segregation

85.

Paging ...

a)

Splits programs into different sizes across memory

b)

Splits programs into the same size across memory

c)

Moves the data around

d)

Allows data to be non-contiguously stored

86.

Segmentation ...

a)

Does not store items not currently in use into secondary storage

b)

Splits programs into different sizes across memory

c)

Moves the data around

d)

Allows data to be contiguously stored

87.

Disk thrashing is when ...

a)

The memory controller spends too much time swapping between RAM and ROM

b)

The memory controller spends too much time swapping between memory and virtual memory

c)

The memory controller spends too much time swapping between the SSD and virtual memory

d)

The memory controller spends too much time swapping between memory and RAM

88.

One technique for overcoming external fragmentation is __________ .

a)

loading

b)

compaction

c)

relocation

d)

partitioning

89.

______ mechanism is known to be moving a process temporarily out of memory for making available for another process

a)

Context Switching

b)

Paging

c)

Swapping

d)

Segmenting

90.

Loading a page only when needed is called

a)

Paging

b)

Page pulling

c)

Both A and B

d)

Demand Paging

91.

TLB stands for

a)

Transmit Load Balancing

b)

Thread Local Buffer

c)

True Launch Bar

d)

Translation Look-aside Buffer

92.

What is the other name for page fault

a)

Page Hit

b)

Page Flop

c)

Page Miss

d)

None of the above

93.

CPU fetches the instruction from memory according to the value of ____________

a)

status register

b)

instruction register

c)

program counter

d)

program status word

94.
What is defragmentation?
a)
Rearranging files to occupy contiguous space.
b)
Speeding up processing.
c)
Rearranging the RAM.
d)
Rearranging processes queued for processing.
95.

When the OS is managing memory, SEGMENTATION uses:

a)

Logical addressing

b)

Physical addressing

96.
When the OS creates temporary RAM on the Hard Drive it is known as...
a)
Virtual Memory
b)
Cache
c)
Registering
d)
Defragmenting
97.
CPU cache has lower access time than RAM
a)
true
b)
FALSE
98.
The CPU cache stores
a)
Only instructions
b)
Word documents
c)
Frequently accessed data and instructions
d)
A list of IP addresses
99.

Whenever the data is found in the cache memory it is called as _________

a)

HIT

b)

MISS

c)

FOUND

d)

ERROR

100.

Which part of the CPU reads the cache?

a)

CPU Clock

b)

Arithmatic Logic Unit

c)

CPU Bus

d)

Control Unit