Questions

A greenhouse gas is a gas in an atmosphere that absorbs and emits radiant energy within the thermal infrared range. This process is the fundamental cause of the greenhouse effect. 

Carbon dioxide is a main greenhouse gas, found in car exhaust pipes.
Methane and nitrous oxide is another type of greenhouse gas.

Oxygen is the only clean gas out there because we need it to survive. Therefore, the only gas that is not a greenhouse gas is Oxygen.

It provides a framework for discussing network operations and design

Free memory is maintained in linked lists, each of equal sized blocks. Any such block is of size 2^k. When some memory is required by a process, the block size of next higher order is chosen, and broken into two. Note that the two such pieces differ in address only in their kth bit. Such pieces are called buddies. When any used block is freed, the OS checks to see if its buddy is also free. If so, it is rejoined, and put into the original free-block linked-list.

Town planning, Drainage system and Use of Bronze are the features of Indus Valley Civilization. Use of Iron was not the feature of this.

Adders are generally of five types:

1.Ripple Carry Adder:

The Ripple carry adder(RCA) consists of a building block named Half Adder(HA) which is cascaded to form a Full Adder(FA). These buildingblocks HAs and FAs are also the building blocks of all types of adders.The n full adders are cascaded to form n bit RCA.

The full adder has three input pins(input Ai,input Bi,carryin Ci) and two output pins(Sum and Ci+1).Its equations are:

Sum=Ai^Bi^Ci

Ci+1=Ai.Bi+Bi.Ci+Ai.Ci

2. Carry Lookahead Adder:

The Carry Lookahead Adder(CLA) reduces the delay as that in RCA. Let Gi=Ai.Bi, and Pi=Ai^Bi, then Ci+1=Gi+Pi.Ci.

The expressions for Sum and Ci+1 is then defined completely in terms of input pins rather wait for input carry to appear.

3. Carry Select Adder:

The carry select adder uses duplicate modules for each combination of input carry(i.e. 1 and 0).The multiplexers then select the appropriate sum and carry output according to the carry output of the preceding stages.

4. Carry Skip Adder:

The carry skip adder are as fast as carry lookahead adders which are the fastest adders but its spped decreases to about 20-30% if input operands are 64-bit or more. In these adders we divide the input bit stream into various blocks and make use of two observations:

-if each element of the two bit streams are unequal,i.e. Ai!=Bi than the carry input of the block is equal to the carry input.

-if each element of the two bit streams are equal,i.e. Ai=Bi than the carry input of the block is opposite of the carry input.

5. Carry Save Adder:

The carry save adder reduces the addition of three elements into addition of two elements,i.e. if you want sum of nine numbers it reduces it into sum of six numbers. In first step the sum of three numbers is calculated without bothering for the carry.During the second step only carry is calculated which is then added to the generated sum to give the required sum.