Toggle navigation
Terms & Conditions
Contact
Home
GK
Computer
TRB
TNPSC
Aptitude
English
Reasoning
Technical
Bank Exams
SSC
Engineering
Puzzles
Interview
GD Topics
Blogs
Online Test
Free computer quiz Online Test - MeritNotes
Home
Online Exam
No. of Questions :10
Remaining Time :
1. The first fit algorithm
(a)
places the first program in the best partition
(b)
places a program in the first possible partition
(c)
places a program in the best possible partition
(d)
waits for correct partition to become available
2. Access time is the highest in the case of
(a)
magnetic disks
(b)
swapping devices
(c)
cache
(d)
floppy disk
3. A partitioned data set is most used for
(a)
storing ISAM files
(b)
storing back up information
(c)
storing program data
(d)
a program or source library
4. Boundary registers
(a)
track page boundaries
(b)
track the beginning and ending of program
(c)
are only necessary with fixed partitions
(d)
are used for temporary program variable storage
5. How many number of minimal set of required file operations?
(a)
four
(b)
sive
(c)
six
(d)
seven
6. The worst fit algorithm
(a)
places a program in the smallest possible partition
(b)
should never be used
(c)
is used only when nothing better is available
(d)
places a program in the largest available partition
7. In a magnetic disk, data is recorded in a set of concentric tracks which are subdivided into
(a)
groups
(b)
periods
(c)
zones
(d)
sectors
8. The file structure that redefines it, first record at a base of zero uses the term
(a)
hashing
(b)
dynamic reallocation
(c)
key fielding
(d)
relative organization
9. Data encryption
(a)
is not necessary, since data cannot be intercepted
(b)
cannot be used by private installations
(c)
is most used by public bill board networks
(d)
is most used by financial networks
10. System supports two types of file, which are
(a)
text files
(b)
executable binary files
(c)
both a and b
(d)
none of these