Ace - AI Tutor
Ask Our Educators
Textbooks
My Library
Flashcards
Scribe - AI Notes
Notes & Exams
Download App
lu-s baquero

lu-s b.

Divider

Questions asked

BEST MATCH

Determine if the following salt is neutral, acidic or basic. If acidic or basic, write the appropriate equilibrium equation for the acid or base that exists when the salt is dissolved in aqueous solution. If neutral, simply write only NR. Be sure to include the proper phases for all species within the reaction. C₅H₅NHI ⁴⁻ ³⁻ ²⁻ ⁻ ⁺ ²⁺ ³⁺ ⁴⁺ 1 2 3 4 5 6 7 8 9 0 ₁ ₂ ₃ ₄ ₅ ₆ ₇ ₈ ₉ ₀ + ( ) → ⇌ (s) (l) (g) (aq) H₂O O I C H H₃O⁺ OH⁻ NR N

View Answer
divider
BEST MATCH

The zener diode in the circuit below is a 1N4739A with $V_{ZT}=9.1V$ @ $I_{ZT}=28mA$, $r_z=5\Omega$. For the transistor $\beta=60$, $V_{EB}=0.7V$, and $V_{EC(sat)}=0.2V$. $V_i=-15.9V$, $R_{BZ}=194\Omega$, and $R_L=43\Omega$. a. Calculate $V_o$ in V using the constant voltage drop model to represent the zener. b. Calculate the base current $I_B$ in mA using the constant voltage drop model to represent the zener. c. Calculate $V_o$ in V using the incremental model $V_{Z0} + r_z$ to represent the zener. d. Calculate the base current $I_B$ in mA using the incremental model $V_{Z0} + r_z$ to represent the zener. Note: In this problem, you may only submit numerical answers accurate to 0.02% or better. (i.e. If 4 is the correct answer, 3.9999 will be marked as correct, but 2+2 will be marked as incorrect.) Node: Thanks to Mr. H. Wander, for reporting a typo.

View Answer
divider
BEST MATCH

A set of sleeve bearings has a specification of shaft journal diameter of 1.900 in with a unilateral tolerance of −0.001 in. The bushing bore has a diameter of 1.902 in with a unilateral tolerance of 0.003 in. The l/d ratio is unity. The radial load is 290.0 lbf and the shaft rotational speed is 380 rev/min. The lubricant is SAE 10 oil, operating at an average film temperature of 140°F. For the cmin, cmedian, and cmax assemblies analyze the bearings and observe the changes in S, ε, f, Q, Qs, ΔT, Tmax, T f , and h0.

View Answer
divider
BEST MATCH

Equations and Inequalities Multiplicative property of equality with integers Solve for v. -36=-(v)/(4) Simplify your answer as much as possible.

View Answer
divider
BEST MATCH

These microbes in the gut help break down food during digestion. Obacteria fungi archaea yeasts

View Answer
divider
BEST MATCH

10. The F2 offspring of a classic Mendelian monohybrid cross between homozygous dominant and homozygous recessive parents would produce the genotype(s) A. AA and Aa. B. Aa and aa. C. AA, Aa, and aa. D. AA only. E. Aa only.

View Answer
divider
BEST MATCH

Which of the following is not a known benefit of regular exercise? Maintained joint mobility Maintained strength Increased incidence of hypertension Maintained endurance Prolonged life expectancy

View Answer
divider
BEST MATCH

Which action best exemplifies how you might critically analyze your own opinions after each section of the text? Group of answer choices determining how your scores on a self-report scale are different from other's in your class asking yourself how you would test your own hypothesis exploring ideas in new and open-minded ways answering survey questions that experiment participants answered

View Answer
divider
BEST MATCH

From greatest to least, rank the net forces on the boxes. Rank from greatest to least. To rank items as equivalent, overlap them.

View Answer
divider
BEST MATCH

Q2 (35 points). Matrix-chain multiplication problem: We are given a matrix sequence (chain) $A_1, A_2, \dots, A_n$ and we wish to compute the product $A_1A_2\dots A_n$ Any order gives the same product but the order changes the amount of scalar multiplications we do. Illustration: Consider the problem of a chain $<A_1, A_2, A_3>$ Dimensions of $A_1, A_2$ and $A_3$ are 10x100, 100x5, and 5x50 respectively. Multiplication of $((A_1A_2)A_3)$ takes 7500 scalar multiplications, whereas $(A_1(A_2A_3))$ takes 75000. The problem is finding the multiplication order that takes minimum amount of scalar multiplications. a) (10 points) What is the complexity of the brute-force algorithm? I.e. How much time does it take to try out all alternatives to find the best order?

View Answer
divider