(Practice) a. To convert inches (in) to feet (ft), the number of inches should be multiplied by which of the following conversion factors?
i. 12 in/1 ft ii. 1 ft/12 in
b. To convert feet (ft) to meters (m), the number of feet should be multiplied by which of the following conversion factors?
i. 1 m/3.28 ft ii. 3.28 ft/1 m
c. To convert sq.yd to sq.ft, the number of sq.yd should be multiplied by which of the following conversion factors?
i. 1 sq.yd/9 sq.ft ii. 9 sq.ft/1 sq.yd
d. To convert meters (m) to kilometers (km), the number of meters should be multiplied by which of the following conversion factors?
i. 1000 m/1 km ii. 1 km/1000 m
e. To convert sq.in to sq.ft, the number of sq.in should be multiplied by which of the following conversion factors?
i. 144 sq.in/1 sq.ft ii. 1 sq.ft/144 sq.in
f. To convert minutes (min) to seconds (sec), the number of minutes should be multiplied by which of the following conversion factors?
i. 60 sec/1 min ii. 1 min/60 sec
g. To convert seconds (sec) to minutes (min), the number of seconds should be multiplied by which of the following conversion factors?
i. 60 sec/1 min ii. 1 min/60 sec
(a)
To determine the correct option to be multiplied with the number of inches, to convert inches into feet.
Option ii) 1ft/12 in correct.
Explanation of Solution
Explanation
Normally,
Checking both the given option by multiplying it with 1 inch, and if we get the above given expression then the generated result is true.
i)
This option is false.
ii)
This option is true.
Conclusion
Hence, the option ii) is correct.
(b)
To determine the correct option to be multiplied with the number of feet, to convert feet into meters.
The option i) 1m/3.28 ftis correct.
Explanation of Solution
Explanation
Normally,
Checking both the given option by multiplying it with 1 feet, and if we get the above given expression then the generated result is true.
i)
This option is true.
ii)
This option is false.
Conclusion
Hence, the option i) is correct.
(c)
To determine the correct option to be multiplied with the number of sq. yd, to convert sq. yd into sq. ft.
The option ii)
Explanation of Solution
Explanation
Normally,
Checking both the given option by multiplying it with 1 sq. yd, and if we get the above given expression then the generated result is true.
i)
This option is false.
ii)
This option is true.
Conclusion
Hence, the option ii) is true.
(d)
To determine the correct option to be multiplied with the number of meters, to convert metres(m) into kilometer(km).
The option ii)
Explanation of Solution
Explanation
Normally,
Checking both the given option by multiplying it with 1 m, and if we get the above given expression then the generated result is true.
i)
This option is false.
ii)
This option is true.
Conclusion
Hence, the option ii) is true.
(e)
To determine the correct option to be multiplied with the number of sq. in, to convert sq. ft into sq. ft.
The option ii)
Explanation of Solution
Explanation
Normally,
Checking both the given option by multiplying it with 1 sq. in, and if we get the above given expression then the generated result is true.
i)
This option is false.
ii)
This option is true.
Conclusion
Hence, the option ii) is true.
(f)
To determine the correct option to be multiplied with the number of minutes, to convert minutes(min) into seconds(sec).
The option i)
Explanation of Solution
Explanation
Normally,
Checking both the given option by multiplying it with 1 min, and if we get the above given expression then the generated result is true.
i)
This option is true.
ii)
This option is false.
Conclusion
Hence, the option i) is true.
(g)
To determine the correct option to be multiplied with the number of seconds, to convert seconds(sec) into minutes(min).
The option ii)
correct.
Explanation of Solution
Explanation
Normally,
Checking both the given option by multiplying it with 1 sec, and if we get the above given expression then the generated result is
true.
i)
This option is false.
ii)
This option is true.
Conclusion
Hence, the option ii) is true.
Want to see more full solutions like this?
Chapter 1 Solutions
C++ for Engineers and Scientists
- 9. Let L₁=L(ab*aa), L₂=L(a*bba*). Find a regular expression for (L₁ UL2)*L2. 10. Show that the language is not regular. L= {a":n≥1} 11. Show a derivation tree for the string aabbbb with the grammar S→ABλ, A→aB, B→Sb. Give a verbal description of the language generated by this grammar.arrow_forward14. Show that the language L= {wna (w) < Nь (w) < Nc (w)} is not context free.arrow_forward7. What language is accepted by the following generalized transition graph? a+b a+b* a a+b+c a+b 8. Construct a right-linear grammar for the language L ((aaab*ab)*).arrow_forward
- 5. Find an nfa with three states that accepts the language L = {a^ : n≥1} U {b³a* : m≥0, k≥0}. 6. Find a regular expression for L = {vwv: v, wЄ {a, b}*, |v|≤4}.arrow_forward15. The below figure (sequence of moves) shows several stages of the process for a simple initial configuration. 90 a a 90 b a 90 91 b b b b Represent the action of the Turing machine (a) move from one configuration to another, and also (b) represent in the form of arbitrary number of moves.arrow_forward12. Eliminate useless productions from Sa aA BC, AaBλ, B→ Aa, C CCD, D→ ddd Cd. Also, eliminate all unit-productions from the grammar. 13. Construct an npda that accepts the language L = {a"b":n≥0,n‡m}.arrow_forward
- You are given a rope of length n meters and scissors that can cut the rope into any two pieces. For simplification, only consider cutting the rope at an integer position by the meter metric. Each cut has a cost associated with it, c(m), which is the cost of cutting the rope at position m. (You can call c(m) at any time to return the cost value.) The goal is to cut the rope into k smaller pieces, minimizing the total cost of cutting. B Provide the pseudo-code of your dynamic programming algorithm f(n,k) that will return the minimum cost of cutting the rope of length n into k pieces. Briefly explain your algorithm. What is the benefit of using dynamic programming for this problem? What are the key principles of dynamic programming used in your algorithm?arrow_forwardDetermine whether each of the problems below is NP-Complete or P A. 3-SAT B. Traveling Salesman Problem C. Minimum Spanning Tree D. Checking if a positive integer is prime or not. E. Given a set of linear inequalities with integer variables, finding a set of values for the variables that satisfies all inequalities and maximizes or minimizes a given linear objective function.arrow_forward1. Based on our lecture on NP-Complete, can an NP-Complete problem not have a polynomial-time algorithm? Explain your answer. 2. Prove the conjecture that if any problem in NP is not polynomial-time solvable, then no NP-Complete problem is polynomial-time solvable. (You can't use Theorem 1 and 2 directly) 3. After you complete your proof in b), discuss how this conjecture can be used to solve the problem of whether P=NP.arrow_forward
- Based on our lectures and the BELLMAN-FORD algorithm below, answer the following questions. BELLMAN-FORD (G, w, s) 1 INITIALIZE-SINGLE-SOURCE (G, s) 2 for i = 1 to |G. VI - 1 3 4 5 6 7 8 for each edge (u, v) = G.E RELAX(u, v, w) for each edge (u, v) = G.E if v.d> u.d+w(u, v) return FALSE return TRUE 1. What does the algorithm return? 2. Analyze the complexity of the algorithm.arrow_forward(Short-answer) b. Continue from the previous question. Suppose part of the data you extracted from the data warehouse is the following. Identify the missing values you think exist in the dataset. Use Column letter and Row number to refer to each missing value in the dataset. Please write down how you want to address each particular missing value (you can group them if they receive same treatment). For imputation, you do not need to calculate the exact imputed values but just describe what kind of value you want to use to impute.arrow_forwardPlease original work Locate data warehousing solutions offered by IBM, Oracle, Microsoft, and Amazon Compare and contrast the capabilities of each solution and provide several names of some organizations that utilize each of these solutions. Please cite in text references and add weblinksarrow_forward
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr