Operating System

211. 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 के लिए उपयोग होती है।

212. 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 होते हैं।

213. 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 आते हैं।

214. Consider the following page reference string: 1, 2, 3, 2, 4, 1, 3, 2, 4, 1. Assume that there are three page frames which are initially empty. Then, which of the following expressions is true?
Page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 पर विचार कीजिए। यदि तीन page frames हों और वे शुरुआत में empty हों, तो निम्न में से कौन-सा expression सही है?
(DSSSB PGT Computer Science (Male) 27.07.2018 (Shift-II))
A. LRU = FIFO = OPTIMAL
B. FIFO < OPTIMAL = LRU
C. FIFO = OPTIMAL
D. OPTIMAL < FIFO < LRU

Correct Answer: D

Explanation (EN): For the given sequence, Optimal gives the fewest faults, FIFO is in between, and LRU gives the most faults.

Explanation (HI): दिए गए sequence में Optimal सबसे कम faults देता है, FIFO उससे अधिक, और LRU सबसे अधिक faults देता है।

215. Consider the following graph of disk scheduling and identify the disk scheduling algorithm represented by this graph.
निम्न disk scheduling graph पर विचार कीजिए और बताइए कि यह किस disk scheduling algorithm को दर्शाता है।
(UGC NET Computer Science December 2024)
A. SSTF
B. SCAN
C. C-SCAN
D. C-LOOK

Correct Answer: D

Explanation (EN): The graph represents C-LOOK scheduling, where the head moves in one direction and then jumps back without servicing on return.

Explanation (HI): यह graph C-LOOK scheduling को दर्शाता है, जिसमें head एक दिशा में चलता है और फिर बिना service किए वापस jump करता है।

216. Consider the reference string: 0, 1, 2, 3, 0, 1, 4, 0, 1, 2, 3, 4. If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are _______ and _______ respectively.
Reference string 0, 1, 2, 3, 0, 1, 4, 0, 1, 2, 3, 4 पर विचार कीजिए। यदि FIFO page replacement algorithm उपयोग किया जाए, तो तीन page frames और चार page frames के लिए page faults क्रमशः कितने होंगे?
(UGC NET Computer Science June 2016 (Paper-II))
A. 10, 9
B. 9, 9
C. 10, 10
D. 9, 10

Correct Answer: D

Explanation (EN): For the given reference string, FIFO gives 9 page faults with 3 frames and 10 page faults with 4 frames.

Explanation (HI): दिए गए reference string पर FIFO, 3 frames के लिए 9 और 4 frames के लिए 10 page faults देता है।

217. If the disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O block requests are: 98, 37, 14, 124, 65, 67.
यदि disk head प्रारंभ में track 32 पर हो, तो FCFS scheduling में I/O block requests 98, 37, 14, 124, 65, 67 के लिए कुल disk moves कितनी होंगी?
(UGC NET Computer Science June 2016 (Paper-II))
A. 320
B. 322
C. 321
D. 319

Correct Answer: C

Explanation (EN): Adding the head movements in FCFS order gives 321 disk moves.

Explanation (HI): FCFS क्रम में head movements जोड़ने पर 321 disk moves मिलती हैं।

218. A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler reevaluates the process priority for every 'T' time units and decides the next process to be scheduled. If the processes have no I/O operations and all arrive at time zero, then the scheduler implements _______ criteria.
एक scheduling algorithm process की waiting time के proportional priority assign करता है। प्रत्येक process zero priority (lowest) से शुरू होती है। Scheduler हर 'T' time units पर priority का पुनर्मूल्यांकन करता है और अगले process को schedule करता है। यदि किसी process में I/O operation नहीं है और सभी time zero पर आते हैं, तो scheduler कौन-सा criteria implement करता है?
(UGC NET Computer Science June 2016 (Paper-II))
A. Priority scheduling
B. Round Robin Scheduling
C. Shortest Job First
D. FCFS

Correct Answer: B

Explanation (EN): This behavior is equivalent to Round Robin with quantum T.

Explanation (HI): यह व्यवहार quantum T वाले Round Robin Scheduling के equivalent है।

Prev12345678910111213141516171819202122