Questions

The right ventricle transports deoxygenated blood to the lungs, where the oxygenation takes place.

Hence, the given statement is FALSE.

Along any transmission path from a given source to a given destination, a group of virtual circuits can be grouped together into what is called path.

The major greenhouse gases (GHG’s) solely responsible for greenhouse effect are Carbon dioxide, Ozone, Methane and Water vapor. Although these gases comprise 1% of our atmosphere, they act like a thick warm blanket outside that surrounds this planet and regulate climate control. Greenhouse effect is not bad. In fact, it is needed for all of us to survive on planet Earth. In short, the greenhouse effect is nothing but a naturally occurring process designed by nature that aids in heating earth’s surface and helps to maintain ecological balance.

Now, while some of that heat dissipates into space, some of it burns along the atmosphere, and some of it penetrates the atmosphere and finds its way into the lower atmosphere and the planet’s surface. This in turn raises the average temperature of the Earth. Therefore, the increase in the Earth’s surface temperature due to increase in the number of greenhouse gases leads to global warming.

Causes of Green House Effects ::

* Burning of Fossil Fuels

* Deforestation 

* Increase in Population

* Farming

* Industrial Waste and Landfills.

The Preamble was adopted with the constitution in the constituent assembly.

The Preamble proclaims the solemn resolution of the people of India to constitute India into a 'Sovereign socialist secular democratic republic'.

#include<stdio.h>

void quicksort(int [10],int,int);

int main(){
  int x[20],size,i;

  printf("Enter size of the array: ");
  scanf("%d",&size);

  printf("Enter %d elements: ",size);
  for(i=0;i<size;i++)
    scanf("%d",&x[i]);

  quicksort(x,0,size-1);

  printf("Sorted elements: ");
  for(i=0;i<size;i++)
    printf(" %d",x[i]);

  return 0;
}

void quicksort(int x[10],int first,int last){
    int pivot,j,temp,i;

     if(first<last){
         pivot=first;
         i=first;
         j=last;

         while(i<j){
             while(x[i]<=x[pivot]&&i<last)
                 i++;
             while(x[j]>x[pivot])
                 j--;
             if(i<j){
                 temp=x[i];
                  x[i]=x[j];
                  x[j]=temp;
             }
         }

         temp=x[pivot];
         x[pivot]=x[j];
         x[j]=temp;
         quicksort(x,first,j-1);
         quicksort(x,j+1,last);

    }
}

Output:
Enter size of the array: 5
Enter 5 elements: 3 8 0 1 2
Sorted elements: 0 1 2 3 8