Operating System

201. Consider the memory reference string given below, for a memory with 3 frames per process: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3. The number of page faults for FIFO page replacement policy are _________.
प्रति process 3 frames वाली memory के लिए reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3 पर विचार कीजिए। FIFO page replacement policy में page faults की संख्या क्या होगी?
(NVS PGT Computer Science 15.12.2022 (Shift-II))
A. Ten
B. Seven
C. Nine
D. Eight

Correct Answer: C

Explanation (EN): For the given reference string with 3 frames, FIFO results in 9 page faults.

Explanation (HI): दिए गए reference string और 3 frames के लिए FIFO में 9 page faults होते हैं।

202. Which of the following statements is not correct?
निम्न में से कौन-सा statement सही नहीं है?
(NVS PGT Computer Science 15.12.2022 (Shift-II))
A. Linked allocation of disk space allows only sequential access of data
B. Indexed allocation of disk space allows direct access to disk blocks
C. There is no internal fragmentation in contiguous allocation of disk space
D. There is no external fragmentation in linked allocation of disk space

Correct Answer: C

Explanation (EN): Contiguous allocation may suffer from fragmentation issues, so the statement that there is no internal fragmentation is considered incorrect in the provided source.

Explanation (HI): Contiguous allocation fragmentation की समस्या से प्रभावित हो सकता है, इसलिए दिया गया statement incorrect माना गया है।

203. Which of the following page replacement algorithms requires futuristic information about page references?
निम्न में से कौन-सा page replacement algorithm page references के बारे में future information की आवश्यकता रखता है?
(LT Grade Computer Science 2018)
A. FIFO
B. LRU
C. Second chance
D. Optimal

Correct Answer: D

Explanation (EN): The Optimal page replacement algorithm requires knowledge of future page references.

Explanation (HI): Optimal page replacement algorithm को future page references की जानकारी चाहिए होती है।

204. A process refers to 5 pages A, B, C, D, E in the order A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames is
एक process 5 pages A, B, C, D, E को क्रम A, B, C, D, A, B, E, A, B, C, D, E में refer करता है। यदि page replacement algorithm FIFO हो और initial store 3 empty frames का हो, तो कितनी बार pages transfer होंगी?
(LT Grade Computer Science 2018)
A. 8
B. 10
C. 9
D. 7

Correct Answer: C

Explanation (EN): Following FIFO for the given page sequence results in 9 page transfers/page faults.

Explanation (HI): दिए गए page sequence पर FIFO लगाने से 9 page transfers/page faults होते हैं।

205. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67. Considering FCFS scheduling, the total number of head movements is, if the disk head is initially at 53?
Cylinder requests 98, 183, 37, 122, 14, 124, 65, 67 वाली disk queue पर विचार कीजिए। यदि disk head प्रारंभ में 53 पर है, तो FCFS scheduling में total head movements कितनी होंगी?
(BPSC TRE 3.0 Exam 22.07.2024 (11-12))
A. 640
B. 620
C. 630
D. More than one of the above

Correct Answer: A

Explanation (EN): Adding the absolute head movements in FCFS order gives 640 cylinders.

Explanation (HI): FCFS क्रम में सभी absolute head movements जोड़ने पर 640 cylinders मिलते हैं।

206. What is the reason for using the MFU page replacement algorithm?
MFU page replacement algorithm उपयोग करने का कारण क्या है?
(BPSC TRE 3.0 22.07.2024 (6-10))
A. An actively used page should have a large reference count
B. A less used page has more chances to be used again
C. It is extremely efficient and optimal
D. More than one of the above

Correct Answer: B

Explanation (EN): MFU assumes that pages used very frequently in the past may have outlived their usefulness, while less used pages may be needed again.

Explanation (HI): MFU यह मानता है कि जो pages बहुत अधिक उपयोग हो चुकी हैं वे अब कम उपयोगी हो सकती हैं, जबकि कम उपयोग हुई pages भविष्य में फिर काम आ सकती हैं।

207. Valid sequence of moves to solve Tower of Hanoi problem with 3 disks if disks are required from stand A to stand C using stand B?
यदि 3 disks को stand A से stand C पर stand B की सहायता से ले जाना हो, तो Tower of Hanoi का valid move sequence क्या होगा?
(RPSC Computer Science 2016 (Paper-I))
A. A→C, A→B, C→B, A→C, B→C, B→C
B. A→B, A→B, A→C, B→C, B→C
C. A→B, A→C, B→A, C→B, A→C, B→C, A→C
D. A→C, A→B, C→B, A→C, B→A, B→C, A→C

Correct Answer: D

Explanation (EN): The correct 7-step solution for 3 disks is A→C, A→B, C→B, A→C, B→A, B→C, A→C.

Explanation (HI): 3 disks के लिए सही 7-step solution है: A→C, A→B, C→B, A→C, B→A, B→C, A→C।

208. A process in memory also contains the heap section. What is the use of heap section?
Memory में process के साथ heap section भी होती है। Heap section का उपयोग क्या है?
(UGC NET Computer Science December 2022)
A. Contains temporary data
B. Dynamically allocate the memory during process run time
C. Contains process priority and pointers to scheduling queues
D. Contains amount of CPU and real time use

Correct Answer: B

Explanation (EN): Heap section is used for dynamic memory allocation during program execution.

Explanation (HI): Heap section program execution के दौरान dynamic memory allocation के लिए उपयोग होती है।

209. How many page faults occur for optimal algorithm for the following string with four frames? 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8
चार frames के साथ reference string 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8 के लिए optimal algorithm में कितने page faults होंगे?
(UGC NET Computer Science December 2022)
A. 8
B. 7
C. 6
D. 5

Correct Answer: A

Explanation (EN): According to the provided solution, the optimal algorithm results in 8 page faults.

Explanation (HI): दिए गए solution के अनुसार optimal algorithm में 8 page faults होते हैं।

210. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Which of the following options gives the correct number of page faults related to LRU, FIFO, and optimal page replacement algorithms respectively, assuming 5 page frames and all frames are initially empty?
Page reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6 पर विचार कीजिए। यदि 5 page frames हों और सभी initially empty हों, तो LRU, FIFO और Optimal page replacement algorithms के page faults क्रमशः कितने होंगे?
(UGC NET Computer Science August 2016 (Paper-III))
A. 10, 14, 8
B. 8, 10, 7
C. 7, 10, 8
D. 7, 10, 7

Correct Answer: B

Explanation (EN): For the given string, LRU gives 8, FIFO gives 10, and Optimal gives 7 page faults.

Explanation (HI): दिए गए string के लिए LRU में 8, FIFO में 10, और Optimal में 7 page faults आते हैं।

Prev12345678910111213141516171819202122Next