- Consider A Linux File System Using Inodes With The Following Layout 1 1 9 Inode 9 Directory User 1 29 File B 9 114 U 1 (75.95 KiB) Viewed 84 times
- Consider A Linux File System Using Inodes With The Following Layout 1 1 9 Inode 9 Directory User 1 29 File B 9 114 U 2 (51.03 KiB) Viewed 84 times
a Access control information
b File length
c Link count
d File name
e File inode number
Consider a Linux file system using inodes, with the following layout: 1 1 9 inode #9, directory user 1 29 file b 9 114 user 3 1 118 dir_a 29 file a →inode #114, directory 114 1 194 dir_a 46 file_c What would the link count in inode 29 be? 0 1 O 2 -1 6 OO inode #46, symlink /user 1/file a
Which of the following statements are true of working set page replacement algorithms? They steal page frames from one process to give them to another They try to ensure a more or less equal division of page frames among running processes They are well suited to systems using round robin scheduling They quickly reach equilibrium and tend to stay there They try to customize the number of page frames allocated to a process to its current needs