Let Tcomp(n, p) and Tcomm(n, p) denote the parallel computation and communica- tion times, respectively, on a parallel architecture for sorting n elements on p processors. Now consider routing a permutation on this architecture where each processor has a message of size m for another processor such that no two source or destination processors are the same. Design an algorithm to solve this permutation routing problem using only parallel sorting, and compute its run-time.

Match each vocabulary term to its definition. 1. electrons neutral subatomic particles found in the nucleus of the atom 2. neutron lowest energy position of an electron in an atom 3. photon the path of an electron around the nucleus of an atom 4. ground state negatively charged, subatomic particles 5. protons packet of energy of specific size 6. element substance with only one type of atom 7. orbital positively charged, subatomic particles found in the nucleus of the atom

Ahot-air balloon is 11.0 m above the ground and rising at a speed of 7.00 m/s. a ball is thrown horizontally from the balloon basket at a speed of 9.00 m/s. ignore friction and air resistance and find the speed of the ball when it strikes the ground.

Suppose a force of 60 n is required to stretch and hold a spring 0.1 m from its equilibrium position. a. assuming the spring obeys hooke's law, find the spring constant k. b. how much work is required to compress the spring 0.5 m from its equilibrium position? c. how much work is required to stretch the spring 0.6 m from its equilibrium position? d. how much additional work is required to stretch the spring 0.1 m if it has already been stretched 0.1 m from its equilibrium? a. kequals 600