Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

Mphasis Funny Interview Questions Interview Questions
Questions Answers Views Company eMail

Rich man keeps me in the pocket poor man throws me away kids eat me its tamil word _u_e_l who am i?

26 83829

What is the academic record expected for admission into the IIM? Is it possible to get into IIM with just 8.5cgpa in my B.E.?

1 5827

Post New Mphasis Funny Interview Questions Interview Questions


Mphasis Funny Interview Questions Interview Questions


Un-Answered Questions

What are the different flavor of apache web server you know?

1011


What is the order of sql select?

1088


Define Designer?

991


what is difference between lilo and grub in linux operating system?

998


#include #include #include #include void insert(struct btreenode **, int); void inorder(struct btreenode *); struct btreenode { struct btreenode *leftchild; struct btreenode *rightchild; int data; }; main() { struct btreenode *bt; bt=(struct btreenode *)NULL; int req,i=1,num; clrscr(); printf("Enter number of nodes"); scanf("%d",&req); while(i<=req) { printf("Enter element"); scanf("%d",&num); insert(&bt,num); i++; } inorder(bt); } void insert(struct btreenode **sr, int num) { if(*sr==NULL) { *sr=(struct btreenode *)malloc (sizeof(struct btreenode)); (*sr)->leftchild=(struct btreenode *)NULL; (*sr)->rightchild=(struct btreenode *)NULL; (*sr)->data=num; return; } else { if(num < (*sr)->data) insert(&(*sr)->leftchild,num); else insert(&(*sr)->rightchild,num); } return; } void inorder(struct btreenode *sr) { if(sr!=(struct btreenode *)NULL) { inorder(sr->leftchild); printf("\n %d",sr->data); inorder(sr->rightchild); } else return; } please Modify the given program and add two methods for post order and pre order traversals.

3830


What are the germination requirements for apple seeds?

2105


To how much extent skin color depends on genes?

2338


Explain what are acid properties?

1057


What are the different artifacts in scrum?

5


what is the test plan for ms-word

2555


When to use var or IEnumerable to store query result in LINQ?

113


Define sanitization process?

306


What s a toxoid?

1000


I used "update" command without where clause. What would happen?

1


Tell me whether the account “cash” will be credited or debited, when a company pays a bill?

1103