All categories

3 years ago

7. Sockets internal designs come in what sizes?

Engineering

1 answer:

MAXImum [283]3 years ago

3 0

Answer:

These drive fittings come in four common sizes: 1⁄4 inch, 3⁄8 inch, 1⁄2 inch, and 3⁄4 inch (referred to as "drives", as in "3⁄8 drive").

You might be interested in

When adding two 8 bit binary numbers, which of the following statements is true?

diamong [38]

Answer:

The result might require 9 bits to store

4 0

2 years ago

What careers could you potential do if you

Margarita [4]

Answer:

Engineering careers. If you want to stay in engineering, your job opportunities are very much linked to your degree type, and you probably know what many of them are already. ...

Consulting. ...

Technical writing. ...

Business. ...

Investment banking. ...

Law. ...

Manufacturing and production. ...

Logistics and supply chain.

Explanation:

3 0

2 years ago

Problem 4 You are designing a circuit to drive LED1, using the following circuit. The datasheet for the LED specifies that VF =

HACTEHA [7]

Answer:

a) I_LED= 1/6 A b) Vf= 2.5V

Explanation:

Consider circuit in the attachment.

a) We will simplify current source in paraller with resistor to a voltage source in series with a resistor(see attachment 2)

Solving the circuit in attachment 2 using mesh analysis

-9+2I1+4(I1-I2)-4+2I1=0

8I1 - 4I2= 13 ............... eq 1

4+4(I2-I1)+ I2 + 2=0

4I1- 5I2 = 6 ............ eq 2

I1= 41/24 ; I2 = 1/6; I2= I_LED

b) Solving the circuit in attachment 2 again, this time I2=0

8I1 - 4I2= 13

8I1- 4(0)=13

I1= 13/8

Vf= 4(I1- I2) -4

I2=I_LED=0

Vf= 2.5 V

4 0

3 years ago

Using Circuit 5.1, answer the following questions. Calculate the voltage across the capacitor, assuming that the circuit has bee

PSYCHO15rus [73]

Complete Question: The complete Question is attached as a file below and the circuit of consideration is contained therein.

Answer:

1) vc(0-) = 6.7 v

2a) vc(0+) = 6.7 v

2b) vc(∞) = 0.825 v

2c) τ = 0.0238775 sec

2d) vc (t) = 0.825 + 5.875 exp(-41.88t) v

vc (τ) = 2.9863 v

vc (2τ) = 1.62 v

vc (3τ) = 1.1175 v

vc (4τ) = 0.9326 v

vc (5τ) = 0.8646 v

vc (6τ) = 0.8396 v

vc (10τ) = 0.8253 v

Explanation:

The circuit analysis and the calculations involved in this question are handwritten and contained in the files attached below.

8 0

3 years ago

Using a queue.

beks73 [17]

Answer:

// Radix Sort

#include<iostream>

using namespace std;

// function to get max value

int getMaximum(int array[], int n)

{

int max = array[0];

for (int i = 1; i < n; i++)

if (array[i] > max)

max = array[i];

return max;

}

// function to get min value

int getMinimum(int array[], int n)

{

int mn = array[0];

for (int i = 1; i < n; i++)

if (array[i] <mn)

mn= array[i];

return mn;

}

//counting sort

void counterSort(int array[], int n, int expo)

{

int out[100]; // out max

int i, count[10] = {0};

// Store count of occurrences in count[]

for (i = 0; i < n; i++)

count[ (array[i]/expo)%10 ]++;

// Change count[i] so that count[i] now contains actual

// position of this digit in out[]

for (i = 1; i < 10; i++)

count[i] += count[i - 1];

// construct the out max

for (i = n - 1; i >= 0; i--)

{

out[count[ (array[i]/expo)%10 ] - 1] = array[i];

count[ (array[i]/expo)%10 ]--;

}

for (i = 0; i < n; i++)

array[i] = out[i];

}

void counterSortDesc(int array[], int n, int expo)

{

int out[100]; // out max

int i, count[10] = {0};

// Store count of occurrences in count[]

for (i = 0; i < n; i++)

count[ (array[i]/expo)%10 ]++;

for (i = 10; i >=1; i--)

count[i] += count[i - 1];

// construct out max

for (i = 0; i >= n-1; i++)

{

out[count[ (array[i]/expo)%10 ] - 1] = array[i];

count[ (array[i]/expo)%10 ]++;

}

// Copy the out max to array[], so that array[] now

// contains sorted numbers according to current digit

for (i = 0; i < n; i++)

array[i] = out[i];

}

// Radix Sort function

void radixsort(int array[], int n)

{

// get maximum number

int m = getMaximum(array, n);

for (int expo = 1; m/expo > 0; expo *= 10)

counterSort(array, n, expo);

}

void radixsortDesc(int array[], int n)

{

// get minimum number

int m = getMinimum(array, n);

for (int expo = 1; m/expo > 0; expo *= 10)

counterSortDesc(array, n, expo);

}

// print an max

void print(int array[], int n)

{ cout<<"\n";

for (int i = 0; i < n; i++)

cout << array[i] << " ";

}

// Main function

int main()

{

int array[] = {185, 25, 35, 90, 904, 34, 2, 66};

int n = sizeof(array)/sizeof(array[0]);

radixsort(array , n);

print(array, n);

radixsortDesc(array,n);

print(array,n);

return 0;

}

Explanation:

7 0

3 years ago