Questions

Fat is completely digested in the small intestine of the body.

Bogibeel bridge ( 4940 m ) is a combined road and rail bridge over the Brahmaputra river in the north eastern Indian state of Assam between Dhemaji district and Dibrugarh district.

The headquarters of Tea Board of India is in Kolkata, West Bengal.

A redox reaction is a type of reaction which involves transfer of electrons among two species. This reaction is also called oxidation-reduction reaction.

In oxidation process, there is an increase in oxidation state of an atom, ion or molecule by losing the electrons.

In reduction process, there is a decrease in oxidation state of an atom, ion or molecule by accepting the electrons.

1)

In this reaction, Ba undergoes oxidation and Cl undergoes reduction.
This reaction is redox reaction.
In this reaction, oxidation number of Ba increases from 0 to +2 . So, Ba undergoes oxidation. The oxidation number of Cl decreases from 0 to -1. So, Cl undergoes reduction.

2) 

From this above reaction, it is clear that Aluminum undergoes oxidation and silver undergoes reduction.
Due to this, this reaction is redox reaction.

In this reaction, oxidation number of Aluminum increases from 0 to +1. So, aluminum undergoes oxidation. The oxidation number of silver decreases from +1 to 0. So, silver undergoes reduction.

3)

In this reaction, Mg undergoes oxidation and Br undergoes reduction.
This reaction is redox reaction.
The reactions 1, 3 and 4 are redox reactions.
In this reaction, oxidation number of Mg increases from 0 to +2 . So, Mg undergoes oxidation. The oxidation number of Br decreases from 0 to -1 . So, Br undergoes reduction.

Hence all the above reactions are redox reactions.

William James was an early proponent of functionalism.

#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