1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
lorasvet [3.4K]
3 years ago
8

A three-point bending test was performed on an aluminum oxide specimen having a circular cross section of radius 5.6 mm; the spe

cimen fractured at a load of 4250 N when the distance between support points was 44 mm. Another test is to be performed on a specimen of this same material, but one that has a square cross section of 12 mm in length on each edge. At what load would you expect this specimen to fracture if the support point separation is maintained at 44 mm
Engineering
1 answer:
ankoles [38]3 years ago
4 0

Answer:

F =  8849 N

Explanation:

Given:

Load at a given point = F =  4250 N

Support span = L = 44 mm

Radius = R = 5.6 mm

length thickness of tested material = 12 mm

First compute the flexural strength for circular cross section using the formula below:

σ_{fs} = F_{f} L / \pi  R^{3}

σ = FL / π R³

Putting the given values in the above formula:

σ = 4250 ( 44 x 10⁻³ ) / π  ( 5.6 x 10⁻³ ) ³

  = 4250 ( 44 x 10⁻³ )  / 3.141593 ( 5.6 x 10⁻³ ) ³

  = 4250 (44 x 1 /1000 )) / 3.141593 ( 5.6 x 10⁻³ ) ³

  = 4250 ( 11 / 250  ) / 3.141593 ( 5.6 x 10⁻³ ) ³

  = 187 / 3.141593 ( 5.6 x 1 / 1000 ) ³

  = 187 / 3.141593 (0.0056)³

  = 338943767.745358

  = 338.943768 x 10⁶

σ = 338 x 10⁶ N/m²

Now we compute the load i.e. F from the following formula:

F_{f} = 2 σ_{fs} d³/3 L

F = 2σd³/3L

  = 2(338 x 10⁶)(12 x 10⁻³)³ / 3(44 x 10⁻³)

  = 2 ( 338 x 1000000 ) ( 12 x 10⁻³)³ / 3 ( 44 x 10⁻³)

  = 2 ( 338000000 ) ( 12 x 10⁻³)³ / 3 ( 44 x 10⁻³)

  = 676000000 ( 12 x 10⁻³)³ / 3 ( 44 x 10⁻³)

  = 676000000 ( 12  x  1/1000  )³ / 3 ( 44 x 10⁻³)

  = 676000000 (  3  / 250  )³ / 3 ( 44 x 10⁻³)

  = 676000000 (  27  / 15625000 )  / 3 ( 44 x 10⁻³)

  = 146016  / 125 / 3 ( 44 x 1 / 1000  )

  = ( 146016  / 125 ) /  (3 ( 11 /  250 ))

  =  97344  / 11

F =  8849 N

You might be interested in
The melting temperature of pure titanium = 1668°C, its density = 4.5 g/cm^3, specific heat = 0.544 J/gºC, and heat of fusion = 4
nataly862011 [7]

Answer:

A) 1384.6 J/g

b)110.768 MJ

Explanation:

Given data:

T_{melting} = 1668 degree C

density of titanium =  4.5 g/cm^3

specific heat = 0.544 J/g degree C

heat of fusion = 419 J/g

Pouring temperature for titanium = 1800 degree  C

Initial temperature  =  25 degree C

a) eneegy for heating unit mass is given as

E = C(T_{melting} - T_{initial}) + L + C(T_{pouring} - T_{melting})

   = 0.544(1668-25) + 419 + 0.544(1800-1668)

   = 1384.6 J/g

b) Total energy to heat 80 kg metal

we know  for one unit  1384.6 J/g energy is required

therefore for 80 kg , energy required is

E = (80\times 1000) 1384.6

   = 110768000 J

   = 110.768 \times 10^6 J

5 0
3 years ago
a circular pile, 19 m long is driven into a homogeneous sand layer. The piles width is 0.5 m. The standard penetration resistanc
Elena L [17]

Answer:

Point force (Qp) = 704 kn/m²

Explanation:

Given:

length = 19 m

Width = 0.5 m

fs = 4

Vicinity of the pile = 25

Find:

Point force (Qp)

Computation:

Point force (Qp) = fs²(l+v)

Point force (Qp) = 4²(25+19)

Point force (Qp) = 16(44)

Point force (Qp) = 704 kn/m²

5 0
3 years ago
Compare and contrast the three USDA quality grades available to consumers and describe how the grades affect labeling.
uysha [10]

Answer:

USDA has developed strict measures of quality for products such as grains, rice, corn, and beans. Quality grading is based on the standards developed for each product. Quality grades provide a common language among buyers and sellers, which in turn assures consistent quality for consumers.

Explanation:

