Questions

Yeast belongs to members of the Kingdom Fungi.

Yeast are single-celled microorganisms that are classified, along with molds and mushrooms in Fungi family. 

Yeasts are evolutionally diverse and are therefore classified into two separate phyla, Ascomycota or sac fungi and Basidiomycota or higher fungi, that together form the subkingdom Dikarya.

Flag is called as Low order rigister & Accumulator is called as High order Rigister.

Animals and people who eat both animals and plants i.e, both producers and consumers are called omnivores.

A chromatid is one copy of a newly copied chromosome which is still joined to the original chromosome by a single centromere.

The two identical copies—each forming one half of the replicated chromosome are called chromatids.

Chromonema is the fibre-like structure in prophase in the primary stage of DNA condensation. In metaphase, they are called chromatids.

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.

#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