Week 12: Physical File Structures (Implementation DOS WINNT)) Flashcards

1
Q

What role do hard disks play in file systems?

A

They provide the bulk of secondary storage where file systems are maintained, with data organized in blocks.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Why are blocks important in file systems?

A

They improve I/O efficiency by grouping data for transfer, typically using sizes like 512 bytes or larger.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What layers are involved in a file system?

A
  • Application programs
  • Logical file system (files, directories)
  • Basic file system (block read/write)
  • I/O control (interrupts, device drivers)
  • Hardware devices.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What happens when a file is created?

A

A new directory entry is made in the logical file system, including attributes and data block information.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How are files accessed after being opened?

A
  • The operating system copies the file information into a table in operating system memory
  • The file is then referred to by index into this table:
    • in UNIX these indices are called file descriptors
    • in Windows / WinNT they are called file handles
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is contiguous allocation?

A

Storing files in a single, contiguous block of disk space for fast sequential access but prone to fragmentation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is non-contiguous allocation using linked lists?

A

Files are stored as linked blocks, with each block pointing to the next. It allows non-contiguous storage but slows random access.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is indexed allocation?

A

File blocks are indexed in a table, allowing fast random access but potentially wasting space with unused index entries.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a partition table?

A

A structure in the boot sector of a disk that defines partitions as contiguous blocks and their sizes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How are partitions identified in MS-DOS?

A

Partitions are labelled as C:, D:, etc., and each can have its own file system.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the File Allocation Table (FAT)?

A

The File Allocation Table (FAT) is an index array that works like an array of linked-list block numbers, stored in its own disk block.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What does the File Allocation Table (FAT) do?

A
  • The FAT helps locate all the blocks that make up a file.
  • A directory entry points to the starting block of a file.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How does the File Allocation Table work?

A

Each block has an entry in the FAT that:
- Points to the next block in the file’s chain.
- Contains a special value to mark the end of the file (EOF).
- Marks free blocks or bad blocks.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is VFAT?

A

It is a slight variation of FAT that allows for:
- Long file names (up to 256 characters) and
- Optional 16-bit or 32-bit FAT for larger partition support.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What are the shortcomings of FAT systems?

A
  • Key file data (time, date, size) are kept in the directory entry: this prevents hard links from being used
  • Large disk sizes are only possible using large clusters
  • The FAT offers poor performance and is non-robust
  • There is no file access protection mechanism
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the Master File Table (MFT) in NTFS?

A

A variable-size table describing every file and directory in a volume, including attributes and block indices.

17
Q

How does NTFS handle fault tolerance?

A

NTFS attempts to allocate the MFT contiguously and maintains a mirror of the MFT.

18
Q

What is an inode in UNIX?

A

A data structure that stores:
- File information, e.g. size, access modes, times
- Block numbers of how to locate all the file data blocks

19
Q

How are UNIX directories structured?

A

They are simple, containing file names and pointers to inodes.

20
Q

What are the special directory entries in UNIX?

A

. refers to the current directory, and .. refers to the parent directory.

21
Q

What is the process of mounting a file system in UNIX?

A

The root directory of a file system is registered with the kernel. Then, other file systems can be mounted onto the main root file system at a particular directory location.

22
Q

What steps are involved in finding a file in UNIX?

A

The system traverses directories, locating the file’s inode, which points to its data blocks.