7 0
3 years ago
Fix the code so the program will run correctly for MAXCHEESE values of 0 to 20 (inclusive). Note that the value of MAXCHEESE is
GarryVolchara [31]

Answer:

Code fixed below using Java

Explanation:

<u>Error.java </u>

import java.util.Random;

public class Error {

   public static void main(String[] args) {

       final int MAXCHEESE = 10;

       String[] names = new String[MAXCHEESE];

       double[] prices = new double[MAXCHEESE];

       double[] amounts = new double[MAXCHEESE];

       // Three Special Cheeses

       names[0] = "Humboldt Fog";

       prices[0] = 25.00;

       names[1] = "Red Hawk";

       prices[1] = 40.50;

       names[2] = "Teleme";

       prices[2] = 17.25;

       System.out.println("We sell " + MAXCHEESE + " kind of Cheese:");

       System.out.println(names[0] + ": $" + prices[0] + " per pound");

       System.out.println(names[1] + ": $" + prices[1] + " per pound");

       System.out.println(names[2] + ": $" + prices[2] + " per pound");

       Random ranGen = new Random(100);

       // error at initialising i

       // i should be from 0 to MAXCHEESE value

       for (int i = 0; i < MAXCHEESE; i++) {

           names[i] = "Cheese Type " + (char) ('A' + i);

           prices[i] = ranGen.nextInt(1000) / 100.0;

           amounts[i] = 0;

           System.out.println(names[i] + ": $" + prices[i] + " per pound");

       }        

   }

}

7 0
4 years ago
Given an integer k, a set C of n cities c1, . . . , cn, and the distances between these cities dij = d(ci , cj ), for 1 ⤠i &lt
Snezhnost [94]

Answer:

See explaination

Explanation:

2-Approximation Algorithm

Step 1: Choose any one city from the given set of cities C arbitrarily and put it in to a set H which is initially empty.

Step 2: For every city c in set C that is currently not present in set H compute min_distc = Minimum[ d(c, c1), d(c, c2), d(c, c3), ..... . . . . d(c, ci) ]

where c1, c2, ... ci are the cities in set H

and d(x, y) is the euclidean distance between city x and city y

Step 3: H = H ∪ {cx} where cx is the city have maximum value of min_dist over all possible cities c, computed in Step-2.

Step 4: Step-2 and Step-3 are iterated for k-1 times so that k cities are included int set H.

The set H is the required set of cities.

Example

Assume:-

C = {0, 1, 2, 3}

d(0,1) = 10, d(0,2) = 7, d(0,3) = 6, d(1,2) = 8, d(1,3) = 5, d(2,3) = 12

k = 3

Solution:-

Initially H = { }

Step-1: H = {0}

Step-2: Cities c \not\in H are {1, 2, 3}

min_dist1 = min{dist(0,1)} = min{10} = 10

min_dist2 = min{dist(0,2)} = min{7} = 7

min_dist3 = min{dist(0,3)} = min{6} = 6

Step-3: Max{10, 7, 6} = 10

Step-4: cx = 1

Step-5: H = H ∪ cx = {0} \cup {1} = {0, 1}

Step-6: Cities c \not\in H are {2, 3}

min_dist2 = min{dist(0,2), dist(1,2)} = min{7, 8} = 7

min_dist3 = min{dist(0,3), dist(1,3)} = min{6, 5} = 5

Step-7: Max{7, 5} = 7

Step-8: cx = 2

Step-9: H = H \cup cx = {0, 1} \cup {2} = {0, 1, 2}

Result: The set H is {0, 1, 2}.

6 0
3 years ago
Other questions:
  • 1. A four-lane freeway (two lanes in each direction) is located on rolling terrain and has 12-ft lanes, no lateral obstructions
    7·1 answer
  • Difference between a pillar drill and radial arm pillar<br> drill<br>​
    7·1 answer
  • What is the thermal efficiency of a gas power cycle using thermal energy reservoirs at 627°C and 60°C? The thermal efficiency is
    12·1 answer
  • If the efficiency of the boiler is 91.2 % , the overall efficiency of the turbine, which includes the Carnot efficiency and its
    5·1 answer
  • What is poop made out of
    13·2 answers
  • The magnitude of the line voltage at the terminals of a balanced Y-connected load is 660 V. The load impedance is 240-j70 Ω/Φ. T
    10·1 answer
  • The Torricelli's theorem states that the (velocity—pressure-density) of liquid flowing out of an orifice is proportional to the
    5·1 answer
  • If you are running and you fall and everyone↓↓↓↓↓↓↓ passes you how can you still be in first place??
    12·1 answer
  • In a rack and pinion steering system, what component protects other
    11·2 answers
  • According to the video, what qualities do Traffic Technicians need? Check all that apply.
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!