Operating System

191. The purpose of a page table in a paging system is to:
Paging system में page table का purpose क्या है?
(Bihar STET Computer Science 12.09.2023 (Shift-I))
A. Store pages of memory
B. Manage input/output operations
C. Translate virtual addresses to physical addresses
D. Store program instructions

Correct Answer: C

Explanation (EN): A page table is used to translate virtual addresses into physical addresses.

Explanation (HI): Page table virtual addresses को physical addresses में translate करने के लिए उपयोग होती है।

192. In multiprogramming with fixed partitions, if a process requires more memory than is available in a partition, it may lead to:
Fixed partitions वाली multiprogramming में यदि किसी process को partition में उपलब्ध memory से अधिक memory चाहिए, तो इससे क्या हो सकता है?
(Bihar STET Computer Science 12.09.2023 (Shift-I))
A. Fragmentation
B. Deadlock
C. Priority inversion
D. Starvation

Correct Answer: A

Explanation (EN): This situation leads to fragmentation, where memory use becomes inefficient.

Explanation (HI): इस स्थिति से fragmentation होती है, जिसमें memory का उपयोग inefficient हो जाता है।

193. If the size of memory is 4K words and each word is of 8 bits, what is the size of address bus?
यदि memory का size 4K words है और प्रत्येक word 8 bits का है, तो address bus का size क्या होगा?
(UKPSC PGT Computer Science Assistant Professor 2017)
A. 256
B. 12
C. 3
D. 32

Correct Answer: B

Explanation (EN): 4K = 4096 = 2^12 memory locations, so 12 address lines are needed.

Explanation (HI): 4K = 4096 = 2^12 memory locations, इसलिए 12 address lines चाहिए।

194. In memory a word is retrieved based on a portion of its content rather than its address. This memory is known as
Memory में यदि किसी word को उसके address के बजाय उसके content के आधार पर retrieve किया जाए, तो ऐसी memory क्या कहलाती है?
(UKPSC PGT Computer Science Assistant Professor 2017)
A. Associative memory
B. Retrieval memory
C. Read only memory
D. None of the above

Correct Answer: A

Explanation (EN): Associative memory, also called Content Addressable Memory (CAM), retrieves data by content.

Explanation (HI): Associative memory, जिसे Content Addressable Memory (CAM) भी कहते हैं, content के आधार पर data retrieve करती है।

195. Consider the following statements: (i) The time required to position read/write head on appropriate track or cylinder of a hard disk is known as rotational latency. (ii) The time required to position read/write head on appropriate track or cylinder on a hard disk is known as seek time. (iii) A hard disk is a magnetic disk consisting of several platters. (iv) A CD-ROM magnetizes spots on its surface in order to record information. Which of the statements given above are correct?
निम्न statements पर विचार कीजिए: (i) Hard disk के appropriate track या cylinder पर read/write head को position करने में लगने वाला समय rotational latency कहलाता है। (ii) Hard disk के appropriate track या cylinder पर read/write head को position करने में लगने वाला समय seek time कहलाता है। (iii) Hard disk एक magnetic disk है जिसमें कई platters होते हैं। (iv) CD-ROM अपनी surface पर spots को magnetize करके information record करता है। उपरोक्त में से कौन-से statements सही हैं?
(Haryana PGT Computer Science Assistant Professor 2024)
A. (i) and (ii) only
B. (ii) and (iii) only
C. (iii) only
D. (i) and (iv) only

Correct Answer: B

Explanation (EN): Statements (ii) and (iii) are correct. Statement (i) confuses seek time with rotational latency, and (iv) is false because CD-ROM uses optical technology.

Explanation (HI): Statements (ii) और (iii) सही हैं। Statement (i) seek time और rotational latency में भ्रम पैदा करता है, और (iv) गलत है क्योंकि CD-ROM optical technology उपयोग करता है।

196. How many 32 × 1 RAM chips are needed to provide a memory capacity of 256 kbytes?
256 kbytes memory capacity देने के लिए कितने 32 × 1 RAM chips चाहिए?
(CGPSC Computer Science 2020 Set-A)
A. 8
B. 32
C. 64
D. 128

Correct Answer: C

Explanation (EN): 256 KB = 256 × 1024 × 8 bits. Each chip stores 32 × 1024 bits. The number of chips required is 64.

Explanation (HI): 256 KB = 256 × 1024 × 8 bits। प्रत्येक chip 32 × 1024 bits store करती है। अतः 64 chips चाहिए।

197. The average time required to search a storage location in memory and obtain its contents is called
Memory में किसी storage location को खोजने और उसका content प्राप्त करने में लगने वाला average time क्या कहलाता है?
(UGC NET Computer Science December 2023)
A. Access time
B. Latency time
C. Response time
D. Reading time

Correct Answer: A

Explanation (EN): The average time to locate and retrieve stored data is called access time.

Explanation (HI): Stored data को locate और retrieve करने में लगने वाला औसत समय access time कहलाता है।

198. Which term refers to the strategy of optimizing an algorithm's use of resources, often by making sacrifices in one aspect for improvements in another?
वह कौन-सा term है जो resource optimization की उस strategy को दर्शाता है जिसमें एक aspect में sacrifice करके दूसरे aspect में improvement किया जाता है?
(Bihar STET Computer Science 12.09.2023 (Shift-I))
A. Greedy algorithm
B. Divide and conquer
C. Dynamic programming
D. Tradeoff

Correct Answer: D

Explanation (EN): A tradeoff means improving one resource aspect at the cost of another, such as time versus memory.

Explanation (HI): Tradeoff का अर्थ है एक resource aspect को दूसरे की कीमत पर बेहतर बनाना, जैसे time बनाम memory।

199. How many page faults occur in LRU page replacement algorithm for the given reference string, with four page frames: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1?
चार page frames के साथ दिए गए reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1 के लिए LRU page replacement algorithm में कितने page faults होंगे?
(KVS PGT Computer Science 2018)
A. 6
B. 8
C. 7
D. 9

Correct Answer: C

Explanation (EN): Simulating LRU with the given string gives 7 page faults.

Explanation (HI): दिए गए string पर LRU simulate करने पर 7 page faults आते हैं।

200. How many page faults occur in LRU page replacement algorithm for the given reference string, with four page frames: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1?
चार page frames के साथ दिए गए reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1 के लिए LRU page replacement algorithm में कितने page faults होंगे?
(KVS PGT Computer Science 2018)
A. 6
B. 8
C. 7
D. 9

Correct Answer: C

Explanation (EN): Simulating LRU with the given string gives 7 page faults.

Explanation (HI): दिए गए string पर LRU simulate करने पर 7 page faults आते हैं।

Prev12345678910111213141516171819202122Next