Operating System

91. Which of the following page replacement algorithm(s) does not suffer from Belady's anomaly in Operating System? I. Least-Recently Used (LRU) page replacement. II. First-In, First-Out (FIFO) page replacement.
निम्न page replacement algorithms में से कौन Belady's anomaly से प्रभावित नहीं होता? I. LRU II. FIFO
(DSSSB TGT C.S. 07.02.2024 (Shift-II))
A. Only I
B. Neither I nor II
C. Only II
D. Both I and II

Correct Answer: A

Explanation (EN): LRU does not suffer from Belady's anomaly, while FIFO does.

Explanation (HI): LRU Belady's anomaly से प्रभावित नहीं होता, जबकि FIFO होता है।

92. Suppose that a process is in 'BLOCKED' state waiting for some I/O service. When the service is completed, it goes to the ______ state.
मान लीजिए कोई process I/O service के लिए BLOCKED state में है। Service complete होने पर वह किस state में जाता है?
(DSSSB PGT C.S. (Male) 27.07.2018 (Shift-II))
A. Running
B. Ready
C. Suspended
D. Terminated

Correct Answer: B

Explanation (EN): After I/O completion, a blocked process moves to the ready state.

Explanation (HI): I/O complete होने पर blocked process ready state में जाता है।

93. Consider a main memory with 3 page frames in the following sequence of page references 3, 4, 2, 3, 9, 1, 6, 3, 4, 9. What is the number of page faults using FIFO page replacement algorithm?
3 page frames वाली main memory में reference sequence 3, 4, 2, 3, 9, 1, 6, 3, 4, 9 के लिए FIFO page replacement algorithm से कितने page faults होंगे?
(DSSSB PGT C.S. M/F 11.07.2021)
A. 9
B. 10
C. 8
D. 7

Correct Answer: A

Explanation (EN): FIFO simulation for the given sequence gives 9 page faults.

Explanation (HI): दिए गए sequence पर FIFO simulate करने पर 9 page faults आते हैं।

94. What is Throughput in process scheduling?
Process scheduling में Throughput क्या है?
(DSSSB PGT C.S. M/F 11.07.2021)
A. Time required to complete a process
B. Number of processes completed per unit time
C. Time required by a process to respond
D. Time required to abort a process

Correct Answer: B

Explanation (EN): Throughput is the number of processes completed per unit time.

Explanation (HI): Throughput प्रति unit time पूरे किए गए processes की संख्या है।

95. Information about each process in operating system is maintained by ______.
Operating system में प्रत्येक process की information किसके द्वारा maintain की जाती है?
(DSSSB PGT C.S. M/F 11.07.2021)
A. Scheduler
B. Process control block
C. Central Processing Unit
D. Program Counter

Correct Answer: B

Explanation (EN): Process information is maintained in the Process Control Block (PCB).

Explanation (HI): Process की information Process Control Block (PCB) में रखी जाती है।

96. The instruction which are executed only in kernel mode is known as _____.
जो instructions केवल kernel mode में execute होती हैं, उन्हें क्या कहते हैं?
(DSSSB TGT C.S. 01.08.2021 (Shift-I))
A. Memory instruction
B. Arithmetic instruction
C. Privileged instruction
D. Logical instruction

Correct Answer: C

Explanation (EN): Instructions that can only execute in kernel mode are called privileged instructions.

Explanation (HI): वे instructions जो केवल kernel mode में execute हो सकती हैं, privileged instructions कहलाती हैं।

97. Data structure maintained by the operating system to maintain information for each thread within a process is known as _______.
किसी process के भीतर प्रत्येक thread की information maintain करने वाली operating system data structure क्या कहलाती है?
(DSSSB TGT C.S. 01.08.2021 (Shift-I))
A. Process control block
B. Thread control block
C. Symbol table
D. Scheduling queue

Correct Answer: B

Explanation (EN): The operating system stores per-thread information in a Thread Control Block (TCB).

Explanation (HI): Operating system प्रत्येक thread की जानकारी Thread Control Block (TCB) में रखता है।

98. Consider a main memory with the capacity of 3 page frames which are initially empty. Page reference is 4, 7, 6, 1, 7, 6, 1, 2, 7, 2. What is the number of page fault using optimal page replacement algorithm?
3 page frames वाली main memory शुरुआत में empty है। Page reference string 4, 7, 6, 1, 7, 6, 1, 2, 7, 2 है। Optimal page replacement algorithm से कितने page faults होंगे?
(DSSSB TGT C.S. 01.08.2021 (Shift-I))
A. 7
B. 6
C. 5
D. 4

Correct Answer: C

Explanation (EN): Optimal page replacement for the given reference string results in 5 page faults.

Explanation (HI): दिए गए reference string पर optimal page replacement लगाने पर 5 page faults आते हैं।

99. Inner most layer of operating system which is always present in main memory is known as ________.
Operating system की सबसे अंदरूनी layer जो हमेशा main memory में रहती है, क्या कहलाती है?
(DSSSB TGT C.S. 01.08.2021 (Shift-I))
A. Hardware
B. User interface
C. Application program
D. Kernel

Correct Answer: D

Explanation (EN): The innermost layer of the OS that always stays in main memory is the kernel.

Explanation (HI): Operating system की सबसे अंदरूनी layer जो हमेशा main memory में रहती है, kernel कहलाती है।

100. When there is a memory wastage within the memory partition itself then it is known as _______.
जब memory partition के भीतर ही memory wastage हो, तो उसे क्या कहते हैं?
(DSSSB TGT C.S. 01.08.2021 (Shift-II))
A. External fragmentation
B. Belady's Anomaly
C. Internal fragmentation
D. Compaction

Correct Answer: C

Explanation (EN): Waste occurring inside an allocated memory partition is internal fragmentation.

Explanation (HI): Allocated memory partition के अंदर होने वाला wastage internal fragmentation कहलाता है।

Prev12345678910111213141516171819202122Next