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

What is OOPS and How it is different from Procedural
Programming ?

Answer Posted / test

OOP is programming which is oriented around objects, thus
taking advantages of encapsulation, polymorphism and
inheritance to increase code reuse and decrease code
mantenance.

In procedural program, programming logic follows certain
procedures and intructions are executed one after another.
In OOP unit of program is object which is nothing but
combination of data and code.

Is This Answer Correct ?    8 Yes 11 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Can a varargs method be overloaded?

1038


What is the advantage of oop over procedural language?

1006


why reinterpret cast is considered dangerous?

2336


What are the data types in oop?

1045


What are the important components of cohesion?

968


Why is destructor used?

959


What is abstraction in oops?

984


Why is abstraction used?

1028


What is overloading in oops?

1092


What is oops and why we use oops?

991


What is encapsulation with real life example?

977


#include #include #include #include void insert(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); insert(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void insert(char *items, int count) { register int a, b; char t; for(a=1; a < count; ++a) { t = items[a]; for(b=a-1; (b >= 0) && (t < items[b]); b--) items[b+1] = items[b]; items[b+1] = t; } } design an algorithm for Insertion Sort

2564


write a programe to calculate the simple intrest and compund intrest using by function overlading

2130


How is class defined?

1071


program for insertion ,deletion,sorting in double link list

2636