adplus-dvertising

Welcome to the File System Implementation MCQs Page

Dive deep into the fascinating world of File System Implementation with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of File System Implementation, a crucial aspect of Operating System. In this section, you will encounter a diverse range of MCQs that cover various aspects of File System Implementation, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Operating System.

frame-decoration

Check out the MCQs below to embark on an enriching journey through File System Implementation. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Operating System.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of File System Implementation. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

File System Implementation MCQs | Page 2 of 11

Discuss
Answer: (b).can always be prevented
Q12.
If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 70.
Discuss
Answer: (c).324
Q13.
A machine has a physical memory of 64 Mbyte and a virtual address space of 32 - bit. The page size is 4kbyte, What is the approximate size of the page table?
Discuss
Answer: (c).2 Mbyte
Q14.
We have a CPU that generates virtual addresses of 32 bits and the page size is of 4 kbyte. Transition Lookaside Buffer ( TLB ) of the processor can hold a total of 128 page table entries and 4 - way set associative. What is the minimum size of the TLB tag?
Discuss
Answer: (d).15 bit
Q15.
 An application loads 100 libraries at startup and loading each library exactly one disk access is required. 10ms is the seek time of the disk to a random location and 6000rpm is the rotational speed of the disk. Neglect the time to transfer data from the disk block once the head has been positioned at the start of the block. What will be the time taken by the application to load all the libraries, if all 100 libraries are loaded from random location on the disk?
Discuss
Answer: (a).1.50s
Q16.
 In a virtual memory environment the minimum number of page frames that must be allocated to a running process is determined by ___________________.
Discuss
Answer: (b).The Instruction Set Architecture
Discuss
Answer: (a).Shortest-Seek-time-first scheduling
Q18.
The total time to prepare a disk drive mechanism for a block of data to be read from is its
Discuss
Answer: (c).latency plus seek time
Q19.
________ is the time required by a sector to reach below read/write head.
Discuss
Answer: (b).Latency Time
Q20.
The methods or algorithms which are used to increase the performance of disk storage subsystem is called .............
Discuss
Answer: (b).Disk scheduling
Page 2 of 11

Suggested Topics

Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!