Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More
Hindi
English

Question

Download Solution PDF

आभासी पृष्ठ संदर्भ (वर्चुअल पेज रेफरेंस) श्रृंखला 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 पर विचार करें। माना कम्प्यूटर निकाय का मुख्य स्मृति आकार 3 पेज फ्रेम का है, जो शुरूआत में खाली है तथायह  अभियाचना पृष्ठांकन स्मृति प्रणाली (ऑन-डिमान्ड पेज्ड मेमोरी सिस्टम) चला नीति (LRU & FIFO पेज  रिप्लेसमेंट पॉलिसी) के तहत पृष्ठ भ्रंशों (पेज फाल्ट्स) की संख्या क्रमश: होगी:

This question was previously asked in
HTET PGT Official Computer Science Paper - 2017
Download PDF Attempt Online
View all HTET Papers >
  1. 9, 6
  2. 6, 3
  3. 6, 9
  4. 3 , 6

Answer (Detailed Solution Below)

Option 1 : 9, 6
Free Tests
View all Free tests >
Free
HTET PGT Official Computer Science Paper - 2019
4.5 K Users
60 Questions 60 Marks 60 Mins
Start Now

Detailed Solution

Download Solution PDF
Download Solution PDF
Latest HTET Updates

Last updated on Jun 6, 2025

-> The HTET TGT Applciation Portal will reopen on 1st June 2025 and close on 5th June 2025.

-> HTET Exam Date is out. HTET TGT Exam will be conducted on 26th and 27th July 2025

-> Candidates with a bachelor's degree and B.Ed. or equivalent qualification can apply for this recruitment.

-> The validity duration of certificates pertaining to passing Haryana TET has been extended for a lifetime.

-> Enhance your exam preparation with the HTET Previous Year Papers.

More Page Replacement Policy Questions

Q1.Which of the following Page Replacement Algorithm suffers from the Belady’s anomaly ?
Q2.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 ?
Q3.Consider the following statements: S1: LRU page replacement algorithm suffers from the belady's anomaly S2: Shortest remaining time first scheduling may cause starvations S3: Stack is shared by all threads in a process 
Q4.Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. A virtual memory system uses first-in first-out page replacement policy and allocates a fixed number of frames to a process Assertion A: Increasing number of page frames allocated to a process sometimes increases the page fault rate. Reason R: Some programs do not exhibit locality of reference. In the light of the above statements, choose the correct answer from the options given below. 
Q5.एक प्रोसेसर द्वारा बनाए गए पेजों की निम्नलिखित संदर्भ स्ट्रिंग पर विचार कीजिए: 4, 7, 5, 7, 6, 7, 10, 4, 8, 5, 8, 6, 8, 11, 4, 9, 5, 9, 6, 9, 12, 4, 7, 5, 7 मान लीजिए कि मुख्य मेमोरी में आवंटित पेज फ्रेम की संख्या चार है। लीस्ट रिसेंटली यूज्ड (LRU) प्रतिस्थापन तकनीक का उपयोग करके उत्पन्न पेज दोषों की संख्या क्या है?
Q6.For the following page reference string 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5. the number of page faults that occur in Least Recently Used (LRU) page replacement algorithm with frame size 3 is
Q7.जब इंस्ट्रक्शन का एग्जीक्यूट होना संपन्न होने से पहले पेज फाल्ट होता है तब:
Q8.पृष्ठ प्रतिस्थापन एल्गोरिथम का निर्माण करने का उद्देश्य है:
Q9.FIFO प्रतिस्थापन एल्गोरिथम प्रत्येक पृष्ठ के साथ तब संबद्ध होता है, जब ______।

More Virtual Memory Questions

Q1.Which of the following Page Replacement Algorithm suffers from the Belady’s anomaly ?
Q2.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 ?
Q3.Consider the following statements: S1: LRU page replacement algorithm suffers from the belady's anomaly S2: Shortest remaining time first scheduling may cause starvations S3: Stack is shared by all threads in a process 
Q4.Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. A virtual memory system uses first-in first-out page replacement policy and allocates a fixed number of frames to a process Assertion A: Increasing number of page frames allocated to a process sometimes increases the page fault rate. Reason R: Some programs do not exhibit locality of reference. In the light of the above statements, choose the correct answer from the options given below. 
Q5.एक प्रोसेसर द्वारा बनाए गए पेजों की निम्नलिखित संदर्भ स्ट्रिंग पर विचार कीजिए: 4, 7, 5, 7, 6, 7, 10, 4, 8, 5, 8, 6, 8, 11, 4, 9, 5, 9, 6, 9, 12, 4, 7, 5, 7 मान लीजिए कि मुख्य मेमोरी में आवंटित पेज फ्रेम की संख्या चार है। लीस्ट रिसेंटली यूज्ड (LRU) प्रतिस्थापन तकनीक का उपयोग करके उत्पन्न पेज दोषों की संख्या क्या है?
Q6.For the following page reference string 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5. the number of page faults that occur in Least Recently Used (LRU) page replacement algorithm with frame size 3 is
Q7.जब इंस्ट्रक्शन का एग्जीक्यूट होना संपन्न होने से पहले पेज फाल्ट होता है तब:
Q8.पृष्ठ प्रतिस्थापन एल्गोरिथम का निर्माण करने का उद्देश्य है:
Q9.FIFO प्रतिस्थापन एल्गोरिथम प्रत्येक पृष्ठ के साथ तब संबद्ध होता है, जब ______।
Crack Super Pass Live with
India's Super Teachers
Explore Supercoaching For FREE
Suggested Test Series
View All >
HTET TGT Level 2 - 2024 Mock Test
183 Total Tests with 3 Free Tests
Start Free Test
Pedagogy for All Teaching Exams (Paper 1 & 2) - Let's Crack TET!
345 Total Tests with   3 Free Tests
Start Free Test
Suggested Exams
Exam-Logo
HTET TGT
Exam-Logo
GATE CS

HTET TGT 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 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 500 bonus teen patti 51 bonus online teen patti teen patti apk download