Questions

The simplest organic compounds contain only the elements carbon and hydrogen, and are called hydrocarbons.

Here all the given options are hydrocarbons.

In the middle of the 6th centuryB.C, a powerful empire was established in Iran this empire which lasted over two centuries is known as the Achaemenid Empire. The founder of this Empire was Cyrus with his capital at pasargadae. In 539 B.C, cyrus defeated the Babylonians and extended his empire over a vast territory up to Asia Miner. His successor was Darius I (522-486 B.C).

I. Inputs

• Enterprise environmental factors


• Organizational process assets


• Project scope statement


• Work breakdown structure


• WBS dictionary


• Project management plan

II. Tools and Techniques

• Decomposition


• Templates


• Rolling wave planning


• Expert judgment


• Planning component

III. Outputs

• Activity list


• Activity attributes


• Milestone list


• Requested changes

Be frank. Some established designers use no or little computer software in their work. Others rely heavily on technology (CAD). Simply explain how you work. If you are an efficient designer, your use of computer software will not be relevant.

These days channel members are being accepted by companies as their partners. The intermediaries are even being asked to integrate their business with the companies which results in lesser costs, greater efficiency and improved customer service. Corporates like Airtel are adopting PRM (Partner relationship management) software to give that added advantage to their supply chain. They organise rewards and recognition programs for their channel partners and also organise proper channels though which partners can vent any of their grievances relating to payments, violation of codes etc.

#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