Questions

The wide gap between the aims of the French Revolution(equality in economic, social and political life) and the actual conditions in France after revolution created serious discontent among the people. It led to an attempt to overthrow the existing government in France with a view to building a society based on socialist ideas. This attempt, known as Babeuf's conspiracy, is an important event in the history of socialism.

      The conspiracy,as the name indicates, was the work of Noel Babeuf. He was born in 1760 and has participated in the French Revolution . He organised a secret society called the 'Society of the Equals'. 

The process which involves absorption of heat is endothermic.

Here given all the options are involving in absorption of heat. Hence, all the above are endithermic.

The purines are bases in the DNA. The two purines in DNA are Adenine and Guanine. These two purines forms hydrogen bonds with their complimentary pyrimidines such as Thymine and Cytosine to keep the two rails of the DNA molecule together.

C: \SAMPLE.EXE

#include
#define MAX 50

void mergeSort(int arr[],int low,int mid,int high);
void partition(int arr[],int low,int high);

int main(){
  
    int merge[MAX],i,n;

    printf("Enter the total number of elements: ");
    scanf("%d",&n);

    printf("Enter the elements which to be sort: ");
    for(i=0;i<n;i++){
         scanf("%d",&merge[i]);
    }

    partition(merge,0,n-1);

    printf("After merge sorting elements are: ");
    for(i=0;i<n;i++){
         printf("%d ",merge[i]);
    }

   return 0;
}

void partition(int arr[],int low,int high){

    int mid;

    if(low<high){
         mid=(low+high)/2;
         partition(arr,low,mid);
         partition(arr,mid+1,high);
         mergeSort(arr,low,mid,high);
    }
}

void mergeSort(int arr[],int low,int mid,int high){

    int i,m,k,l,temp[MAX];

    l=low;
    i=low;
    m=mid+1;

    while((l<=mid)&&(m<=high)){

         if(arr[l]<=arr[m]){
             temp[i]=arr[l];
             l++;
         }
         else{
             temp[i]=arr[m];
             m++;
         }
         i++;
    }

    if(l>mid){
         for(k=m;k<=high;k++){
             temp[i]=arr[k];
             i++;
         }
    }
    else{
         for(k=l;k<=mid;k++){
             temp[i]=arr[k];
             i++;
         }
    }
  
    for(k=low;k<=high;k++){
         arr[k]=temp[k];
    }
}


Sample output:

Enter the total number of elements: 5
Enter the elements which to be sort: 2 5 0 9 1
After merge sorting elements are: 0 1 2 5 9

XPath is an expressions to select a xml node in an XML document.

It allows the navigation on the XML document to the straight to the element where we need to reach and access the attributes.