121. Access time is the highest in the case of

floppy disk

cache

swapping devices

magnetic disks

122. A program P reads and processes 1000 consecutive records from a sequential file F stored on device D without using any file system facilities. Given the following: (i) Size of each record = 3200 bytes. (ii) Access time of D = 10 m secs. (iii) Data transfer rate of D = 800 x 103 bytes/sec (iv) CPU time to process each record = 3 m secs. What is the elapsed time of P if F contains unblocked records and P uses one buffer(i.e. it always reads ahead into the buffer)?

12 sec

14 sec

17 sec

21 sec

123. A program P reads and processes 1000 consecutive records from a sequential file F stored on device D without using any file system facilities. Given the following: (i) Size of each record = 3200 bytes. (ii) Access time of D = 10 m secs. (iii) Data transfer rate of D = 800 x 103 bytes/sec (iv) CPU time to process each record = 3 m secs. What is the elapsed time of P if F contains unblocked records and P does not use buffering?

12 sec

14 sec

17sec

21sec

124. A file sometimes called a

collection of input data

data set

temporary place to store data

program

125. Primitive disk operating system (POS) manages its disk files in contiguous blocks. A file is saved to the first available space that is large enough to hold the file. Assume that a disk has only 10 contiguous blocks of available free space. Which of the following set of file operations Fa=1, Fb=3, Fc=5, Fd=6 can not be completed given the set of files and file sizes specified below

save (ƒa), save (ƒb), save (ƒd), delete (ƒd), save (ƒc)

save (ƒc), save (ƒa), delete (ƒc), save (ƒd)

save (ƒd), save (ƒb), delete (ƒd), save (ƒc)

save (ƒb), save (ƒa), delete (ƒb), save (ƒd)

126. In MS-DOS, relocatable object files and load modules have extensions

.OBJ and .COM or .EXE respectively

.COM and .OBJ respectively

.EXE and .OBJ respectively

.DAS and .EXE respectively

127. Consider six files F1, F2, F3, F4, F5 and F6 of corresponding sizes 100, 200, 70, 40, 250 and 50 respectively. If the files are stored in such a manner to optimize access time, what will be the approximate average access time of a record from one of the six files on the sequential device ?

131

198

286

433

128. Which type of design problem in file system?

How the file system should look to the user

Algorithm and data structure must be created to map the logical file system onto the secondary storage device

Both (a) and (b)

None of these

129. Consider six files : F1, F2, F3, F4, F5, F6 with corresponding sizes 100, 200, 70, 40, 250 and 50 respectively, the files are to be stored on a sequential device in such a way that as to optimize access time. In what order should the files be stored?

F6, F5, F4, F3, F2, F1

F1 F2, F3, F4, F5, F6

F5, F2, F1, F3, F6 , F4

F4, F6, F3, F1 F2, F5

130. Shared sub-directories and files are example of

a cyclic graph directory

tree structured direction

one level directory

none of these

131. which types of file organization are supported by magnetic tape?

random files

contiguous sequential file

indexed sequential file

all of these

132. Number of minimal set of required file operations are

two

four

five

six

133. The volatility of a file refers to

the number of records added or deleted from a file composed to the original number of records in that file

efficiency with which non-sequential files are processed

the extent where the records of the file are contiguous and in proximity to others

percentage of records that has changed in a given time period.

134. How many common file type are there?

nine

six

five

two

135. Wild-card specifiers

provide an easy way of finding groups of related files

are only used when printing the contents of files

can be used when writing a file

allow several files to be read simultaneously

136. System supports two types of file, which are

text files

executable binary flies

both (a) and (b

none of these

137. Disaster recovery

is needed by every installation

is never needed

varies in degree between installations

requires off-site computer for immediate use

138. The simplest directory structure is

single level directory

two level directory

tree structure directory

none of these

139. An incremental backup

uses more tapes

should be done each month

saves only files that have recently changed

saves all files

140. Solution of name collision problem is

single level directory

two level directory

tree structure

all of these