Answered step by step
Verified Expert Solution
Question
1 Approved Answer
please dont answer posted it on accident MEEN 2240: Homework #2 Submission Deadline: Section 001: Wednesday, 1/29, 2:00 pm Section 002: Thursday, 1/30, 2:30 pm
please dont answer posted it on accident
MEEN 2240: Homework #2 Submission Deadline: Section 001: Wednesday, 1/29, 2:00 pm Section 002: Thursday, 1/30, 2:30 pm Submissions after the deadline will not be accepted. Emailed submissions ill not be accepted. Instructions (Assigned Problems): Create a script file HW2.m and perform each of the assigned problems within it. The script file must be in the format shown in the template on Canvas, Submissions that do not use the template format will not be graded. Submission to Canvas: Place the script file into a folder, compress the folder, and upload the zip file. Assigned Problems: AP1. a. Create a variable 'A' which stores a 1x 5 vector of random integers in the inclusive range from 3 to 10. b. Create a variable B' which stores a 10 x 1 vector of random integers in the inclusive range from 2 to 7. c. Using the min and max functions, create a matrix 'mat_1' of all ones with the following dimensions: (minimum value in A) x (maximum value in B) d. Using the variable 'mat_1", create a new matrix 'mat_1t' of all ones with the following dimensions: (maximum value in B) x (minimum value in A) AP2. ITTT Part Weight Assembly #2 Assembly #3 Assembly #1 Part 1.2 1.9 0.9 #2 0.5 0.4 0.3 #3 2.2 2.9 2.6 14 5.1 5.3 4.9 2.9 45 3.5 2.4 Create a matrix using the above data and write expressionis) that will: a. Find and retum the assembly number with the lowest total part weight. b. Find and retum the assembly number with the single heaviest part. (The expressions should work for a matrix with any number of assemblies or parts) Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started