Questions

A deliverable is a measurable, verifiable work product such as a specification, feasibility study report, detailed design document, or working prototype.

1. Project Charter refers to a statement of objectives in a project.

 
2. It provides a preliminary delineation of roles and responsibilities, outlines the project objectives, identifies the main stakeholders, and defines the authority of the project manager.

 
3. It serves as a reference of authority for the future of the project. The terms of reference are usually part of the project charter.

Water reabsorption by the renal tubules is harmonally controlled and it is a osmosis mechanism.

Plants are photosynthetic autotrophs, which means that they are able to produce their own food through the process called photosynthesis.

In photosynthesis, plants use light, water, and carbon dioxide to create glucose, which they convert to cellulose and use to make new cells.

Hence, that is why, Plants are called photosynthetic autotrophs.

Chloroplasts are organelles in plant and bacteria cells that contain the chlorophyll is responsible for photosynthesis.

Hard disk is the secondary storage device, which holds the data in bulk, and it holds the data on the magnetic medium of the disk.Hard disks have a hard platter that holds the magnetic medium, the magnetic medium can be easily erased and rewritten, and a typical desktop machine will have a hard disk with a capacity of between 10 and 40 gigabytes. Data is stored onto the disk in the form of files.

#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