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

Precompilation ?

Answer Posted / gauravjeet singh

In Web site development with ASP.NET, version 2.0 of ASP.NET includes an application deployment utility called the Pre-compilation Tool. Using this tool, Web developers are able to pre-compile a dynamic application prior to deployment and the Pre-compilation Tool will automatically identify any compilation issues anywhere within the site. The tool also lets ASP.NET applications to be deployed without any source being stored on the server.

Is This Answer Correct ?    7 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What are the advantages of polymorphism?

1080


what is the drawback of classical methods in oops?

3428


What is difference between multiple inheritance and multilevel inheritance?

1191


What is difference between oop and pop?

1237


What is and I oop mean?

1275


What are the 4 main oop principles?

1264


What are the three parts of a simple empty class?

2095


What are the 3 pillars of oop?

1243


What is the benefit of oop?

1101


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

3821


What is destructor in oop?

1081


What is inheritance write a program to show use of inheritance?

1200


What is an interface in oop?

1087


Can private class be inherited?

1222


How do you use inheritance in unity?

1125