In an operating system, memory management is essential to ensure processes execute efficiently. One common method is paging, which divides memory into fixed-size blocks. This allows non-contiguous memory allocation and simplifies memory allocation. Which of the following is correct?

It breaks memory into fixed-size blocks to avoid external fragmentation

It allows memory allocation based on process size

It helps in allocating contiguous memory for each process

It increases internal fragmentation significantly

When a process is loaded into memory using paging, its logical address space is divided into pages, and the physical memory is divided into frames. The page table is used for address translation. Which of the following is the correct mapping mechanism?

Logical to physical address using page table

Physical to logical mapping using segments

Frame to segment using base and limit

Segmentation differs from paging by allowing memory to be divided based on logical divisions such as functions, arrays, and data structures. This enables better protection and sharing. What is the major disadvantage of segmentation when compared to paging?

Leads to internal fragmentation

Does not support multiprogramming

In segmentation, a logical address consists of a segment number and an offset. If the offset is larger than the segment limit, what kind of fault does the system generate, and why?

Segment fault due to invalid offset

Page fault due to invalid offset

Memory overflow due to large limit

No error occurs; memory wraps around

Segmentation provides better support for protection and sharing compared to paging. Each segment can have separate permissions and sharing attributes. Which of the following scenarios best demonstrates this advantage of segmentation?

B. Multiple processes sharing a code segment read-only

A. A program accessing its stack segment

C. A process performing I/O operations

D. A program using malloc for dynamic memory

In segmentation with paging, the logical address is divided into three parts: segment number, page number, and offset. This hybrid scheme combines the benefits of both methods. What is the primary motivation behind this approach?

C. Provide efficient memory usage with better protection

A. Simplify address translation

B. Eliminate both internal and external fragmentation

D. Increase context switching time

Lazy swapping or "demand paging" brings a page into memory only when:

An attempt is made to access a location on that page.

The process is first loaded into memory.

The operating system anticipates its need.

Periodically, based on a timer.

What is the primary advantage of using a Translation Lookaside Buffer (TLB) in a paged memory system?

To speed up the translation of logical addresses to physical addresses

To increase the capacity of physical memory

When a page fault occurs, which of the following actions is NOT typically performed by the operating system?

Immediately terminate the faulting process.

Choose a victim frame if all frames are full.

Write the victim page to disk if it is dirty.

Load the desired page from disk into the chosen frame.

A system encounters a page fault, which triggers the operating system to bring the missing page from disk into RAM. If RAM is full, the OS uses a replacement algorithm to choose a page to be removed. What happens if the replaced page was modified?

The page is written back to disk

In a virtual memory system, what condition triggers the need for a page replacement?

Page fault with no free frame available

Consider a process with three segments: code, stack, and data. Each segment is divided into pages in a segmented-paging system. Which table structures are required for correct address translation?

A segment table with individual page tables for each segment

A single segment table for all processes

In paging, all frames in physical memory are of the same size, which matches the page size of processes. Suppose a process requires 10 pages, but physical memory has only 6 free frames. What is the result if demand paging is enabled?

Process partially loads into memory and executes with page faults

Process runs immediately using all frames

OS swaps all pages before execution

When paging is used, address translation becomes crucial. Suppose a virtual address needs to be translated into a physical address. What components are needed and what is the process involved in this translation?

Page number and offset using page table

Base register and segment offset

Frame number and segment number using TLB

Logical block number and physical block

Segmentation can simplify memory protection. Suppose a segment is marked as read-only in a program. What happens if a write operation is attempted on this segment, and why?

Operation proceeds with a warning

Consider a virtual memory system that uses demand paging. The system only loads pages when they are required. Suppose a program accesses a sequence of instructions located across different pages. How does demand paging impact the initial performance?

Causes initial delays due to page faults

Enhances performance by preloading pages

The working set model is used in memory management to predict which pages a process will need in the near future. It considers a window of recent page references. Which of the following best defines the working set?

Set of recently used pages in a fixed time

Random pages accessed previously

MCQ Exam - CO3

Authored by John S

Engineering

University

Used 7+ times

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View

Student View

100 questions

Show all answers

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A process of 120 KB is loaded into a 150 KB partition. How much internal fragmentation occurs?

20 KB

30 KB

10 KB

None

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Convert 512 KB to bytes.

512000

524288

500000

102400

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Identify the external fragmentation if holes are: 100 KB, 300 KB, 150 KB and process = 200 KB

150 KB

100 KB

50 KB

450 KB

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Explain why Best Fit leads to more fragmentation than First Fit with example: 200 KB process

Fits smaller holes

Uses biggest hole

No fragmentation

Always optimal

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Choose the most suitable hole for 125 KB process among using Best Fit

130 KB

140 KB

200 KB

None

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Apply First Fit for a 320 KB process on holes: 300 KB, 400 KB, 350 KB

350 KB

300 KB

400 KB

None

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Determine internal fragmentation when 3 processes use partitions of 256 KB, with sizes 240 KB each

16 KB

48 KB

36 KB

32 KB

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever

or continue with

Microsoft

Apple

Others

Already have an account?

Similar Resources on Wayground

100 questions

Computer Selection Considerations Quiz

Quiz

•

University

Popular Resources on Wayground

10 questions

5.P.1.3 Distance/Time Graphs

Quiz

•

5th Grade

10 questions

Fire Drill

Quiz

•

2nd - 5th Grade

20 questions

Equivalent Fractions

Quiz

•

3rd Grade

22 questions

School Wide Vocab Group 1 Master

Quiz

•

6th - 8th Grade

20 questions

Main Idea and Details

Quiz

•

5th Grade

20 questions

Context Clues

Quiz

•

6th Grade

20 questions

Inferences

Quiz

•

4th Grade

12 questions

What makes Nebraska's government unique?

Quiz

•

4th - 5th Grade

Discover more resources for Engineering

18 questions

Informative or Argumentative essay

Quiz

•

5th Grade - University

20 questions

Disney Trivia

Quiz

•

University

5 questions

Human Impacts: How Do People Disrupt Ecosystems?

Interactive video

•

4th Grade - University

7 questions

Human Body Systems Overview (Updated 2024)

Interactive video

•

11th Grade - University

20 questions

Context Clues

Quiz

•

KG - University

7 questions

Comparing Fractions

Interactive video

•

1st Grade - University

20 questions

10.4 Exponential Functions

Quiz

•

8th Grade - University

30 questions

PSYCH 250: Exam 3

Quiz

•

University

MCQ Exam - CO3

A process of 120 KB is loaded into a 150 KB partition. How much internal fragmentation occurs?

Convert 512 KB to bytes.

Identify the external fragmentation if holes are: 100 KB, 300 KB, 150 KB and process = 200 KB

Explain why Best Fit leads to more fragmentation than First Fit with example: 200 KB process

Choose the most suitable hole for 125 KB process among using Best Fit

Apply First Fit for a 320 KB process on holes: 300 KB, 400 KB, 350 KB

Determine internal fragmentation when 3 processes use partitions of 256 KB, with sizes 240 KB each

Memory allocation strategy causing least fragmentation

Memory allocation technique that wastes more memory but faster

Component resolving external symbols at runtime in dynamic linking

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Engineering