subject

The viscosity μμ of gases depends on the temperature TT . For some gases the following formula is relevant:

μ(T)=μ0T0−CT+C(TT0)1.5,μ(T)=μ0T0−CT +C(TT0)1.5,

where the values of the constants CC , T0T0 , and μ0μ0 are found in a file viscosity. dat. The temperature is measured in Kelvin.

Suppose we have already loaded the file into a string viscosity_data using the read method. viscosity_data contains data (in order as gas, C,T_0,mu_0) such as:

viscosity_data = '''air,120,291.15,18.27
nitrogen,111,300.55,17.81
oxygen,127,292.25,20.18
carbon dioxide,240,293.15,14.8
carbon monoxide,118,288.15,17.2
hydrogen,72,293.85,8.76
ammonia,370,293.15,9.82
sulphur dioxide,416,293.65,12.54'''
Convert the data in the string viscosity_data into a nested dictionary mu_data such that we can look up CC , T0T0 , and μ0μ0 for a gas with a name name by mu_data[name][X], where X can be one of 'C', 'T_0', or 'mu_0'. The numerical values in mu_data should all be floats.

For instance, the following statements should be True:

mu_data[ 'air' ][ 'C' ] == 120.0
mu_data[ 'hydrogen' ][ 'T_0' ] == 293.85
mu_data[ 'sulphur dioxide' ][ 'mu_0' ] == 12.54

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 21.06.2019 17:00
How can data be added in a table by using what view
Answers: 1
question
Computers and Technology, 22.06.2019 12:20
Usually, when we sniff packets, we are only interested certain types of packets. we can do that by setting filters in sniffing. scapy’s filter use the bpf (berkeley packet filter) syntax; you can find the bpf manual from the internet. set the following filters and demonstrate your sniffer program again (each filter should be set separately): (a) capture only the icmp packet. (b) capture any tcp packet that comes from a particular ip and with a destination port number 23. (c) capture packets comes from or to go to a particular subnet. you can pick any subnet, such as 128.230.0.0/16; you should not pick the subnet that your vm is attached to.
Answers: 3
question
Computers and Technology, 23.06.2019 10:20
Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?
Answers: 1
question
Computers and Technology, 23.06.2019 12:30
How is the brightness of oled of the diaplay is controled
Answers: 1
You know the right answer?
The viscosity μμ of gases depends on the temperature TT . For some gases the following formula is re...
Questions
question
Mathematics, 29.09.2019 11:00
question
World Languages, 29.09.2019 11:00
question
Mathematics, 29.09.2019 11:10