Search & Filtering
Complete the balanced molecular chemical equation for the reaction below. If no reaction occurs, write NR after the reaction arrow.
An ingestion tablet contains a mass of 0.30 g of magnesium hydroxide [Mg(OH)2] as its only basic ingredient. The balanced chemical equation between magnesium and hydrochloric acid (HCl(aq)), the acid produced in the stomach is as follows:
Mg(OH)2(aq) + 2HCl(aq) ⟶ MgCl2(aq) + 2H2O(l)
(i) Calculate the volume of 1.00 M HCl neutralised by two of these ingestion tablets?
(ii) What mass of the salt is formed in this neutralisation reaction?
(iii) How many magnesium ions are present in this amount of a salt?
an electron (me = 9.10939 × 10–28 g) moving at 4.20 × 106 m/s in an electron microscope
how does growth as a characteristic of living organisms differ in plants and animal
Explain why AlCl3 is a stronger Lewis acid than Al(CH3) 3.
#Write a program using two-dimensional arrays that lists the odd numbers and even numbers separately in a given 12 input values.
Sample input/ output dialogue:
enter twelve numbers
13 15 20 13 35 40 16 18 20 18 20 19
odds
13 15 13 35 19
Even
20 40 16 18 20 18 20
A Pythagorean Triplets is a set of three integers a, b, c such that a2+b2=C2. In the given limit L. Find the number of Pythagorean Triplets R that can be formed (such that a<b<c).
Create a class called time that has separate int member data for hours, minutes, and
seconds. One constructor should initialize this data to 0, and another should initialize it
to fixed values. Another member function should display it, in 11:59:59 format. The final
member function should add two objects of type time passed as arguments. A main() program should create two initialized time objects (should they be const?) and one that isn’t initialized. Then it should add the two initialized values together, leaving the result in the third time variable. Finally it should display the value of this third variable. Make appropriate member functions const.
Implement your own version of the priority queue data structure using java with OOPs principles mentioned functionalities: enqueue, Dequeue (highest priority), peek(highest priority), contains, size, center, sort reverse, iterator, traverse/print.
Use of similar data structures already present in the language/framework is not allowed.
Implement your own version of queue data structure using java with OOPs principles mentioned functionalities: enqueue, Dequeue , peek, contains, size, center, sort reverse, iterator, traverse/print.
Use of similar data structures already present in the language/framework is not allowed.
#340153 on Dec 2023