All categories

2 years ago

When was Lamborghini's Made A.) 2004 B.) 1963 C.) 1923 D.) 1990

Engineering

1 answer:

Serjik [45]2 years ago

7 0

Answer:

1963

Explanation:

Sant'Agata Bolognese is a small comune in the Metropolitan City of Bologna, Emilia-Romagna, in the north of Italy. It is notable for being the headquarters of the luxury automobile manufacturer Automobili Lamborghini. It is named after Saint Agatha of Sicily.

You might be interested in

Select the correct answer.

Ulleksa [173]

The answer is A. Immediately inform her colleague

4 0

2 years ago

The lattice constant of a simple cubic primitive cell is 5.28 Å. Determine the distancebetween the nearest parallel ( a ) (100),

skelet666 [1.2K]

Answer:

a)5.28 Å , b)3.73 Å , c)3.048 Å

Explanation:

the atoms are situated only at the corners of cube.Each and every atom in simple cubic primitive at the corner is shared with 8 adjacent unit cells.

Therefore, a particular unit cell consist only 1/8th part of an atom.

The lattice constant of a simple cubic primitive cell is 5.28 Å

We know formula of distance,

d = $\frac{a}{\sqrt{h^{2}+k^{2}+l^{2}}}$

a)(100)

a=5.28 Å

Distance = $\frac{5.28 Å}{\sqrt{1^{2}+0^{2}+0^{2}}}$ =5.28 Å

b)(110)

Distance = $\frac{5.28}{\sqrt{1^{2}+1^{2}+0^{2}}}$ = 3.73 Å

c)(111)

Distance= $\frac{5.28}{\sqrt{1^{2}+1^{2}+1^{2}}}$ = 3.048 Å

6 0

3 years ago

This search compares the target value with the middle element in the collection, then ignores the half of the collection in whic

love history [14]

Answer:

d) Binary

Explanation:

Binary search is a search algorithm that finds the position of a value in an ordered array. It compares the value with the element in the middle of the array, if they are not equal, half in which the value cannot be eliminated and the search continues in the remaining half until the value is found.

7 0

2 years ago

(35-39) A student travels on a school bus in the middle of winter from home to school. The school bus temperature is 68.0° F. Th

arlik [135]

Answer:

The net energy transfer from the student's body during the 20-min ride to school is 139.164 BTU.

Explanation:

From Heat Transfer we determine that heat transfer rate due to electromagnetic radiation ( $\dot Q$ ), measured in BTU per hour, is represented by this formula:

$\dot Q = \epsilon\cdot A\cdot \sigma \cdot (T_{s}^{4}-T_{b}^{4})$ (1)

Where:

$\epsilon$ - Emissivity, dimensionless.

$A$ - Surface area of the student, measured in square feet.

$\sigma$ - Stefan-Boltzmann constant, measured in BTU per hour-square feet-quartic Rankine.

$T_{s}$ - Temperature of the student, measured in Rankine.

$T_{b}$ - Temperature of the bus, measured in Rankine.

If we know that $\epsilon = 0.90$ , $A = 16.188\,ft^{2}$ , $\sigma = 1.714\times 10^{-9}\,\frac{BTU}{h\cdot ft^{2}\cdot R^{4}}$ , $T_{s} = 554.07\,R$ and $T_{b} = 527.67\,R$ , then the heat transfer rate due to electromagnetic radiation is:

$\dot Q = (0.90)\cdot (16.188\,ft^{2})\cdot \left(1.714\times 10^{-9}\,\frac{BTU}{h\cdot ft^{2}\cdot R^{4}} \right)\cdot [(554.07\,R)^{4}-(527.67\,R)^{4}]$

$\dot Q = 417.492\,\frac{BTU}{h}$

Under the consideration of steady heat transfer we find that the net energy transfer from the student's body during the 20 min-ride to school is:

$Q = \dot Q \cdot \Delta t$ (2)

Where $\Delta t$ is the heat transfer time, measured in hours.

If we know that $\dot Q = 417.492\,\frac{BTU}{h}$ and $\Delta t = \frac{1}{3}\,h$ , then the net energy transfer is:

$Q = \left(417.492\,\frac{BTU}{h} \right)\cdot \left(\frac{1}{3}\,h \right)$

$Q = 139.164\,BTU$

The net energy transfer from the student's body during the 20-min ride to school is 139.164 BTU.

7 0

2 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