Operating System

31. File manipulation operations in an operating system include:
Operating system में file manipulation operations में क्या शामिल होता है?
(Bihar STET C.S. 12.09.2023 (Shift-I))
A. Allocating memory to files
B. Assigning file names to processes
C. Loading files into CPU registers
D. Reading, writing, and modifying file content

Correct Answer: D

Explanation (EN): File manipulation operations include opening, closing, reading, writing, updating contents, and deleting files. These operations allow a user or program to interact with files.

Explanation (HI): File manipulation operations में file को open करना, close करना, read करना, write करना, update करना और delete करना शामिल होता है। इनकी मदद से user या program files के साथ काम कर सकता है।

32. A large computer information system maintains many different computer files. Which amongst them is called a perpetual file?
एक बड़े computer information system में अनेक प्रकार की files होती हैं। इनमें से किसे perpetual file कहा जाता है?
(Bihar STET C.S. 12.09.2023 (Shift-II))
A. Specialized File
B. Master File
C. Log File
D. Update File

Correct Answer: B

Explanation (EN): A perpetual file is a file that is preserved for a long time and continually updated. Such a file is called a Master File.

Explanation (HI): Perpetual file वह file होती है जिसे लंबे समय तक सुरक्षित रखा जाता है और लगातार update किया जाता है। ऐसी file को Master File कहा जाता है।

33. What is coalescing ?
Coalescing क्या है?
(KVS PGT C.S. 2013)
A. It is second strategy for allocating kernel memory.
B. The buddy system allocates memory from a fixed size segment consisting of physically contiguous pages.
C. Kernel memory is often allocated from a free-memory pool different from the list used to satisfy ordinary user made processes.
D. An advantage of the buddy system is how quickly adjacent buddies can be combined to form larger segments using this technique.

Correct Answer: D

Explanation (EN): In the buddy system, adjacent free blocks called buddies can be merged quickly to form larger memory segments. This merging process is called coalescing.

Explanation (HI): Buddy system में पास-पास के free memory blocks, जिन्हें buddies कहते हैं, को मिलाकर बड़े segments बनाए जा सकते हैं। इसी merging process को coalescing कहते हैं।

34. Physical memory is broken into fixed size blocks called?
Physical memory को fixed size blocks में बाँटा जाता है, जिन्हें क्या कहा जाता है?
(RPSC C.S. 2016 (PAPER-I))
A. Frames
B. Pages
C. Chunks
D. Buffers

Correct Answer: A

Explanation (EN): In operating systems, physical memory is divided into fixed-size blocks called frames, while logical memory is divided into pages.

Explanation (HI): Operating system में physical memory को fixed-size blocks में विभाजित किया जाता है जिन्हें frames कहा जाता है, जबकि logical memory को pages में बाँटा जाता है।

35. What is the full form of ISAM in file organisation?
File organisation में ISAM का पूर्ण रूप क्या है?
(DSSSB TGT C.S. 01.08.2021 (Shift-I))
A. Indirect Sequential Access Method
B. Indexed Sequential Access Method
C. Indirect Serial Access Method
D. Index Serial Access Method

Correct Answer: B

Explanation (EN): ISAM stands for Indexed Sequential Access Method. It combines the benefits of sequential access and indexed access.

Explanation (HI): ISAM का पूर्ण रूप Indexed Sequential Access Method है। यह sequential access और indexed access दोनों के लाभों को जोड़ता है।

36. A disk consists of _____, ______, ______
एक disk में _____, ______, ______ होते हैं।
(DSSSB TGT C.S. 07.08.2021 (Shift-II))
A. track, segment and circle
B. track, circle and cone
C. drum, track and segment
D. cylinder, tracks and sectors

Correct Answer: D

Explanation (EN): A disk is organized into tracks and sectors, and corresponding tracks across platters form cylinders.

Explanation (HI): Disk को tracks और sectors में बाँटा जाता है, और विभिन्न platters पर एक ही radial position वाले tracks मिलकर cylinders बनाते हैं।

37. In a disk system with 100 cylinders, the request to access the cylinder occur in following sequence: 34, 4, 7, 19, 10, 83, 2, 6, 20, 15 Assuming that the head is currently at cylinder 50, then what is the time taken to satisfy all requests if it takes 1 second to move from one cylinder to another? (Shortest seek time first policy is used)
100 cylinders वाले disk system में cylinder access requests इस क्रम में आती हैं: 34, 4, 7, 19, 10, 83, 2, 6, 20, 15। यदि head वर्तमान में cylinder 50 पर है, तो Shortest Seek Time First policy के अनुसार सभी requests को पूरा करने में कितना समय लगेगा, यदि एक cylinder से दूसरे cylinder तक जाने में 1 second लगता है?
(DSSSB PGT C.S. M/F 11.07.2021)
A. 119 seconds
B. 129 seconds
C. 109 seconds
D. 139 seconds

Correct Answer: B

Explanation (EN): Using SSTF from cylinder 50, the head always moves to the nearest pending request. According to the given answer key, the total time required is 129 seconds.

Explanation (HI): SSTF में head हर बार सबसे निकट वाले pending request पर जाता है। दिए गए answer key के अनुसार कुल समय 129 seconds है।

38. A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cylinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cylinder 24. A seek takes 6 msec per cylinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?
एक disk drive में 100 cylinders हैं, जिनकी numbering 0 से 99 तक है। Disk requests cylinders 12, 26, 24, 4, 42, 8 और 50 के लिए आती हैं। Driver वर्तमान में cylinder 24 पर request serve कर रहा है। यदि एक cylinder move करने में 6 msec लगते हैं, तो SSTF algorithm में कुल seek time कितना होगा?
(UGC NET C.S. June-2015 (Paper-II))
A. 0.984 sec
B. 0.396 sec
C. 0.738 sec
D. 0.42 sec

Correct Answer: D

Explanation (EN): Using SSTF, total head movement is 70 cylinders. Therefore total seek time = 70 × 6 msec = 420 msec = 0.42 sec.

Explanation (HI): SSTF के अनुसार कुल head movement 70 cylinders है। इसलिए कुल seek time = 70 × 6 msec = 420 msec = 0.42 sec होगा।

39. In direct file organization:-
Direct file organization में:
(RPSC C.S. 2016 (Paper-II))
A. A collision always results into an overflow
B. A collision never results into an overflow
C. A collision may or may not lead to an overflow
D. A collision never occurs

Correct Answer: C

Explanation (EN): In direct or hash file organization, when two records map to the same address, a collision occurs. Depending on the collision handling technique, it may or may not lead to overflow.

Explanation (HI): Direct या hash file organization में जब दो records एक ही address पर map करते हैं, तो collision होता है। Collision handling technique पर निर्भर करता है कि overflow होगा या नहीं।

40. Sector interleaving in disks is done by?
Disks में sector interleaving किसके द्वारा किया जाता है?
(RPSC C.S. 2016 (PAPER-I))
A. Disk Manufacturer
B. Disk Controller
C. Operating System
D. None of these

Correct Answer: C

Explanation (EN): Sector interleaving is managed to optimize disk access and, as per the given answer key, it is done by the operating system.

Explanation (HI): Sector interleaving disk access को optimize करने के लिए किया जाता है और दिए गए answer key के अनुसार यह operating system द्वारा किया जाता है।

Prev123456Next