1. A ……………….. is the basic element of data where individual field contains a single value, such as an employees last name, a data or the value of the sensor reading.
A) field
B) record
C) file
D) database
2. A ……………………. is collection of related fields that can be treated as a unit by some application program.
A) field
B) record
C) file
D) database
3. …………………….. communicate directly with peripheral devices or their controllers or channels.
A) Device drivers
B) Physical I/O
C) Basic I/O supervisor
D) Logical I/O
4. The ……………………. is responsible for all file I/O initiation and termination.
A) Device drivers
B) Physical I/O
C) Basic I/O supervisor
D) Logical I/O
5. ……………………….. provides a general purpose record I/O capability and maintains basic data about files.
A) Device drivers
B) Physical I/O
C) Basic I/O supervisor
D) Logical I/O
6. In the ……………………… file organization, data are collected in the order in which they arrive where each record consists of one burst of data.
A) pile
B) sequential
C) indexed sequential
D) indexed
7. In …………………….. file organization, a fixed format is used for records where all records are of the same length, consisting of the same number of fixed length fields in a particular order.
A) pile
B) sequential
C) indexed sequential
D) indexed
8. The ……………………… maintains the key characteristic of the sequential file: Records are organized in sequence based on a key field.
A) pile
B) sequential file
C) indexed sequential file
D) indexed file
9. The ……………………… retains one limitation of the sequential file: effective processing is limited to that which is based on a single field of the file.
A) pile
B) sequential file
C) indexed sequential file
D) indexed file
10. …………………… are used mostly in applications where data are rarely processed exhaustively.
A) pile
B) sequential file
C) indexed sequential file
D) indexed file
11. Airline reservation systems and inventory control system are the examples of …………………….. system.
A) pile
B) sequential file
C) indexed sequential file
D) indexed file
12. The …………………. greatly reduced the time required to access a single record, without sacrificing the sequential nature of the file.
A) pile
B) sequential file
C) indexed sequential file
D) indexed file
13. In free space management, ………………….. method has negligible space overhead because there is no need for a disk allocation table, merely for a pointer to the beginning of the chain and the length of the first portion.
A) Bit tables
B) Chained Free Portions
C) Indexing
D) Free Block List
14. In …………………….. method on free space management, each block is assigned in a reserved portion of the disk.
A) Bit tables
B) Chained Free Portions
C) Indexing
D) Free Block List
15. A ………………… on free space management has the advantages that it relatively easy to find one or a contiguous group of free blocks.
A) Bit table
B) Chained Free Portion
C) Indexing
D) Free Block List
16. In ………………………….. method, the file allocation table contains a separate one level index for each file, the index has one entry for each portion allocated to the file.
A) Chained allocation
B) Indexed allocation
C) Contiguous allocation
D) Variable allocation
17. ………………….. is a preallocation strategy, using variable size portions where the file allocation table needs just a single entry for each file, showing the starting block and the length of the file.
A) Chained allocation
B) Indexed allocation
C) Contiguous allocation
D) Variable allocation
18. Typically, ………………… is on an individual block basis where each block contains a pointer to the next block in the chain.
A) Chained allocation
B) Indexed allocation
C) Contiguous allocation
D) Variable allocation
19. Which of the following is/are the types of operations that may be performed on the directory.
i) Search ii) Create file iii) Create directory iv) List directory
A) i, ii and iii only
B) ii, iii and iv only
C) i, ii and iv only
D) All i, ii, iii and iv
20. …………………. are often used where very rapid access is required, where fixed length records are used, and where records are always accessed one at a time.
A) Indexed files
B) Direct files
C) Sequential files
D) Indexed Sequential files
21. An alternative is to organize the sequential file physically is a ……………..
A) List
B) Linked List
C) Queue
D) Stack
22. …………………… are typically used in batch applications and are generally optimum for such applications if they involve the processing of all the records.
A) Indexed files
B) Direct files
C) Sequential files
D) Indexed Sequential files
23. Directories, pricing tables, schedules and name lists are the examples of ……………….
A) Indexed files
B) Direct files
C) Sequential files
D) Indexed Sequential files
24. An interactive user or a process has associated with pathname is a current directory which is often referred to as the …………………….
A) update directory
B) list directory
C) working directory
D) create directory
25. ……………………….. are small fixed portions which provide greater flexibility which may require large tables or complex structures for their allocation.
A) Blocks
B) Columns
C) Segments
D) Partitions
Answers
1. A) field
2. B) record
3. A) Device drivers
4. C) Basic I/O supervisor
5. D) Logical I/O
6. A) pile
7. B) sequential
8. C) indexed sequential file
9. C) indexed sequential file
10. D) indexed file
11. D) indexed file
12. C) indexed sequential file
13. B) Chained Free Portions
14. D) Free Block List
15. A) Bit table
16. B) Indexed allocation
17. C) Contiguous allocation
18. A) Chained allocation
19. C) i, ii and iv only
20. B) Direct files
21. B) Linked List
22. C) Sequential files
23. B) Direct files
24. C) working directory
25. A) Blocks
Read Next: Top 20 MCQ On I/O Management And Disk Scheduling
Read More: Operating System MCQ Questions
