All categories

3 years ago

100 points Im so bored lol

Engineering

2 answers:

OlgaM077 [116]3 years ago

5 0

Answer:

lol same

Explanation:

Dima020 [189]3 years ago

4 0

Answer:

im so bored too girl

Explanation:

You might be interested in

a metal rod 24mm diameter and 2m long is subjected to an axial pull of 40 kN. If the rod is 0.5mm, then find the stress-induced

ozzi

Answer:

i dont know but i will take the points tho hahah

Explanation:

8 0

2 years ago

A company, studying the relation between job satisfaction and length of service of employees, classified employees into three le

Wewaii [24]

Answer:

Below see details

Explanation:

A) It is attached. Please see the picture

B) First to calculate the overall mean,

μ=65∗25/75+80∗25/75+95∗25/75

μ=65∗25/75+80∗25/75+95∗25/75 = 80

Next to calculate E(MSTR) = σ2+(1/r−1) ∑ni(μi−μ)^2 = 5634

And E(MSE) = σ^2= 9

C) Yes, it is substantially large than E(MSE) in this case.

D) If we sampled 25 employees from each group, we are likely to get a F statistics to indicate differences of job satisfactions among three types of length of service of employees.

3 0

3 years ago

When do design engineers start on the design improvement step?

ArbitrLikvidat [17]

Answer:

as soon as there is a design to improve

Explanation:

As a design engineer, I started on the "design improvement" step as soon as I had an initial conceptual design.

Then, I started that step again when my boss told me, "make it better."

_____

The more interesting question is, "when do you <em>stop</em> the design improvement step?" (Judging by the constant barrage of software updates, that answer is, "never.")

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

Consider a space shuttle weighing 100 kN. It is travelling at 310 m/s for 30 minutes. At the same time, it descends 2200 m. Cons

mixas84 [53]

Answer:

work done = 48.88 × $10^{9}$ J

Explanation:

given data

mass = 100 kN

velocity = 310 m/s

time = 30 min = 1800 s

drag force = 12 kN

descends = 2200 m

to find out

work done by the shuttle engine

solution

we know that work done here is

work done = accelerating work - drag work - descending work

put here all value

work done = ( mass ×velocity ×time - force ×velocity ×time - mass ×descends ) 10³ J

work done = ( 100 × 310 × 1800 - 12×310 ×1800 - 100 × 2200 ) 10³ J

work done = 48.88 × $10^{9}$ J

6 0

3 years ago