Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

A virtual memory system has an address space of 8 k words, a memory space of 4 k words, and page and block sizes of 1 k words. The number of page faults using LRU policy, for following page references is

1 0 2 4 6 2 1 5 7 0 0

This question was previously asked in
ESE Electronics 2012 Paper 2: Official Paper
Attempt Online
View all UPSC IES Papers >
  1. 5
  2. 7
  3. 9
  4. 10

Answer (Detailed Solution Below)

Option 3 : 9
Free Tests
View all Free tests >
Free
ST 1: UPSC ESE (IES) Civil - Building Materials
6.3 K Users
20 Questions 40 Marks 24 Mins
Start Now

Detailed Solution

Download Solution PDF

Given:

Memory space = 4 K words

Page size = Frame size = 1 K words

∴ frames \(= \frac{{4\;K\;words}}{{1K\;words}} = 4\)

F1 Tapesh 24.11.20 Pallavi D 3

Hence, the Total Number of page faults is 9.

Download Solution PDF
Latest UPSC IES Updates

Last updated on Jun 23, 2025

-> UPSC ESE result 2025 has been released. Candidates can download the ESE prelims result PDF from here.

->  UPSC ESE admit card 2025 for the prelims exam has been released. 

-> The UPSC IES Prelims 2025 will be held on 8th June 2025.

-> The selection process includes a Prelims and a Mains Examination, followed by a Personality Test/Interview.

-> Candidates should attempt the UPSC IES mock tests to increase their efficiency. The UPSC IES previous year papers can be downloaded here.

More Non Contiguous Questions

Q1.Consider a system with page size p and average process size m and size of each page table entry is e. What is the amount of space required by page table ? 
Q2.Which of the following is NOT a base of product related segmentation? 
Q3.The essential content(s) in each entry of a page table is / are :
Q4.Buffer is a device or storage area where data
Q5.Which of the following memory allocation scheme suffers from External fragmentation?
Q6.The memory management scheme that allows the processes to be stored non-contiguously in memory :
Q7.A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table (T1), which occupies exactly one page. Each entry of T1 stores the base address of a page of the second-level table (T2). Each entry of T2 stores the base address of a page of the third-level table (T3). Each entry of T3 stores a page table entry (PTE). The PTE is 32 bits in size. The processor used in the computer has a 1 MB 16-way set associative virtually indexed physically tagged cache. The cache block size is 64 bytes. What is the size of a page in KB in this computer?
Q8.What is the size of the physical address space in a paging system which has a page table containing 64 entries of 11 bit each (including valid/invalid bit) and a page size of 512 bytes?
Q9.Consider the following segment table in segmentation scheme: Segment Id Base Limit 0 200 200 1 5000 1210 2 1527 498 3 2500 50   What happens if the logical address requested is - Segment Id 2 and offset 1000?
Q10.Consider a single-level page table system. with the page table stored in the memory. If the hit rate to TLB is 80%, and it takes 15 nanoseconds to search the TLB. and 150 nanoseconds to access the main memory, then what is the effective memory access time, in nanoseconds ?

More Memory Management Questions

Q1.Consider a system with page size p and average process size m and size of each page table entry is e. What is the amount of space required by page table ? 
Q2.The average time required to search a storage location in memory and obtain its contents is called :  
Q3.Match List-I with List-II List I List II A. LRU I. A page is written to secondary memory only when it has been selected for replacement B. Demand cleaning II. A page that has not been referenced for the longest time is replaced C. Long term scheduling III. The decision to add to the number of processes that are partially or fully in main memory D. Medium term scheduling  IV. The decision to add to the pool of processes to be executed Choose the correct answer from the options given below :
Q4.Given below are two statements: Which of the following statement/s is/are correct with respect to virtual memory Statement I: Address translation is performed for every logical address used during the execution of a program Statement II: A program can execute only when all of its components are loaded in the memory In the light of the above statements, choose the most appropriate answer from the options given below. 
Q5.Match List I with List II LIST - I LIST - II A. IPC I. Resource Allocation B. Demand Paging II. Computational speedup C. Banker's Algorithm III. Task Control Block D. PCB IV. Virtual Memory Choose the correct answer from the options given below: 
Q6.Which of the following is NOT a base of product related segmentation? 
Q7.Match List I with List II: List I List II (A) Firmware (I) Number of logical records into physical blocks (B) Batch file (II) ASCII format (C) Packing (III) Resource allocation (D) Banker's Algorithm (IV) ROM Choose the correct answer from the options given below:
Q8.Which of the following objects require protection?
Q9.The essential content(s) in each entry of a page table is / are :
Q10.Which of the following is the utility program that is used to bring the object code into memory for execution?
Crack GATE Electrical with
India's Super Teachers
Explore Supercoaching For FREE
Suggested Test Series
View All >
UPSC ESE (IES) Civil Mock Test Series
116 Total Tests with 1 Free Tests
Start Free Test
UPSC ESE (IES) Prelims Paper 1 Mock Test Series
54 Total Tests with   1 Free Tests
Start Free Test
Suggested Exams
Exam-Logo
UPSC IES

UPSC IES Important Links

More Operating Systems Questions

Q1.Which of the following is a benefit of scheduling emails?
Q2.Which of the following Page Replacement Algorithm suffers from the Belady’s anomaly ?
Q3.Consider a system with three frames in memory and following memory references in the working set 2 1 2 3 5 4 1 3 4 2 1 How many page fault will be there if we use second chance page replacement algorithm ?
Q4.Which one of the following cannot be scheduled by the kernel ?
Q5.Consider a system with page size p and average process size m and size of each page table entry is e. What is the amount of space required by page table ? 
Q6.Calculate the average response time for these processes with a nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority). Process Arrival Time Burst Time P1 5 3 P2 3 1 P3 2 5 P4 3 4 P5 1 2
Q7.When we apply Shortest Job First (SJF) scheduling Policy/algorithm, Process (P2) faces partial starvation and waits for the longer time to execute. Which one of the following algorithms addresses this problem?
Q8.What is the average waiting time for these processes with non-preemptive Shortest Job First (SJF) scheduling Algorithm?
Q9.What is the average turnaround time for these Processes with First Come First Serve (FCFS) scheduling Algorithm?
Q10.Find the average weighted turnaround time for these process using Highest Response Ratio Next (HRN) Algorithm?
Important Exams
Super Coaching
Exams
Test Series
Previous Year Papers
Objective Questions
Testbook USA SAT Exam
Testbook USA ACT Exam
US College Admissions Guide
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti live teen patti baaz teen patti bodhi teen patti game online teen patti - 3patti cards game downloadable content