Anna University
2 Marks
1.What are the various layers of a file system?
The file system is composed of many different levels. Each level in the design uses the feature of the lower levels to create new features for use by higher levels.
Ø Application programs
Ø Logical file system
Ø File-organization module
Ø Basic file system
Ø I/O control
Ø Devices
2.What are the structures used in file-system implementation?
Several on-disk and in-memory structures are used to implement a file system
i. On-disk structure include
1. Boot control block
2. Partition block
3. Directory structure used to organize the files
4. File control block (FCB)
ii .In-memory structure include
1. In-memory partition table
2. In-memory directory structure
3. System-wide open file table
4. Per-process open table
3.What are the functions of virtual file system (VFS)?
It has two functions
i. It separates file-system-generic operations from their implementation defining a clean VFS interface. It allows transparent access to different types of file systems mounted locally.
ii.VFS is based on a file representation structure, called a vnode. It contains a numerical value for a network-wide unique file .The kernel maintains one vnode structure for each active file or directory.
4.Define seek time and latency time.
The time taken by the head to move to the appropriate cylinder or track is called seek time. Once the head is at right track, it must wait until the desired block rotates under the read- write head. This delay is latency time.
5.What are the allocation methods of a disk space?
Three major methods of allocating disk space which are widely in use are
§ Contiguous allocation
§ Linked allocation
§ Indexed allocation
6.What are the advantages of Contiguous allocation?
The advantages are
§ Supports direct access
§ Supports sequential access
§ Number of disk seeks is minimal.
7.What are the drawbacks of contiguous allocation of disk space?
The disadvantages are
§ Suffers from external fragmentation
§ Suffers from internal fragmentation
§ Difficulty in finding space for a new file
§ File cannot be extended
§ Size of the file is to be declared in advance
8.What are the advantages of Linked allocation?
The advantages are
§ No external fragmentation
§ Size of the file does not need to be declared
9.What are the disadvantages of linked allocation?
The disadvantages are
§ Used only for sequential access of files.
§ Direct access is not supported
§ Memory space required for the pointers.
§ Reliability is compromised if the pointers are lost or damaged
10.What are the advantages of Indexed allocation?
The advantages are
§ No external-fragmentation problem
§ Solves the size-declaration problems.
§ Supports direct access
11.How can the index blocks be implemented in the indexed allocation scheme?
The index block can be implemented as follows
§ Linked scheme
§ Multilevel scheme
§ Combined scheme
12.Define rotational latency and disk bandwidth.
Rotational latency is the additional time waiting for the disk to rotate the desired sector to the disk head. The disk bandwidth is the total number of bytes transferred, divided by the time between the first request for service and the completion of the last transfer.
13.How free-space is managed using bit vector implementation?
The free-space list is implemented as a bit map or bit vector. Each block is represented by 1 bit. If the block is free, the bit is 1; if the block is allocated, the bit is 0.
14.Define buffering.
A buffer is a memory area that stores data while they are transferred between two devices or between a device and an application. Buffering is done for three reasons
§ To cope with a speed mismatch between the producer and consumer of a data stream
§ To adapt between devices that have different data-transfer sizes
§ To support copy semantics for application I/O
15.Define caching.
A cache is a region of fast memory that holds copies of data. Access to the cached copy is more efficient than access to the original. Caching and buffering are distinct functions, but sometimes a region of memory can be used for both purposes.
16.Define spooling.
A spool is a buffer that holds output for a device, such as printer, that cannot accept interleaved data streams. When an application finishes printing, the spooling system queues the corresponding spool file for output to the printer. The spooling system copies the queued spool files to the printer one at a time.
17.What are the various disk-scheduling algorithms?
The various disk-scheduling algorithms are
§ First Come First Served Scheduling
§ Shortest Seek Time First Scheduling
§ SCAN Scheduling
§ C-SCAN Scheduling
§ LOOK scheduling
18.What is low-level formatting?
Before a disk can store data, it must be divided into sectors that the disk controller can read and write. This process is called low-level formatting or physical formatting. Low-level formatting fills the disk with a special data structure for each sector. The data structure for a sector consists of a header, a data area, and a trailer.
19.What is the use of boot block?
For a computer to start running when powered up or rebooted it needs to have an initial program to run. This bootstrap program tends to be simple. It finds the operating system on the disk loads that kernel into memory and jumps to an initial address to begin the operating system execution. The full bootstrap program is stored in a partition called the boot blocks, at fixed location on the disk. A disk that has boot partition is called boot disk or system disk.
20.What is sector sparing?
Low-level formatting also sets aside spare sectors not visible to the operating system. The controller can be told to replace each bad sector logically with one of the spare sectors. This scheme is known as sector sparing or forwarding.
21. What are the techniques used for performing I/O.
1. Programmed I/O.
2. Interrupt driven I/O.
3. Direct Memory Access (DMA).
22. Give an example of an application in which data in a file should be accessed in the following order:
a. Sequentially
b. Randomly
Ans:
a. Print the content of the file.
b. Print the content of record i. This record can be found using hashing or index techniques.
23. What problems could occur if a system allowed a file system to be mounted simultaneously at more than one location?
There would be multiple paths to the same file, which could confuse users or encourage mistakes. (Deleting a file with one path deletes the file in all the other paths.)
24.Why must the bit map for file allocation be kept on mass storage rather than in main memory?
In case of system crash (memory failure), the free-space list would not be lost as it would be if the bit map had been stored in main memory.
25. What criteria should be used in deciding which strategy is best utilized for a particular file?
Contiguous—if file is usually accessed sequentially, if file is relatively small.
Linked—if file is large and usually accessed sequentially.
Indexed—if file is large and usually accessed randomly.
16 Marks
1. Explain the allocation methods for disk space.
2. What are the various methods for free space management?
3. Write about the kernel I/O subsystem.
4. Explain the various disk scheduling techniques
5. Write notes about disk management and swap-space management.
6. Explain in detail the allocation and freeing the file storage space.
7. Explain the backup and recovery of files.
8. Discuss with diagrams the following three disk scheduling: FCFS, SSTF,
C-SCAN.
9. Compare and contrast the FREE SPACE and SWAP SPACE management.
10. Explain the disk scheduling algorithms
11. Discuss the file system organization and file system mounting.
12. Explain the merits and demerits of any one-file system allocation method.
13. Describe the most common schemes for defining the logical structure of a Directory.
14. Explain the life cycle of an I/O request with flowchart.
15. Discuss about the UNIX file system in detail.
16. Discuss briefly about Memory Management in UNIX.
17. Explain the process management under LINUX OS.
18. Compare and contrast “free-space management” and “swap-space management”.
19. What is meant by “symmetric multiprocessing” and “asymmetric multiprocessing” in LINUX OS.
20. In what ways the directory is implemented?
21. Explain linked allocation in detail.
22. Write the indexed allocation with its performance.
23. Explain the I/O hardware.
2 Marks
1.What are the various layers of a file system?
The file system is composed of many different levels. Each level in the design uses the feature of the lower levels to create new features for use by higher levels.
Ø Application programs
Ø Logical file system
Ø File-organization module
Ø Basic file system
Ø I/O control
Ø Devices
2.What are the structures used in file-system implementation?
Several on-disk and in-memory structures are used to implement a file system
i. On-disk structure include
1. Boot control block
2. Partition block
3. Directory structure used to organize the files
4. File control block (FCB)
ii .In-memory structure include
1. In-memory partition table
2. In-memory directory structure
3. System-wide open file table
4. Per-process open table
3.What are the functions of virtual file system (VFS)?
It has two functions
i. It separates file-system-generic operations from their implementation defining a clean VFS interface. It allows transparent access to different types of file systems mounted locally.
ii.VFS is based on a file representation structure, called a vnode. It contains a numerical value for a network-wide unique file .The kernel maintains one vnode structure for each active file or directory.
4.Define seek time and latency time.
The time taken by the head to move to the appropriate cylinder or track is called seek time. Once the head is at right track, it must wait until the desired block rotates under the read- write head. This delay is latency time.
5.What are the allocation methods of a disk space?
Three major methods of allocating disk space which are widely in use are
§ Contiguous allocation
§ Linked allocation
§ Indexed allocation
6.What are the advantages of Contiguous allocation?
The advantages are
§ Supports direct access
§ Supports sequential access
§ Number of disk seeks is minimal.
7.What are the drawbacks of contiguous allocation of disk space?
The disadvantages are
§ Suffers from external fragmentation
§ Suffers from internal fragmentation
§ Difficulty in finding space for a new file
§ File cannot be extended
§ Size of the file is to be declared in advance
8.What are the advantages of Linked allocation?
The advantages are
§ No external fragmentation
§ Size of the file does not need to be declared
9.What are the disadvantages of linked allocation?
The disadvantages are
§ Used only for sequential access of files.
§ Direct access is not supported
§ Memory space required for the pointers.
§ Reliability is compromised if the pointers are lost or damaged
10.What are the advantages of Indexed allocation?
The advantages are
§ No external-fragmentation problem
§ Solves the size-declaration problems.
§ Supports direct access
11.How can the index blocks be implemented in the indexed allocation scheme?
The index block can be implemented as follows
§ Linked scheme
§ Multilevel scheme
§ Combined scheme
12.Define rotational latency and disk bandwidth.
Rotational latency is the additional time waiting for the disk to rotate the desired sector to the disk head. The disk bandwidth is the total number of bytes transferred, divided by the time between the first request for service and the completion of the last transfer.
13.How free-space is managed using bit vector implementation?
The free-space list is implemented as a bit map or bit vector. Each block is represented by 1 bit. If the block is free, the bit is 1; if the block is allocated, the bit is 0.
14.Define buffering.
A buffer is a memory area that stores data while they are transferred between two devices or between a device and an application. Buffering is done for three reasons
§ To cope with a speed mismatch between the producer and consumer of a data stream
§ To adapt between devices that have different data-transfer sizes
§ To support copy semantics for application I/O
15.Define caching.
A cache is a region of fast memory that holds copies of data. Access to the cached copy is more efficient than access to the original. Caching and buffering are distinct functions, but sometimes a region of memory can be used for both purposes.
16.Define spooling.
A spool is a buffer that holds output for a device, such as printer, that cannot accept interleaved data streams. When an application finishes printing, the spooling system queues the corresponding spool file for output to the printer. The spooling system copies the queued spool files to the printer one at a time.
17.What are the various disk-scheduling algorithms?
The various disk-scheduling algorithms are
§ First Come First Served Scheduling
§ Shortest Seek Time First Scheduling
§ SCAN Scheduling
§ C-SCAN Scheduling
§ LOOK scheduling
18.What is low-level formatting?
Before a disk can store data, it must be divided into sectors that the disk controller can read and write. This process is called low-level formatting or physical formatting. Low-level formatting fills the disk with a special data structure for each sector. The data structure for a sector consists of a header, a data area, and a trailer.
19.What is the use of boot block?
For a computer to start running when powered up or rebooted it needs to have an initial program to run. This bootstrap program tends to be simple. It finds the operating system on the disk loads that kernel into memory and jumps to an initial address to begin the operating system execution. The full bootstrap program is stored in a partition called the boot blocks, at fixed location on the disk. A disk that has boot partition is called boot disk or system disk.
20.What is sector sparing?
Low-level formatting also sets aside spare sectors not visible to the operating system. The controller can be told to replace each bad sector logically with one of the spare sectors. This scheme is known as sector sparing or forwarding.
21. What are the techniques used for performing I/O.
1. Programmed I/O.
2. Interrupt driven I/O.
3. Direct Memory Access (DMA).
22. Give an example of an application in which data in a file should be accessed in the following order:
a. Sequentially
b. Randomly
Ans:
a. Print the content of the file.
b. Print the content of record i. This record can be found using hashing or index techniques.
23. What problems could occur if a system allowed a file system to be mounted simultaneously at more than one location?
There would be multiple paths to the same file, which could confuse users or encourage mistakes. (Deleting a file with one path deletes the file in all the other paths.)
24.Why must the bit map for file allocation be kept on mass storage rather than in main memory?
In case of system crash (memory failure), the free-space list would not be lost as it would be if the bit map had been stored in main memory.
25. What criteria should be used in deciding which strategy is best utilized for a particular file?
Contiguous—if file is usually accessed sequentially, if file is relatively small.
Linked—if file is large and usually accessed sequentially.
Indexed—if file is large and usually accessed randomly.
16 Marks
1. Explain the allocation methods for disk space.
2. What are the various methods for free space management?
3. Write about the kernel I/O subsystem.
4. Explain the various disk scheduling techniques
5. Write notes about disk management and swap-space management.
6. Explain in detail the allocation and freeing the file storage space.
7. Explain the backup and recovery of files.
8. Discuss with diagrams the following three disk scheduling: FCFS, SSTF,
C-SCAN.
9. Compare and contrast the FREE SPACE and SWAP SPACE management.
10. Explain the disk scheduling algorithms
11. Discuss the file system organization and file system mounting.
12. Explain the merits and demerits of any one-file system allocation method.
13. Describe the most common schemes for defining the logical structure of a Directory.
14. Explain the life cycle of an I/O request with flowchart.
15. Discuss about the UNIX file system in detail.
16. Discuss briefly about Memory Management in UNIX.
17. Explain the process management under LINUX OS.
18. Compare and contrast “free-space management” and “swap-space management”.
19. What is meant by “symmetric multiprocessing” and “asymmetric multiprocessing” in LINUX OS.
20. In what ways the directory is implemented?
21. Explain linked allocation in detail.
22. Write the indexed allocation with its performance.
23. Explain the I/O hardware.
0 comments:
Post a Comment