Storage Management

Multiple Choice questions & answers are available for a Computer Science students to clear GAT, NTS, ECAT exams, various technical interview, competitive examination, and other entrance exam. Storage Management is the important Topic for a computer science and technical students and one should practice these Mcqs to grasp good knowledge on the topic.

Which of the following refers to the associative memory?

The address of the data is generated by the CPU

The address of the data is supplied by the users

There is no need for an address i.e. the data is used as an address

The data are accessed sequentially

Which of the following file name extension suggests that the file is Backup copy of another file ?





In memory management , a technique called as paging, physical memory is broken into fixed-sized blocks called ___________.





Disk scheduling involves deciding ?

Which disk should be accessed next

The order in which disk access request should be made

Physical location of files

Type of disks a system should have

Memory protection is normally done by

The processor and the associated hardware

The operating system

The compiler

The user program

Dynamic allocation of storage areas with VSAM files is accomplished by


Control splits

Over flow areas

Relative recording

Root directory of a disk should be placed

At the fixed address in the main memory

At a fixed location on the disk

At the fixed location on system disk

Anywhere on the disk

CPU can access which type of memory directly?

Random-access memory

Magnetic disk

Magnetic tape

None of the above

What is the effect of using a larger block size in a fixed block size file system?

It leads to poorer disk throughput and poorer disk space utilization

It leads to poorer disk throughput but better disk space utilization

It leads to better disk throughput and better disk space utilization

It leads to better disk throughput and poorer disk space utilization

Consider a system with 32 bit virtual addresses and 1 kbyte page size. Why is it not possible to use one – level page tables for virtual to physical address translation?

The amount of external fragmentation

The amount of internal fragmentation

The large computation overhead in the translation process

The large memory overhead in maintaining page tables

What should be the size of ROM if it is used to store the table for multiplication of two 8 – bit unsigned integers?

64k x 8

64k x 16

4k x 8

64k x 16

 What will happen when we format a floppy disk?

Identification information is written on all tracks and sectors

The system area is deleted

Data is written

Data is arranged on the disk in contiguous fashion

The capacity of a memory unit = (the number of words) * (the number of bits / words). What will be the number of separate address and data lines needed for a memory of 4k * 16 ?

12 address and 16 data lines

12 address and 12 data lines

11 address and 6 data lines

12 address and 8 data lines

The memory allocation scheme subject to “external” fragmentation is



Pure demand paging

Multiple fixed contiguous partitions

Scroll to Top