Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
18 Cards in this Set
- Front
- Back
In a file system, what is a 'field'?
|
Smallest logical item of data understood by the file system.
|
|
Give two examples of a field.
|
Integer, string
|
|
In a file system, what is a 'record'?
|
One or more fields but treated as a single unit by applications for read/write purposes.
|
|
In a file system, what is a 'file'?
|
Collection of identically represented records, accessed by unique names.
|
|
In a file system, what is a 'database'?
|
One or more files, whose contents are logically related.
|
|
What is DBMS?
|
Database Management System. Manages a whole drive or partition, assuming the role of OS in access, security and backup.
|
|
What are the goals of a file management system?
|
To support the storage, searching and modification of user data, to optimise throughput and response time and to provide transparent access to devices
|
|
How does a file management system meet the needs of multiple users?
|
Recording of owners, file names, permissions
|
|
With what do device drivers directly communicate?
|
IO hardware, commencing requests and receiving completion notification via DMA
|
|
What is the role of the IO Supervisor?
|
To manage choice of device, its status and to allocate IO buffers
|
|
Who really 'owns' directories?
|
The OS - deleting a file within a directory leaves the OS to deallocate disk blocks
|
|
What is an Inode?
|
An information structure kept separate in modern OS from its directory entry.
|
|
What information is stored within an inode?
|
File type, size and limit, owner, users, access constraints, dates and times of accesss, creation, modification and backup/recovery
|
|
What is the problem with contiguous allocation of files in blocks?
|
Requires that the maximum size of the file be determined upon creation and hence cannot grow. We see internal and external fragmentation if files are a bad fit and as files are deleted.
|
|
What is the opposite of contiguous allocation of files?
|
Chained allocation
|
|
WHat is chained allocation?
|
Chained blocks which form a linked list, where each block contains a 32-bit pointer indicating the address of the next file in the chain
|
|
What is the benefit of chained allocation?
|
Can place new blocks anywhere on the disk as they needn't be contiguous.
|
|
What is the indexed allocation method?
|
Multi-level index for each file.
|