Free Mock Test : Operating System : File Management (Test 3)

Home

Technology

Blog

Free Mock Test - Operating System : File Management (Test 3)

File Management is one of the core functions of an Operating System. It is responsible for creating, organizing, storing, retrieving, and managing files on a computer system. Through file management, users can easily access their data, maintain structure, and ensure efficient use of storage devices.
File Management is a frequently asked topic in various academic and competitive exams such as BCA, B.Tech, MCA, and government job exams.The Operating System: File Management online test by teachexam is an excellent resource for students who want to strengthen their concepts and prepare effectively for exams. Regular practice through such tests improves knowledge retention, boosts confidence, and ensures better academic performance.

Total Questions : 30

Timer : sec

Question : In a layered file system architecture, which layer is responsible for interacting with device drivers and handling physical storage operations?

Logical file system

Virtual file system

Physical file system

Application layer

none

Question : Which of the following statements about file systems is TRUE?

Files cannot exist inside directories

File systems do not manage disk sectors

File systems organize files in a hierarchical structure

File systems only work with RAM

none

Question : What is the main purpose of mounting in a file system?

To compress files automatically

To attach a storage device to the OS and make it accessible

To encrypt file data

To delete unused files

none

Question : Which file allocation method allows faster sequential access but suffers from external fragmentation?

Linked allocation

Indexed allocation

Contiguous allocation

Hashed allocation

none

Question : Which of the following best describes the role of metadata in a file system?

It stores actual user data inside files

It provides information like file name, size, permissions, and timestamps

It manages CPU scheduling

It allocates RAM to processes

none

Question : Which statement is TRUE regarding layered file system design?

Each layer performs all operations independently

Lower layers depend on higher layers for execution

Each layer performs a specific function and passes data between layers

Only one layer handles file access

none

Question : In file system structure, which component directly interacts with hardware through device drivers?

Logical File System

File Organization Module

Basic File System

I/O Control

none

Question : Which of the following correctly describes the role of the Basic File System layer?

Verifies file access permissions

Maintains directory hierarchy

Issues commands to I/O control for block access

Maps logical blocks to physical blocks

none

Question : The mapping of logical blocks to physical disk blocks is performed by which component?

Logical File System

I/O Control

File Organization Module

Device Driver

none

Question : Which layer of the file system is responsible for managing metadata and directory structure?

Basic File System

Logical File System

File Organization Module

I/O Control

none

Question : Which of the following happens if the MBR gets corrupted?

System runs faster

Only user files are deleted

System may fail to boot

BIOS gets deleted

none

Question : Why is MBR considered outdated for modern systems?

It does not support any file system

It cannot boot operating systems

It has a storage limitation of around 2 TB

It requires internet connection to boot

none

Question : What is the maximum number of primary partitions supported by MBR?

Unlimited

none

Question : What is the primary role of the MBR during system boot?

To store user files

To initialize RAM

To load and transfer control to the OS bootloader

To manage CPU scheduling

none

Question : Which of the following correctly describes the structure of an MBR?

512 bytes: 256 bytes boot code, 128 bytes partition table, 128 bytes signature

512 bytes: 446 bytes boot code, 64 bytes partition table, 2 bytes signature

1024 bytes: 512 bytes boot code, 256 bytes partition table, 256 bytes signature

256 bytes: 128 bytes boot code, 64 bytes partition table, 64 bytes signature

none

Question : In NTFS, the information equivalent to File Control Block (FCB) is primarily stored in:

Boot sector

Superblock

Master File Table (MFT)

Directory entry

none

Question : Which of the following is NOT typically stored in a File Control Block (FCB)?

File size

Ownership and permissions

Disk free space list

File metadata

none

Question : Which structure maps file names to their corresponding metadata structures (like FCB/inode)?

Boot Control Block

Volume Control Block

Directory Structure

File Control Block

none

Question : In UNIX file systems, the Volume Control Block is commonly referred to as:

Inode

Superblock

File Allocation Table

Master File Table

none

Question : Which of the following correctly describes the Boot Control Block?

Stores file permissions and ownership

Contains information required to boot the OS from a volume

Maintains list of free disk blocks

Stores file names and inode numbers

none

Question : Which of the following is a key challenge of using in-memory data structures?

High latency

Limited memory capacity (RAM constraints)

Slow access speed

Inability to scale

none

Question : What is the main role of an in-memory queue in OS or system design?

Long-term data storage

Managing disk scheduling

Temporary storage for fast communication between processes

Encrypting inter-process messages

none

Question : In operating systems, Virtual Memory Areas (VMAs) are primarily used to:

Store CPU instructions

Manage segments of a process’s virtual address space

Replace physical memory entirely

Encrypt memory data

none

Question : Which data structure is specifically optimized for main-memory databases rather than disk-based systems?

B-tree

T-tree

Heap

Trie

none

Question : Which of the following best explains why in-memory data structures improve system performance?

They reduce CPU instruction cycles

They eliminate the need for algorithms

They store data in RAM instead of disk, reducing access time

They compress data automatically

none

Question : Why might a hash table directory implementation still require traversal of a linked list?

To sort directory entries

Due to collision handling using chaining

To reduce memory usage

To maintain directory hierarchy

none

Question : What problem may arise in hash table directory implementation when multiple file names map to the same index?

Deadlock

Fragmentation

Collision

Paging

none

Question : Which statement correctly differentiates linear list and hash table directory implementations?

Linear list provides faster search than hash table

Hash table eliminates the need for linked lists

Hash table reduces search time compared to linear list

Linear list requires collision resolution

none

Question : In a hash table directory implementation, what does the key typically represent?

File size

File name hashed value

File creation time

Memory block address

none

Question : Which of the following is the primary disadvantage of the linear list directory implementation?

High memory consumption

Requires complex collision handling

Requires traversal of entire list for operations

Cannot store file metadata

none

About us

Term & conditions

Privacy & Policy

Free Mock Test - Operating System : File Management (Test 3)

Cookies & Disclaimer