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


c++ is a purely oop concept?

Answers were Sorted based on User's Feedback



c++ is a purely oop concept?..

Answer / mah

no

Is This Answer Correct ?    33 Yes 8 No

c++ is a purely oop concept?..

Answer / nithya

c++ is not a purely object oriented language because it is possible to write programs without classes unlike java which is purely oop as programs can exist only with classes

Is This Answer Correct ?    25 Yes 2 No

c++ is a purely oop concept?..

Answer / ananthi

no without oops features also we can use c++

Is This Answer Correct ?    13 Yes 2 No

Post New Answer

More OOPS Interview Questions

How do you answer polymorphism?

0 Answers  


how does a main() in C++ is different from main() in C?

7 Answers  


define oops concept with example

1 Answers   Cap Gemini,


Difference between new operator and operator new

2 Answers  


what is the advantage in software? what is the difference between the software developer and Engineer

1 Answers  


Can destructor be overloaded?

0 Answers  


What is encapsulation oop?

0 Answers  


What does and I oop mean in text?

0 Answers  


what is the difference between inter class and abstract class...?

0 Answers  


#include <stdio.h> #include <alloc.h> #include <stdlib.h> #include <conio.h> 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.

0 Answers  


difference between overloading and overridding

11 Answers  


write a c++ code of diagonal matrix.

2 Answers  


Categories