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...

monkey starts climbing up a tree 20ft tall,each hour ,it
hops 3ft and slips back by 2ft .how much time it wil tak to
reach top of the tree?

Answer Posted / ayushi rastogi

Its very easy to say that 20 hr because per hour it hops
only 1ft (3ft-2ft)for 20ft it will take 20 hr.

Is This Answer Correct ?    5 Yes 21 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Why do pointers exist?

1109


Templates mean

2095


I have One image (means a group photo ) how to split the faces only from the image?............ please send the answer nagadurgaraju@gmail.com thanks in advace...

2117


What does enum stand for?

1135


How long to learn object oriented programming?

1107


What is destructor oops?

1106


Why is polymorphism important in oop?

1094


Why multiple inheritance is not possible?

1081


What is multilevel inheritance in oop?

1049


How do you explain polymorphism?

1083


What is difference between inheritance and polymorphism?

1040


What does <> mean pseudocode?

1203


#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.

3778


What is the advantage of oop over procedural language?

1096


is there any choice in opting subjects like 4 out of 7

2198