M13: The OS File System Flashcards

1
Q

fseek() :

A

sets the position of the stream to the given offset, allowing
seeking a specified part of the file

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

disk block

A

basic logic unit of storage on disk of a contiguous set of bytes

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

Disk partitions:

A

logical split of the actual disk drive. The operating system views each partition as a distinct disk, and different operating systems may be run in each split; each partition has at least one directory, in which all the partition’s files are listed.

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

The typical internal structure of the disk partition includes:

A

Boot block
Superblock
Free space data structure
i-node list

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

Boot block:

A

contains information on the disk layout and code for loading the operating system into the kernel space

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

Superblock:

A

contains basic information about the file system, including
the file system size, list of free blocks, list of allocated blocks, and time of the last modification to the partition; the superblock can be read into
memory at boot time

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

Free space data structure:

A

tracks the free blocks in the disk

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

I-nodes list :

A

stores information about the individual files stored on disk, and allocatable blocks for directories and file systems

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

Master boot record :

A

stores information about the entire drive

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

Partition table:

A

specifies the beginning of each partition

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

Disk space allocation

A

managing data in the disk with the aims to ensure fast

sequential access, fast random access, the ability to grow a file system quickly, and to minimize fragmentation

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

Contiguous allocation :

A

each file occupies a contiguous region of blocks

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

Linked-list allocation :

A

hold a linked list of blocks for each file such that

each block contains a pointer to the next block

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

File allocation table :

A

stores a condensed version of the linked list to be
stored at the beginning of the file system; the file is stored in allocated
clusters

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

Linked list with indexing or i-nodes

A

supports direct access to the file’s

blocks by storing files in the i-node data structure

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

i-node (index node) :

A

kernel structure storing information about
each file in the file system; contains a pointer to the disk blocks
containing the file’s data, and information such as the file
permissions, ownership, modification time, and file type

17
Q

directory

A

file that holds the list of filenames and their inodes; provides
information needed to find the disk data blocks of a file

18
Q

Hard links:

A

to represent two different paths for a file, create a single i-node and
have two directory entries that point to the same i-node; relies on the link-counter

19
Q

Link-counter:

A

counts the number of ways that an i-node can be retrieved

along different paths

20
Q

Symbolic/soft link:

A

the original file has its own i-node and for each reference or
path to the file, there is a separate i-node, of type LINK, for a file that just
contains the path name to the original file

21
Q

Free space management:

A

tracking unallocated blocks in a portion of the disk
partition
Approaches: A) Bitmap B) Linked List

22
Q

Bitmap - free space management

A

maintains for the entire disk partition with one encoding the fact
that the block of a particular number is free and zero otherwise

23
Q

Linked list:

A

list storing the free blocks

24
Q

In-memory cache :

A

uses a scheme to store blocks that are likely to be requested
from disk, to shortcut the need for a disk search and propagate the data to the
requesting process

25
Q

LRU scheme :

A

given the limited in-memory cache size, evicts the least

recently used block from the cache when new blocks are being added in

26
Q

Incremental backups :

A

every time you synchronize with your server, it will only

backup files that have been changed since the last time

27
Q

Physical backup:

A

physically copy block by block from one disk to another

28
Q

Logical backup:

A

copies files from one disk to another