A Carnot engine operates between a high temperature reservoir at 417 K and a river with water at307 K. If it absorbs 3600 J of heat each cycle, how much work per cycle does it perform?

The energy of the ground state in the Bohr model of the hydrogen atom is -13.6 eV. The energy of the n = 2 state of hydrogen in this model is closest to

The figure (not to scale) shows a pV diagram for 6.9 g of helium gas (He) that undergoes the process 1 → 2 → 3. Find the value of V3. The ideal gas constant is R = 8.314 J/(mol·K) = 0.0821 L·atm/(mol·K), and the atomic weight of helium is 4.0 g/mol.  

The wave function of an electron in a rigid box (infinite well) is shown in the figure. If the electron energy is 85 eV, what is the energy of the electron’s ground state? ( mel= 9.11 x 10-31 kg )       

Two sources of light illuminate a double slit simultaneously. One has a wavelength of 700 nm and the second has an unknown wavelength. The m = 5 bright fringe of the unknown wavelength overlaps the m = 4 bright fringe of the light of 700 nm wavelength. What is the unknown wavelength?

Refer to the document-term matrix below after applying the bag-of-words representation. Which terms are the most common and which are the rarest in the corpus?

A 3.50-eV electron is incident on a 0.40-nm barrier that is 5.67 eV high. What is the probability that this electron will tunnel through the barrier? (1 eV = 1.60 × 10-19J, mel= 9.11 × 10-31kg, ℏ= 1.055 × 10-34J·s, h= 6.626 × 10-34 J·s)  

Which of the following increases the strength of muscle contraction?

Programming Consider the task of checking to see if a graph contains a cycle. This task can, of course, be accomplished with a recursive DFS algorithm. Unfortunately, in very large graphs it is not appropriate to use recursion to explore, because it requires a vast amount of system memory (to track each recursive call). Implement a method for checking for a cycle in a graph using the DFS algorithm WITHOUT using recursion. Assume that the Stack ADT is available and you are using the standard Graph ADT discussed in class. (Huge Hint: start by thinking about BFS, and how it works without recursion.)   Assume a marked variable exists and has been set up to be the size of the graph and with every index set to false. public static boolean[] marked;public static boolean hasCycle(Graph G, int start) { Stack s = new Stack(); //TODO: implement this method.

A 3.10-eV electron is incident on a 0.40-nm barrier that is 5.67 eV high. What is the probability that this electron will tunnel through the barrier? (1 eV = 1.60 × 10-19J, mel= 9.11 × 10-31kg, ℏ= 1.055 × 10-34J·s, h= 6.626 × 10-34 J·s)