All categories

1 year ago

What is the mass per unit area of an 7 inch by 10 inch lead sheet that weighs 192 gm. ____________g / cm2

Engineering

1 answer:

liq [111]1 year ago

8 0

Answer:

M/A = 0.425 g/cm²

Explanation:

Given the following data;

Mass = 192 grams

Dimensions = 7 * 10 inches.

To find the mass per unit area;

First of all, we would determine the area of the lead sheet;

Area = 7 * 10

Area = 70 in²

Conversion:

1 square inch = 6.452 square centimeters

70 inches = 70 * 6.452 = 451.64 square centimeters

Next, we find the mass per unit area;

M/A = 192/451.64

M/A = 0.425 g/cm²

You might be interested in

A thin metal disk of mass m=2.00 x 10^-3 kg and radius R=2.20cm is attached at its center to a long fiber. When the disk is turn

topjm [15]

Answer:

k = 1.91 × 10^-5 N m rad^-1

Workings and Solution to this question can be viewed in the screenshot below:

6 0

2 years ago

Problem 5) Water is pumped through a 60 m long, 0.3 m diameter pipe from a lower reservoir to a higher reservoir whose surface i

kap26 [50]

Answer:

\epsilon = 0.028*0.3 = 0.0084

Explanation:

\frac{P_1}{\rho} + \frac{v_1^2}{2g} +z_1 +h_p - h_l =\frac{P_2}{\rho} + \frac{v_2^2}{2g} +z_2

where P_1 = P_2 = 0

V1 AND V2 =0

Z1 =0

h_P = \frac{w_p}{\rho Q}

=\frac{40}{9.8*10^3*0.2} = 20.4 m

20.4 - (f [\frac{l}{d}] +kl) \frac{v_1^2}{2g} = 10

we know thaTV =\frac{Q}{A}

V = \frac{0.2}{\pi \frac{0.3^2}{4}} =2.82 m/sec

20.4 - (f \frac{60}{0.3} +14.5) \frac{2.82^2}{2*9.81} = 10

f = 0.0560

Re =\frac{\rho v D}{\mu}

Re =\frac{10^2*2.82*0.3}{1.12*10^{-3}} =7.53*10^5

fro Re = 7.53*10^5 and f = 0.0560

\frac{\epsilon}{D] = 0.028

\epsilon = 0.028*0.3 = 0.0084

4 0

2 years ago

Let Deterministic Quicksort be the non-randomized Quicksort which takes the first element as a pivot, using the partition routin

juin [17]

Answer:

Answer for the question:

Let Deterministic Quicksort be the non-randomized Quicksort which takes the first element as a pivot, using the partition routine that we covered in class on the quicksort slides. Consider another almost-best case for quicksort, in which the pivot always splits the arrays 1/3: 2/3, i.e., one third is on the left, and two thirds are on the right, for all recursive calls of Deterministic Quicksort. (a) Give the runtime recurrence for this almost-best case. (b) Use the recursion tree to argue why the runtime recurrence solves to Theta (n log n). You do not need to do big-Oh induction. (c) Give a sequence of 4 distinct numbers and a sequence of 13 distinct numbers that cause this almost-best case behavior. (Assume that for 4 numbers the array is split into 1 element on the left side, the pivot, and two elements on the right side. Similarly, for 13 numbers it is split with 4 elements on the left, the pivot, and 8 elements on the right side.)

is given in the attachment.

Explanation:

Download pdf

3 0

2 years ago

Use the predicate specifications(x, y): x beats yF (x): x is an (American) football teamQ(x, y): x is quarterback of yL(x,y): x

attashe74 [19]

Answer:

a) ∀y∃x(Q(x, y))

b) (B(Jayhawks, W ildcats)→¬∀y(L(Jayhawks, y)))

c) ∃x(B(Wildcats, x) ∧ B(x, Jayhawks))

Explanation:

a) The statement can be rewritten as "For all football teams, there exists a quarterback" which is written in logical symbols.

b) The statement is an implication and thus have a premise and a conclusion. The premise states "Jayhawks beat the Wildcats" which is translated using B(x, y). The conclusion can be rewritten as "It is not the case that Jayhawks lose to all football teams".

c) The statement is a simple conjunction which can be written as "There exists a team x such that the Wildcats beats x and x beats Jayhawks"

7 0

2 years ago

Suppose we store a relation R (x,y) in a grid file. Both attributes have a range of values from 0 to 1000. The partitions of thi

leva [86]

Answer:

For (a) The total number of buckets from the given query for the relation is 25 buckets (b) the nearest neighboring query is (80, 200) (80, 150), (100, 150), (120,150) and (120, 200)

Explanation:

From the question stated, we need to define what a Grid file is

Grid File it is a structure of data that are used to divide the total space into a grid non-periodic, where set of point (small) are defined by more than one cells of the grid.

(a)Finding buckets for the query

The relation is divided into two parts which ranges from 0 to 1000, the first part is partitioned in every 20 units, at 20, 40, 60 etc; a second part is partitioned into every 50 units at 50, 100, 150 etc.

The total number of buckets from the given query for the relation is 25 buckets

(b)Finding the closest point or nearest point

The closest point discovered in the distance is little above 15

These points are are the points closer to the point target (110, 205) which can be found in five neighboring rectangles with left corners lower is stated as follows:

(80, 200) (80, 150), (100, 150), (120,150) and (120, 200)

3 0

2 years ago