I would appreciate help with these questions. Please label each question, then w
ID: 3813543 • Letter: I
Question
I would appreciate help with these questions.
Please label each question, then write answer. For example, Question 1) then write answer.
Thank You
1. In UNIX directories are treated as files, in fact a directory is a file. Directories have permissions associated with them as do files.
• Given a file with permissions of 644 octal (rw- r-- r-- ) within a directory with permissions of 730 octal (rwx -wx ---) . How can this combination of permissions compromise the file?
• Given a file with permissions of 444 octal (r-- r-- r-- ) within a directory with permissions of 770 octal (rwx rwx ---). How can this combination of permissions compromise the file?
2. Explain how UNIX permissions could be used to support shared access of files between the owner and the designated people in each scenario.
• How would you allow access to file1 for person1?
• How would you allow access to file1 for person1 and file2 for person2?
• How effective are Unix permissions for allowing shared file access? What is an alternative to using permissions?
Explanation / Answer
Scan string from left to right
First input is 'a' and follow the rule:
on input 'a' and STACK alphabet Z, push the input 'a' into STACK as : (a,Z/aZ) and state are q0
Second input is 'a' then follow the rule:
on input 'a' and STACK alphabet 'a', push the input 'a' into STACK as : (a,a/aa) and state are q0
Third input is 'b' then follow the rule:
on input 'b' and STACK alphabet 'a', push the input 'b' into STACK as : (b,a/ba) and state are q0
Fourth input is 'b' then follow the rule:
on input 'b' and STACK alphabet 'b', push the input 'b' into STACK as : (b,b/bb) and state are q0
Fifth input is 'c' then follow the rule:
on input 'c' and STACK alphabet 'b' and state is q0, pop one 'b' as : (c,b/) and state are q1
Sixth input is 'c' and prime of STACK is 'b' therefore follow the rule:
on input 'c' and STACK alphabet 'b' and state is q1, pop one 'b' as : (c,b/) and state stay q1
Seventh input is 'c' and prime of STACK is 'a' therefore follow the rule:
on input 'c' and STACK alphabet 'a' and state is q1, pop one 'a' as : (c,a/) and state are q1
Eighth input is 'c' and prime of STACK is 'a' therefore follow the rule:
on input 'c' and STACK alphabet 'a' and state is q1, pop one 'a' as : (c,a/) and state are stay q1
We reached finish of the string, therefore follow the rule:
on input and STACK alphabet Z, attend final state(qf) as : (, Z/Z)