answersLogoWhite

0

Alkali Metals.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

What are Tier II cities in India?

They are smaller cities, under 1 million in population. Some such cities are Thiruvananthapuram and Mangalore, Nashik, Bhopal, Jalandhar, Amritsar, Dehra Dun, Rudrapur, Raipur, Rishikesh-Haridwar, etc..


What is 1a plus 1b?

1a + 1b because they are different terms and could not be added together. But 1a × 1b would be 1


One brick is the one kilogram plus half a brick heavy What is the weight of one brick?

2 kg (1b=1kg+1/2b, 1/2b=1kg, 1b=2kg)


What is the factor of 2b - b - 10?

-8


What part of the base is measured from when measuring first base to second base?

It is 90 feet from the tip of home plate to the front edge of 1B and 3B. The 90-foot distance from 1B or 3B to 2B is measured from the foul line to the center of the 2B bag.


Factor 2b2 plus 10b plus 12?

The Answer to this question is 9 (2B+4) and (1B+3)


What is the correct way to simplify a-2b-1b-1?

By collecting like terms and so it is a-3b-1 when simplified


What are eight records that are kept on a batter?

at-bats, 1B, 2B, 3B, HR, RBIs, AVG., OBP. (on-base percentage)


What is 2b multiple 3 plus b?

2B Multiplied by 3 plus B = 7B. Here is how it's worked out. You start with 2B, multiply that by 3 and you get 6B. Now all you have to do is add the last B, therefore adding 1B to equal 7B.


What is 9a plus 2b - 8a -3b?

The given terms can be simplified to: a -b


H-1B VisaH1-B1 VisaH-1C VisaH-2A VisaH-2B VisaH-3 Visa?

If you can tell me what you are saying I can tell you the answer


How to merge two single linked list using c?

Here is the java version, C should be similar // merges two Singly linked lists A and B, both sorted in increasing order of integers . // Return a Singly linked list sorted in increasing order // for ex if A = 1->2->3->6 and B = 2->4->7, returns 1->2->2->3->4->6->7 public LinkedList merge(LinkedList A, LinkedList B) { Node 1A = A.head; Node 1B = B.head; Node P1A = NULL; Node 2A = NULL; Node 2B = NULL; while ( 1A != NULL && 1B !=NULL){ 2A = 1A.next; 2B = 1B.next; if (1A.item >= 1B.item) { if (P1A != NULL) { P1A.next = 1B; } else if ( P1A == NULL){ P1A = 1B; } 1B.next = 1A; P1A = 1B; 1B = 2B; } else if ( 1A.item < 1B.item){ if ( 2A != NULL) { P1A = 1A; 1A = 1A.next; } else{ 1A.next = 1B; break; } } } return A; }