1. Problem Description: The total nuclear binding energy is the energy required to split a nucleus of an atom in its component parts: protons and neutrons, or, collectively, the nucleons. It describes how strongly nucleons are bound to each other. When a high amount of energy is needed to separate the nucleons, it means nucleus is very stable and the neutrons and protons are tightly bound to each other. The atomic number or proton number (symbol Z) is the number of protons found in the nucleus of an atom. The sum of the atomic number Z and the number of neutrons N gives the mass number A of an atom. + Binding energy Nucleus (smaller mass) Separated nucleons (greater mass) Figure 1: Binding Energy in the Nucleus The approximate nuclear binding energy Eb in million electron volts, of an atomic nucleus with atomic number Z and mass number A is calculated using the following formula: Eb = a,A – a2A3 (А — 2Z)2 a4 a5 + A A3 AZ where, a, = 15.67, а2 %3D 17.23, аз %3D 0.75, а, = 93.2 ,and

1. Problem Description: The total nuclear binding energy is the energy required to split a nucleus of an atom in its component parts: protons and neutrons, or, collectively, the nucleons. It describes how strongly nucleons are bound to each other. When a high amount of energy is needed to separate the nucleons, it means nucleus is very stable and the neutrons and protons are tightly bound to each other. The atomic number or proton number (symbol Z) is the number of protons found in the nucleus of an atom. The sum of the atomic number Z and the number of neutrons N gives the mass number A of an atom. + Binding energy Nucleus (smaller mass) Separated nucleons (greater mass) Figure 1: Binding Energy in the Nucleus The approximate nuclear binding energy Eb in million electron volts, of an atomic nucleus with atomic number Z and mass number A is calculated using the following formula: Eb = a,A – a2A3 (А — 2Z)2 a4 a5 + A A3 AZ where, a, = 15.67, а2 %3D 17.23, аз %3D 0.75, а, = 93.2 ,and

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter3: Assignment, Formatting, And Interactive Input

Section: Chapter Questions

Problem 6PP: (Heat transfer) The formula developed in Exercise 5 can be used to determine the cooling time, t,...

See similar textbooks

Similar questions

(Chemistry) a. Determine the final units of the following expression, which provides the molecular weight of 1.5 moles of hydrogen peroxide: 1.5moles34.0146grams/mole b. Determine the final units of the following expression, which provides the molecular weight of 5.3 moles of water: 5.3moles18grams/mole
Problem 4 Discrete Mathematics.Combinations and Permutations. (5,10,10): Soccer A local high school soccer team has 20 players. However, only 11 players play at any given time during a game. In how many ways can the coach choose 11 players To be more realistic, the 11 players playing a game normally consist of 4 midfielders, 3 defend ers, 3 attackers and 1 goalkeeper. Assume that there are 7 midfielders, 6 defenders, 5 attackers and 2 goalkeepers on the team 2. In how many ways can the coach choose a group of 4 midfielders, 3 defenders, 3 attackers and 1 goalkeeper? 3. Assume that one of the defenders can also play attacker. Now in how many ways can the coach choose a group of 4 midfielders, 3 defenders, 3 attackers and 1 goalkeeper?
Two rail roads and junction for two trains (T1 and T2) that move in opposite directions as shown in the following figure. An asynchronous state machine is used to control the motion of trains in the junction. It is worth to mention that the long of each train is 1.25 km, the maximum speed of each train is 300 km/h, and the first train departs before the second train by one hour at least. The distance between A and B is 0.75 km. How many states are required to draw a minimal Moore state diagram for the asynchronous state machine that controls the motions?
The Cigarette-Smokers Problem. Consider a system with three smoker processes and one agent process. Each smoker continuously rolls a cigarette and then smokes it. But to roll and smoke a cigarette, the smoker needs three ingredients: tobacco, paper, and matches. One of the smoker processes has paper, another has tobacco, and the third has matches. The agent has an infinite supply of all three materials. The agent places two of the ingredients on the table. The smoker who has the remaining ingredient then makes and smokes a cigarette, signaling the agent on completion. The agent then puts out another two of the three ingredients, and the cycle repeats. A program to synchronize the agent and the smokers is given below. Note that the ingredients produced by the agent are represented by i and j and those needed by the smokers are represented by r and s. Which of the following should be used to fill the first missing part of the smoker process?
The Cigarette-Smokers Problem. Consider a system with three smoker processes and one agent process. Each smoker continuously rolls a cigarette and then smokes it. But to roll and smoke a cigarette, the smoker needs three ingredients: tobacco, paper, and matches. One of the smoker processes has paper, another has tobacco, and the third has matches. The agent has an infinite supply of all three materials. The agent places two of the ingredients on the table. The smoker who has the remaining ingredient then makes and smokes a cigarette, signaling the agent on completion. The agent then puts out another two of the three ingredients, and the cycle repeats. A program to synchronize the agent and the smokers is given below. Note that the ingredients produced by the agent are represented by i and j and those needed by the smokers are represented by r and s. Which of the following should be used to fill the first missing part of the smoker process? In the Cigarette-Smokers Problem described…
4. Look up the Pythagorean theorem if you are not already familiar with it. Use the following formula to solve for c in the formula: c = √a2 + b2. Use the proper functions from the cmath header file. Be sure to output the result..
48. To avoid race condition, the maximum number of processes that may be simultaneously inside the critical section is a. zero b. one c. two d. more than two
Problem 8.f. Both i and ii. Notice that 8.f uses all states.
(Civil eng.) Modify the program written for Exercise 9 to determine the maximum load that can be placed at the end of an 8-foot I-beam, shown in Figure 2.21, so that the stress on the fixed end is 20,000lbs/in2. Use the fact that this beam’s rectangular moment of inertia is 21.4 in4 and the value of c is 3 in.
Identify the States and Events for the below given requirements and create a Finite State Machine using Mealy model and tabular format? Requirement 1: User shall be able to steer the vehicle at a constant speed by setting it at an automatic mode, which can be changed to the manual mode when required. Requirement 2: User shall be able to increase speed at fixed increments till he/she reaches desired speed. Requirement 3: User shall be able to reduce speed by de-accelerating it till he/she attains the desired speed, however this function will not work when the vehicle is descending down a slope or steep road. Requirement 4: The automatic mode can be set to manual mode by starting cruise control and can set back to normal by deactivating it. The acceleration and de-acceleration increases and decreases speed. Requirement 5: In case of application of breaks the vehicle goes to manual mode from cruise control and stops the vehicle.
Problem 1. Two DNA strands of length 100 (number of bases in the sequence) are given in DNA1.txt and DNA2.txt file. Find the longest common subsequence (LCS) between the two sequences using dynamic programming bottom-up (tabulation) approach. Submit your code to solve the problem. How much time (in seconds or milliseconds) is required by your computer to run the algorithm? Solve the same LCS problem using dynamic programming top-down (memorization) approach. Submit your code to solve the problem. How much time (in seconds or milliseconds) is required by your computer to run the algorithm. Which solution is faster and why? Discuss your solutions.
21. Take a careful look at Fig. 6-11(b). If D asks for one more unit, does this lead to a safe state or an unsafe one? What if the request came from C instead of D?