Computer Organization and Architecture: Memory : Virtual Memory Concept: Important Example Solved Problems
Example : 1
The logical address space in a computer system consists of 128 segments. Each segment can have up to 32 pages of 4 K words each. Physical memory consists of 4 K blocks of 4 K words in each. Formulate the logical and physical address formats.
Solution :
Number of bits for segment address = log2 128 = log2 27 = 7 bits
Number of bits for page address = log2 32 = log2 25 = 5 bits
Number of bits for word address = log2 4096 = log2 212 = 12 bits
Number of bits for block address = log2 4096 = log2 212 = 12 bits

Example : 2
An address space is specified by 32 bits and corresponding memory space by 24 bits.
i) How many words are there in the address space?
ii) How many words are there in the memory space?
iii) If a page consists of 4 K words, how many pages and blocks are there in the systems.
Solution :
i) Words in the address space = 232 = 4 G words
ii) Words in the memory space = 224 = 16 M words
iii) Number of pages = Words in address space / Words per page = 4 G words / 4 K words
= 1 M pages
iv) Number of blocks = Words in address space / (Words per page/block)
= 16 M words / 4 K blocks = 4 K words
Example : 3
An address space is specified by 24 bits and the corresponding memory space by 16 bits. How many words are there in the virtual memory and in the main memory?
Solution :
Words in the address space, i.e., in the virtual memory
= 224= 16 M words
Words in the memory space, i.e., in the main memory
=224 = 64 K words
Example : 4
Calculate the effective address time if average page‒fault service time of 20 milliseconds and a memory access time of 80 nanoseconds. Let us assume the probability of a page fault 10%
Solution :
Effective access time is given as
= (1 − 0.1) × (80) + 0.1 (20 milliseconds)
= (1 − 0.1) × 80 + 0.1 × 20,000,000 = 72 + 2,000,000 (nanoseconds)
= 2,000,072 (nanoseconds)
Example : 5
Explain page replacement algorithms. Find out page fault for following string using LRU method
60 12 0 30 4 2 30 321 20 15
Consider page frame size = 3.
Solution :

Total page faults = 09
Example : 6
Explain page replacement algorithm. Find out page fault for following string using LRU method. Consider page frame size 3.
7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1.
Solution : Reference string

Total page faults = 15
Computer Organization and Architecture: Chapter 4: Memory and IO : Tag: Computer : - Solved Example Problems on Virtual Memory Concept
Computer Organization and Architecture
CW25201 3rd Semester IT department. | 2025 Regulation | 3rd Semester 2025 Regulation
Discrete Mathematics
MA25C14 3rd Semester CSE,IT,CY,AIDS departments. | 2025 Regulation | 3rd Semester 2025 Regulation
Data Structures
CS25C08 3rd Semester CSE,IT,CY,AIDS departments. | 2025 Regulation | 3rd Semester 2025 Regulation
Computer Organization and Architecture
CW25201 3rd Semester IT department. | 2025 Regulation | 3rd Semester 2025 Regulation
Object Oriented Programming
CS25C07 3rd Semester IT department. | 2025 Regulation | 3rd Semester 2025 Regulation
Web Technologies
IT25301 3rd Semester IT department. | 2025 Regulation | 3rd Semester 2025 Regulation
English Communication Skills Laboratory I
EN25C03 3rd Semester all department. | 2025 Regulation | 3rd Semester 2025 Regulation
Skill Development Course I
3rd Semester all department. | 2025 Regulation | 3rd Semester 2025 Regulation