The three items that are made from metals or their alloys. The specific metal or alloy used for each item and its characteristic.

Question

Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories: Groups should have Read+Write access Leave owner permissions as they are “Everyone else” should not have any access Submit for grade: Screenshot of /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions

Answer 1

Question

Chapter 1, Problem 2QAP

To determine

The three items that are made from metals or their alloys. The specific metal or alloy used for each item and its characteristic.

Expert Solution & Answer

Learn your wayIncludes step-by-step video

See solution

Check out sample textbook solution

02:09

Students have asked these similar questions

Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories: Groups should have Read+Write access Leave owner permissions as they are “Everyone else” should not have any access Submit for grade: Screenshot of /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions

Given the following knapsack problem: item weight value 1 2 lbs $40 2 5 lbs $65 3 6 lbs $72 4 lbs $60 Knapsack capacity W=12 Find the most valuable subset of the items that fit into the knapsack. You must show and explain your intermediate steps for the following questions. a) If it is a fractional knapsack problem, provide the optimal solution using greedy algorithm (Greedy strategy: choosing items with greatest value per pound) b) If it is a 0-1 knapsack problem, provide the optimal solution using dynamic programming (you need to provide the optimal value, the list of items that make up the optimal solution, and the V table) V[k, w] = V[k - 1,w] - if wk > w [max{ V[k − 1, w], V[k − 1, w − Wk] + vk} else

show workings and explaination