Search & Filtering
8.8 moles of carbon dioxide is formed in CH4+2O2–>CO2+2H2O. How many grams of methane reacted
If sulfuric acid, acetic acid, and nitric acid reacts with iron, are they a single displacement reaction? If not what kind reaction are they and please be specific.
8.) P 8500 is borrowed for 70 days at 18% per annum. How much will be due at the end of 70 days? Use exact simple interest.
7.) A certain amount of money triples after 9 years. determine its effective interest.
If R⊆S, then T∘R ⊆ T∘S and R∘T ⊆ S∘T
True/False:
1. The Achaemenid Empire was defeated by Pharaoh Rameses the Great: ___________
2. The Chavin of Andes carried out long-distance trade in dyes and precious stones such as
obsidian. _____________
Multiple Choice:
1. Which of the following was a way in which the Zhou asserted political power?
(a) The Zhou ruler’s power was transmitted through clan networks;
(b) The Zhou copied the Shang patrimonial state, centered on ancestor veneration;
(c) The Zhou paid tribute to the nomadic tribes to keep them from invading;
(d) The Zhou ruler was selected by the most powerful regional lords;
(e) They claimed descent from Yu the Great.
(S∪T)∘R= (S∘R)∪(T∘R).
Ramsha’s basic salary is input through the kevboard. His medical allowance is 40% of basic salary And house rent allowance is 20% of basic salary, Write a program to calculate his gross salary:
In a Laboratory, you have the following chemicals available:
1.0 M NaOH, 1.00 M HCl, 1.00 M H3PO4, NaH2PO4 (s), Na2HPO4 (s), and Na3PO4 (s).
Describe TWO ways of making 1000 mL of a buffer of pH = 12 (Use only the above
chemicals, plus distilled water.)
[Given: H3PO4 - Ka1 = 6.9 x 10-3; NaH2PO4 - Ka2 = 6.2 x 10-8 ; Na2HPO4 - Ka3 = 4.8 x 10-13]
Consider the table below and answer questions 23 to 25. The table depicts the running time (seconds) dependant on input size (n) of three algorithms Algorithm n = 100 n = 1000 n = 10 000 A 4 400 40 000 B 9 90 900 C 21 31 41 Question 23 What is the running time complexity of algorithm A? 1. O(n) 3. O(log n) 2. O(n2 ) 4. O(2n ) Question 24 What is the running time complexity of algorithm B? 1. O(n) 3. O(log n) 2. O(n2 ) 4. O(2n ) Question 25 What is the running time complexity of algorithm C? 1. O(1) 3. O(log n) 2. O(n) 4. O(1/n
#339914 on Dec 2023