Science Computer Science
COP4600 - ACTUAL EXAM 2025 TEST
COMPREHENSIVE QUESTIONS AND
VERIFIED ANSWERS (DETAILED &
ELABORATED) 100% SOLVED 2025!!
Save
Students also studied
Flashcard sets Study guides
Microsoft Word: Lesson 11 Review Tackling Snowflake Cert WGU C182 Objective
31 terms Teacher 305 terms Teacher 118 terms
Lydia_Kimani5 Preview jacklineshee00 Preview kanutabz82
A path is a sequence of directories used to reference a file. They
What is a path?
can be relative or absolute.
1. Locate free storage space
2. Store information in a persistent way (survives process
termination)
3. Allow more than one process to access the information store
Why do we need file systems? concurrently
4. Find information by human-accessible identifiers
5. Protect data from unauthorized use
6. Identifying types of data stored and programs that can read
the data
How are directories Directories can be implemented in-line or via reference ->
implemented? Variable attribute/name size
We mount a file system to make it accessible to programs
Why do we mount filesystems?
through the operating system.
Where will the root of the file system appear to the user?
Challenges with mounting
filesystem?
How should different devices be presented to the user?
When accessing a file system on boot block, Filesystem type/organization (super block), and
a device, we need to know? where the root directory is
What is in the filesystem The file system superblock holds information about its type,
superblock? format, and organization
Copies the Superblock from the disk being mounted to the
What happens when you make a superblock table in main memory.
mounting call in Unix
Sets pointers in the directory inode to FS mounted
, 1. Contiguous allocation (all-in-a-row)
2. Linked list allocation (block)
What are the approaches to file 3. Chained table allocation (FAT)
allocation? 4. Indexed allocation (index nodes)
5. Chained indexed allocation (index + linked list)
6. Multi-level indexed allocation (tree structure)
1. Read block at index "k"
Hardware is an abstraction that
2. Write block at index "k"
provides two main operations
3. Allocate and Deallocate
DEFINITION: A file's contents are stored purely in order on the
drive
Contiguous allocation
CONS: suffers from external fragmentation, because it is a
contiguous approach to system memory
DEFINITION: Each block holds a pointer to the next. Requires
iteration through drive blocks (drive accesses) for random access
Linked List Allocation
CONS: Problematic in large files; App has to iterate through each
node.
DEFINITION: Chain store the linked list as a table in memory to
Chained Table Allocation
minimize disk access. It is called a File Allocation Table (FAT)
DEFINITION: Indexed allocation stores locations of each block
Indexed Allocation in an index block referenced by the file control block
CONS: A pure index system limits file size
Multi-level Indexed Allocation Use direct and indirect blocks to increase maximum file size
Chained Indexed Allocation Direct blocks with an additional indirect pointer
1. Index Nodes
What are Inodes? 2. Store file block information, along with some block pointers -
but are usually smaller (128B or 256B
(T/F) Does a bigger block size True
have a better data rate?
(T/F) Does a bigger block size False
have a good disk space
utilization?
What happens with a worse disk Internal Fragmentation
space utilization?
(T/F) Does a smaller block size False, lower data rate
have a better data rate?
(T/F) Does a smaller block size True
have a good disk space
utilization?
1. Maximum partition size for different block sizes.
MS-DOS File System
2. The empty boxes represent forbidden combinations.
How do you keep track of a free (a) Storing the free list on a linked list
block? (b) A bitmap
Where the attributes and location information of a file are stored.
What is the file control block
It is often distributed across the file system, meaning that they
(FCB)?
are within directories or reachable from them
Common file attributes in an Owner, group, permissions, length, file type, read-lock, write-
FCB lock, date created, date modified, data accessed
COP4600 - ACTUAL EXAM 2025 TEST
COMPREHENSIVE QUESTIONS AND
VERIFIED ANSWERS (DETAILED &
ELABORATED) 100% SOLVED 2025!!
Save
Students also studied
Flashcard sets Study guides
Microsoft Word: Lesson 11 Review Tackling Snowflake Cert WGU C182 Objective
31 terms Teacher 305 terms Teacher 118 terms
Lydia_Kimani5 Preview jacklineshee00 Preview kanutabz82
A path is a sequence of directories used to reference a file. They
What is a path?
can be relative or absolute.
1. Locate free storage space
2. Store information in a persistent way (survives process
termination)
3. Allow more than one process to access the information store
Why do we need file systems? concurrently
4. Find information by human-accessible identifiers
5. Protect data from unauthorized use
6. Identifying types of data stored and programs that can read
the data
How are directories Directories can be implemented in-line or via reference ->
implemented? Variable attribute/name size
We mount a file system to make it accessible to programs
Why do we mount filesystems?
through the operating system.
Where will the root of the file system appear to the user?
Challenges with mounting
filesystem?
How should different devices be presented to the user?
When accessing a file system on boot block, Filesystem type/organization (super block), and
a device, we need to know? where the root directory is
What is in the filesystem The file system superblock holds information about its type,
superblock? format, and organization
Copies the Superblock from the disk being mounted to the
What happens when you make a superblock table in main memory.
mounting call in Unix
Sets pointers in the directory inode to FS mounted
, 1. Contiguous allocation (all-in-a-row)
2. Linked list allocation (block)
What are the approaches to file 3. Chained table allocation (FAT)
allocation? 4. Indexed allocation (index nodes)
5. Chained indexed allocation (index + linked list)
6. Multi-level indexed allocation (tree structure)
1. Read block at index "k"
Hardware is an abstraction that
2. Write block at index "k"
provides two main operations
3. Allocate and Deallocate
DEFINITION: A file's contents are stored purely in order on the
drive
Contiguous allocation
CONS: suffers from external fragmentation, because it is a
contiguous approach to system memory
DEFINITION: Each block holds a pointer to the next. Requires
iteration through drive blocks (drive accesses) for random access
Linked List Allocation
CONS: Problematic in large files; App has to iterate through each
node.
DEFINITION: Chain store the linked list as a table in memory to
Chained Table Allocation
minimize disk access. It is called a File Allocation Table (FAT)
DEFINITION: Indexed allocation stores locations of each block
Indexed Allocation in an index block referenced by the file control block
CONS: A pure index system limits file size
Multi-level Indexed Allocation Use direct and indirect blocks to increase maximum file size
Chained Indexed Allocation Direct blocks with an additional indirect pointer
1. Index Nodes
What are Inodes? 2. Store file block information, along with some block pointers -
but are usually smaller (128B or 256B
(T/F) Does a bigger block size True
have a better data rate?
(T/F) Does a bigger block size False
have a good disk space
utilization?
What happens with a worse disk Internal Fragmentation
space utilization?
(T/F) Does a smaller block size False, lower data rate
have a better data rate?
(T/F) Does a smaller block size True
have a good disk space
utilization?
1. Maximum partition size for different block sizes.
MS-DOS File System
2. The empty boxes represent forbidden combinations.
How do you keep track of a free (a) Storing the free list on a linked list
block? (b) A bitmap
Where the attributes and location information of a file are stored.
What is the file control block
It is often distributed across the file system, meaning that they
(FCB)?
are within directories or reachable from them
Common file attributes in an Owner, group, permissions, length, file type, read-lock, write-
FCB lock, date created, date modified, data accessed
