All categories

4 years ago

A material has the following properties: Sut = 275 MPa and n = 0.40. Calculate its strength coefficient, K.

Engineering

1 answer:

Tems11 [23]4 years ago

6 0

Answer:

The strength coefficient is K = 591.87 MPa

Explanation:

We can calculate the strength coefficient using the equation that relates the tensile strength with the strain hardening index given by

$S_{ut}=K \left(\cfrac ne \right)^n$

where Sut is the tensile strength, K is the strength coefficient we need to find and n is the strain hardening index.

Solving for strength coefficient

From the strain hardening equation we can solve for K

$K = \cfrac{S_{ut}}{\left(\cfrac ne \right)^n}$

And we can replace values

$K = \cfrac{275}{\left(\cfrac {0.4}e \right)^{0.4}}\\K=591.87$

Thus we get that the strength coefficient is K = 591.87 MPa

You might be interested in

As you have learned, not all motor oils are the same. What are two things that make them different?.

saul85 [17]

Answer:

quality ingredients and exceeding industry standards

Explanation:

5 0

2 years ago

What level of wildfire risk do people living in Boulder have?

Luba_88 [7]

Answer:

The risk of catastrophic wildfire is a real and serious threat facing those who reside in the forested areas of Boulder County. Dating back to the Black Tiger Fire of 1989, wildfires have collectively destroyed some 250 homes or other structures, burned over 16,000 acres, and threatened the lives and properties of thousands of mountain residents. In an attempt to mitigate the loss of life and property in Boulder County, the Land Use Department has included wildfire mitigation measures in the planning review and building permit process.

Explanation:

8 0

3 years ago

Say you have a random, unordered list containing 4096 four-digit numbers. Describe the most efficient way to: sort the list and

Debora [2.8K]

Answer:

Answer explained below

Explanation:

It is given that numbers are four-digit so maximum value of a number in this list could be 9999.

So we need to sort a list of integers, where each integer lies between [0,9999].

For these given constraints we can use counting sort which will run in linear time i.e. O(n).

--------------------------------------------------------------------------------

Psuedo Code:

countSort(int numList[]) {

int count[10000];

count[i] = 0; for all i;

for(int num in numList){

count[num]+= 1;

}

return count;

}

--------------------------------------------------------------------------------

Searching in this count array will be just O(1).

E.g. Lets say we want to search if 3 was present in the original list.

Case 1: it was present in the original list:

Then the count[3] would have been incremented by our sorting algorithm. so in case element exists then count value of that element will be greater than 0.

Case 2: it was not present:

In this case count[3] will remain at 0. so in case element does not exist then count of that element will be 0.

So to search for an element, say x, we just need to check if count[x]>0.

So search is O(1).

Run times:

Sorting: O(n)

Search: O(1)

6 0

3 years ago

What does the Intake do?

4vir4ik [10]

Answer: